MPLS over WDM network design with packet level QoS constraints based on ILP models

Gouveia, Luís; Patrício, Pedro; Sousa, Amaro de; Valadas, Rui

doi:10.1109/infcom.2003.1208708

Cited by 41 publications

(32 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In our literature search, we have only come across two papers [8,14] that discuss the issue of regenerator placement within the context of a large network design problem. In this paper we focus on the RLP as a stand alone problem.…”

Section: Introductionmentioning

confidence: 99%

The regenerator location problem

2009

View full text Add to dashboard Cite

In this paper we introduce the regenerator location problem (RLP), which deals with a constraint on the geographical extent of transmission in optical networks. Specifically, an optical signal can only travel a maximum distance of d max before its quality deteriorates to the point that it must be regenerated by installing regenerators at nodes of the network. As the cost of a regenerator is high we wish to deploy as few regenerators as possible in the network, while ensuring all nodes can communicate with each other. We show that the RLP is NP-Complete. We then devise three heuristics for the RLP. We show how to represent the RLP as a max leaf spanning tree problem (MLSTP) on a transformed graph. Using this fact we model the RLP as a Steiner arborescence problem (SAP) with a unit degree constraint on the root node. We also devise a branch-and-cut procedure to the directed cut formulation for the SAP problem. In our computational results over 740 test instances, the heuristic procedures obtained the optimal solution in 454 instances, while the branch-and-cut procedure obtained the optimal solution in 536 instances. These results indicate the quality of the heuristic solutions are quite good, and the branch-and-cut approach is viable for the optimal solution of problems with up to 100 nodes. Our approaches are also directly applicable to the MLSTP indicating that both the heuristics and branch-and-cut approach are viable options for the MLSTP.

show abstract

Section: Introductionmentioning

confidence: 99%

The regenerator location problem

2009

View full text Add to dashboard Cite

show abstract

“…Because of the computational complexity of the joint problem, most of the studies in the literature focus on the subproblems corresponding to one layer and omit those arising in the other layer [3][4][5][6], or make simplifying assumptions to relax some of the subproblems [7][8][9]. There are also studies proposing formulations and solution methods for the joint problem [2,10].…”

Section: Multi-layer Virtual Topology Designmentioning

confidence: 99%

“…(6) is the nodal interface constraint. Constraint (7) ensures that each established lightpath is routed along a path and assigned a wavelength in the optical layer, and constraint (8) is the optical link capacity constraint.…”

Section: Milp Formulationmentioning

confidence: 99%

Multi-layer Virtual Topology Design in Optical Networks Under Physical Layer Impairments and Multi-hour Traffic Demand

Sengezer

Karasan

2012

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Abstract-In this paper, we consider the virtual topology design (VTD) problem in multi-protocol label switching (MPLS)/wavelength division multiplexing (WDM) networks with an hourly changing traffic pattern, in the presence of physical layer impairments. We propose a multi-layer VTD scheme that satisfies the constraints in both layers with guaranteed bit error rates assuming no wavelength conversion. The proposed scheme involves interaction of the control planes of MPLS and WDM layers and can be applied without the necessity of a unified control plane. When the virtual topology is designed by considering only MPLS layer constraints, some lightpaths in the designed topology cannot be established, and this may result in a large amount of blocked traffic. We show that, by applying interaction between MPLS and WDM layers during topology design, the blocking ratio is reduced by an amount between 53% and 89% in the investigated cases. We also propose different information sharing strategies between the layers and show that, if physical layer information is available to the MPLS layer, a better blocking performance can be achieved and physical layer resource usage can be reduced by an amount up to 21%.Index Terms-Optical network; Physical layer impairments; Routing and wavelength assignment (RWA); Static lightpath establishment; Virtual topology design; Wavelength division multiplexing (WDM).

show abstract

“…However, it is generally impossible to provide single hop connectivity between each pair of end nodes due to limited number of router interfaces, optical impairments and other scalability issues. Consequently, it is necessary to create multihop paths and have electronic switching over multiple lightpaths for traffic between some source and destination pairs [1], [9], [12], [13].…”

Section: Introductionmentioning

confidence: 99%

“…In this case, grooming for multihop traffic is typically left for routing policy at a higher layer such as IP or MPLS [6], [7]. Recently, some algorithms have been proposed for multihop optical networks by relaxing some constraints [2], [12], [13]. Also, some graph models have been proposed for multihop logical topology design and traffic grooming [8], [9].…”

Section: Introductionmentioning

confidence: 99%

Rollout algorithms for logical topology design and traffic grooming in multihop WDM networks

Lee

Shayman²

2005

GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.

View full text Add to dashboard Cite

Abstract-In this paper we consider the logical topology design and traffic grooming problem in multihop WDM networks. Usually, this problem is defined as an integer linear program (ILP) which is NP-complete. This justifies the use of heuristic algorithms. Many heuristic algorithms differ in the order of traffic demands considered for lightpath provisioning. We apply the technique of 'rollout' to systematically improve the performance of various heuristic algorithms by approximately optimizing the order in which traffic demands are considered. Through simulation experiments, we show that the performance of the rollout algorithms we derive are clearly superior not only to that of the initial heuristic algorithms on which they are based, but also to that of other well-known heuristic algorithms.

show abstract

MPLS over WDM network design with packet level QoS constraints based on ILP models

Cited by 41 publications

References 13 publications

The regenerator location problem

The regenerator location problem

Multi-layer Virtual Topology Design in Optical Networks Under Physical Layer Impairments and Multi-hour Traffic Demand

Rollout algorithms for logical topology design and traffic grooming in multihop WDM networks

Contact Info

Product

Resources

About