A Minimum Cut Interference-based Integrated RWA Algorithm for Multi-constrained Optical Transport Networks

Advances in optical technologies have enabled the deployment of wavelength division-multiplexed (WDM) transmission systems capable of providing huge amounts of bandwidth across long distances. In this scenario, dynamic routing for direct provisioning of optical paths at the WDM layer becomes a challenging problem. Any distributed algorithm for routing dynamic traffic demands on optical transport infrastructures should be simple, flexible, efficient and scalable. The contribution of this paper is a novel integrated routing and grooming scheme for setting-up bandwidth guaranteed paths on hybrid wavelength and label switched networks. Our proposal exploits and refines the minimum interference routing idea according to an improved and re-optimized resource and traffic-aware approach, where critical links are detected and weighted according to a low complexity all-pairs minimum cut strategy that substantially reduce the overall number of calculations and hence the computational cost. The valuable results achieved in the comparison against other well-known reference techniques clearly demonstrate that our algorithm is very time-efficient while performing better in terms of blocking probability.

[1]  Harry R. Lewis,et al.  Data structures & their algorithms , 1991 .

[2]  Suresh Subramaniam,et al.  Dynamic LSP provisioning in overlay, augmented, and peer architectures for IP-MPLS over WDM networks , 2004, IEEE INFOCOM 2004.

[3]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[4]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[5]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[6]  Subhash Suri,et al.  Profile-Based Routing: A New Framework for MPLS Traffic Engineering , 2001, QofIS.

[7]  Raouf Boutaba,et al.  DORA: Efficient Routing for MPLS Traffic Engineering , 2002, Journal of Network and Systems Management.

[8]  Kireeti Kompella,et al.  OSPF Extensions in Support of Generalized MPLS , 2001 .

[9]  Yongtao Gong,et al.  A novel adaptive RWA algorithm in wavelength-routed network , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[10]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[13]  Arun K. Somani,et al.  On Traffic Grooming Choices for IP over WDM networks , 2006, 2006 3rd International Conference on Broadband Communications, Networks and Systems.

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

[15]  Harry R. Lewis,et al.  Data Structures and Their Algorithms , 1991 .

[16]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[17]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[18]  Toshihide Ibaraki,et al.  A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph , 1992, Algorithmica.

[19]  Francesco Palmieri,et al.  SPARK: A smart parametric online RWA algorithm , 2007, Journal of Communications and Networks.

[20]  W. Gong,et al.  A New Method for Solving Routing and Wavelength Assignment Problems in Optical Networks , 2007, Journal of Lightwave Technology.

[21]  Victor O. K. Li,et al.  Integrated routing and grooming in GMPLS-based optical networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[22]  Peter Ashwood-Smith,et al.  Generalized MPLS - Signaling Functional Description , 2000 .

[23]  Mechthild Stoer,et al.  A Simple Min Cut Algorithm , 1994, ESA.

[24]  James B. Orlin,et al.  A faster algorithm for finding the minimum cut in a graph , 1992, SODA '92.

[25]  Khaled M. F. Elsayed.  HCASP: A hop-constrained adaptive shortest-path algorithm for routing bandwidth-guaranteed tunnels in MPLS networks , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[26]  Bin Wang,et al.  A new bandwidth guaranteed routing algorithm for MPLS traffic engineering , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[27]  C. Siva Ram Murthy,et al.  Distributed dynamic QoS-aware routing in WDM optical networks , 2005, Comput. Networks.

[28]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[29]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[30]  Murali S. Kodialam,et al.  Integrated dynamic IP and wavelength routing in IP over WDM networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).