A Framework for Traffic Engineering and Routing in Survivable Multi-service High Bit Rates Optical Networks

This paper presents a general framework for traffic engineering (TE) of primary and backup paths and routing of quality of service (QoS) and best-effort (BE) flows in multi-service high bit rates optical networks capable of surviving against single or multiple node and/or link failure(s). The aforementioned framework involves an off-line and an on-line phase. In the off-line phase either a method based on a integer linear programming (ILP) TE problem or a method based on a heuristic TE algorithm provides the primary and backup routes for the QoS-guaranteed flows, where backup paths are required, and the routes for the BE flows. In the on-line phase the QoS and BE flows are routed based on the outputs of the off-line phase. In the case that one or more primary paths fail the corresponding backup paths are used for restoration. However, if one or more backup paths also fail or a backup path is not defined, dynamic restoration is applied utilising a special source-routing algorithm. Implementation issues are also discussed and test results regarding the two off-line TE methods are presented

[1]  Kazutaka Murakami,et al.  Comparative study on restoration schemes of survivable ATM networks , 1997, Proceedings of INFOCOM '97.

[2]  Rallis C. Papademetriou,et al.  NetLab - an interactive simulation environment for communication networks , 2003, International Conference on Information Technology: Research and Education, 2003. Proceedings. ITRE2003..

[3]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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

[5]  Lionel M. Ni,et al.  Traffic engineering with MPLS in the Internet , 2000, IEEE Netw..

[6]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Ezhan Karasan,et al.  Robust path design algorithms for traffic engineering with restoration in MPLS networks , 2002, Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications.

[8]  D. Medhi,et al.  MPLS Traffic Engineering for Survivable Book-Ahead Guaranteed Services∗ , 2001 .

[9]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[10]  Subhash Suri,et al.  Profile-based routing and traffic engineering , 2003, Comput. Commun..

[11]  George Pavlou,et al.  Quality of service provisioning for supporting premium services in IP networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[12]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[13]  K. G. Ramakrishnan,et al.  Techniques for traffic engineering of multiservice, multipriority networks , 2001, Bell Labs Technical Journal.

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  John K. Ousterhout,et al.  Tcl and the Tk Toolkit , 1994 .