Traffic engineering for MPLS-based virtual private networks

Authors:
Chun Tung Chou
Affiliations:
School of Electrical, Computer and Telecommunications Engineering, University of Wollongong, Northfields Avenue, Wollongong, NSW 2522, Australia
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2004

Citing 8
Cited 2

A competitive local search heuristic for the subset sum problem

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Genetic Algorithm for the Multidimensional Knapsack Problem

Journal of Heuristics
Formulation of the Traffic Engineering Problems in MPLS Based IP Networks

ISCC '00 Proceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications

IEEE Journal on Selected Areas in Communications
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications
Traffic engineering with MPLS in the Internet

IEEE Network: The Magazine of Global Internetworking

Loop-free path restoration with QoS and label constraints in MPLS networks

Journal of High Speed Networks
Loop-free traffic engineering with path protection in MPLS VPNs

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers the traffic engineering of MPLS-based Virtual Private Networks (VPNs) with multiple classes of service in an offline and centralised setting. We focus on two main issues. Firstly, we point out that the one label switched path (LSP) per ingress-egress pair constraint can be relaxed for the case of MPLS-based VPNs due to the ease in classifying flows on a per-VPN basis. This allows us to use LSP with finer granularity and thus better load balancing. Secondly, we point out that the single objective traffic engineering formulations proposed in literature address only one particular aspect of the traffic engineering problem. In this paper, we propose a multiobjective traffic engineering problem which takes resource usage, link utilisation and number of LSPs into account. The proposed optimisation problem is NP-complete and involves a large number of variables. We propose an heuristic to solve this problem.