Design of MPLS over DWDM architecture for unicast and anycast flows

Authors:
Jakub Gladysz;Krzysztof Walkowiak
Affiliations:
Systems and Computer Networks, Faculty of Electronics, Wroclaw and University of Technology, Wroclaw, Poland;Systems and Computer Networks, Faculty of Electronics, Wroclaw and University of Technology, Wroclaw, Poland
Venue:
ruSMART/NEW2AN'10 Proceedings of the Third conference on Smart Spaces and next generation wired, and 10th international conference on Wireless networking
Year:
2010

Citing 7
Cited 0

Tabu Search

Tabu Search
Connection-oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks

Connection-oriented Networks: SONET/SDH, ATM, MPLS and Optical Networks
Handbook On Theoretical And Algorithmic Aspects Of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks

Handbook On Theoretical And Algorithmic Aspects Of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks
Versatile anycasting with mobile IPv6

AAA-IDEA '06 Proceedings of the 2nd international workshop on Advanced architectures and algorithms for internet delivery and applications
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Content Networking: Architecture, Protocols, and Practice (The Morgan Kaufmann Series in Networking)

Content Networking: Architecture, Protocols, and Practice (The Morgan Kaufmann Series in Networking)
QoS routing for anycast communications: motivation and an architecture for DiffServ networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work we present models and computational results of CFA (Capacity and Flow Assignment) problem in two-layer networks based on MPLS over DWDM architecture. We assume that unicast and anycast demands are used in the upper layer and the lower layer DWDM is responsible for physical transmission. The unicast (one-to-one) is the most popular traffic in the Internet. The anycast (one-to-one-of-many) has the goal to deliver a packet to or from one of many hosts. To obtain optimal solution we intend to use CPLEX linear programming package. The considered problem is NP-complete - with a growing size of the network, finding the optimal solution may be difficult in reasonable time. Therefore, to solve larger problem instances we propose new heuristic algorithms. To our best knowledge this is the first paper that applies heuristic algorithms for unicast and anycast traffic in multi-layer networks.