Fast Network Re-optimization Schemes for MPLS and Optical Networks
This paper presents algorithms for re-optimizing network routing in connection-oriented networks such as Multi-Protocol Label Switched (MPLS) networks. The objective in re-optimization is to allow the network to carry more traffic without adding capacity. The need for re-optimization arises because of dynamic connection routing where connections, such as bandwidth guaranteed Label Switched Paths (LSPs) in MPLS networks, are routed as they arrive one-by-one to the network. Continual dynamic routing leads to network inefficiencies due to the limited information available for routing and due to simple path selection algorithms often used to satisfy connection set-up time constraints. We present a re-optimization scheme, where the reoptimizer constantly monitors the network to determine if re-optimization will lead to sufficient network efficiency benefits. When sufficient benefits can be obtained, the re-optimizer computes the least cost set of connections which must be re-routed to attain the necessary network efficiency and then computes the routes for the connections to be re-routed. We develop efficient re-optimization algorithms and demonstrate by simulations that several network performance metrics are significantly improved by reoptimization.
KeywordsOptical Network Node Pair Polynomial Time Approximation Scheme Edge Router Demand Matrix
Unable to display preview. Download preview PDF.
- 1.A. Awduche, L. Berger, D. Gan, T. Li, V Srinivasan, G. Swallow, “RSVP-TE: Extensions to RSVP for LSP Tunnels”, IETF RFC 3209, December 2001.Google Scholar
- 2.N. Garg and J. Könemann, “Faster and Simpler Algorithms for Multi-commodity Flow and other Fractional Packing Problems”, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 300–309, 1998.Google Scholar
- 3.R. Guerin, D. Williams, A. Orda, “QoS Routing Mechanisms and OSPF Extensions”, Proceedings of IEEE Globecom 1997.Google Scholar
- 4.B. Davie, Y. Rekhter, “MPLS Technology and Applications”, Morgan Kaufman Publishers, 2000.Google Scholar
- 5.G. Karakostas, “Faster approximation schemes for fractional multicommodity flow problems”, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 166–173, 2002.Google Scholar
- 6.K. Kar, M. Kodialam, T. V. Lakshman, “Minimum Interference Routing of Bandwidth Guaranteed Tunnels with Applications to MPLS Traffic Engineering”, IEEE Journal on Selected Areas in Communications: Special Issue on Quality of Service in the Internet, December 2000.Google Scholar
- 7.S. Plotkin, Competitive Routing of Virtual Circuits in ATM Networks, IEEE J.Selected Areas in Comm., 1995 pp. 1128–1136. Special Issue on Advances in the Fundamentals of Networking.Google Scholar