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 re-optimizer 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 re-optimization.

[1]  George N. Rouskas,et al.  Dynamic reconfiguration in broadcast wdm networks , 1998 .

[2]  George N. Rouskas,et al.  Dynamic reconfiguration policies for WDM networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Steven S. Lumetta,et al.  Evaluation of protection reconfiguration for multiple failures in WDM mesh networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..

[4]  M. Kodialam,et al.  A simple traffic independent scheme for enabling restoration oblivious routing of resilient connections , 2004, IEEE INFOCOM 2004.

[5]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[6]  Serge A. Plotkin.  Competitive Routing of Virtual Circuits in ATM Networks , 1995, IEEE J. Sel. Areas Commun..

[7]  Murti V. Salapaka,et al.  Approaches for capacity and revenue optimization in survivable WDM networks , 2001, J. High Speed Networks.

[8]  J.-F.P. Labourdette,et al.  Analysis and Design of Fully Shared Networks , 1994 .

[9]  A. Orda,et al.  QoS routing mechanisms and OSPF extensions , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[10]  Yakov Rekhter,et al.  Mpls: Technology and Applications , 2000 .

[11]  Anthony S. Acampora,et al.  Branch-exchange sequences for reconfiguration of lightwave networks , 1994, IEEE Trans. Commun..

[12]  Randeep Bhatia,et al.  Designing Networks with Existing Traffic to Support Fast Restoration , 2004, APPROX-RANDOM.

[13]  Randeep Bhatia,et al.  Preprovisioning networks to support fast restoration with minimum over-build , 2004, IEEE INFOCOM 2004.

[14]  Lorne Mason,et al.  Restoration strategies and spare capacity requirements in self-healing ATM networks , 1999, TNET.

[15]  Vijay Srinivasan,et al.  RSVP-TE: Extensions to RSVP for LSP Tunnels , 2001, RFC.

[16]  Deep Medhi.  Multi-hour, multi-traffic class network design for virtual path-based dynamically reconfigurable wide-area ATM networks , 1995, TNET.

[17]  A. Herschtal,et al.  Dynamic capacity allocation and optimal rearrangement for reconfigurable networks , 1995, Proceedings of GLOBECOM '95.

[18]  D. W. Anding.  Service offerings utilizing digital cross-connect systems-A Bell South perspective , 1988, IEEE International Conference on Communications, - Spanning the Universe..

[19]  Dhadesugoor R. Vaman,et al.  Reconfiguration for Service and Self-Healing in ATM Networks Based on Virtual Paths , 1997, Comput. Networks ISDN Syst..

[20]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[21]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[22]  M. Gerla,et al.  Topological reconfiguration of ATM networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[23]  Biswanath Mukherjee,et al.  Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study , 2000, TNET.

[24]  George N. Rouskas,et al.  Dynamic Reconfiguration in Multihop WDM Networks , 1995, J. High Speed Networks.

[25]  Eric Bouillet,et al.  Lightpath Re-optimization in mesh optical networks , 2005, IEEE/ACM Transactions on Networking.

[26]  Biswanath Mukherjee,et al.  Virtual-topology adaptation for WDM mesh networks under dynamic traffic , 2003, TNET.