L-MMIRA: Light Multicast Minimal Interference Routing Module in MPLS Network

LSP path selection problem in MPLS network has been a hot research field. For unicast, there are already many algorithms to solve it, making the network more resource balanced and useable. Among these algorithms, Minimal Interference Routing Algorithm (MIRA) is the most valued one. This paper presents a novel algorithm for multicast LSP setting up problem based on MIRA, which replaces Maxflow with K time Dijkstra algorithm, and the experiment result shows it achieves much less complexity than traditional algorithm MIRA while providing a good conflict avoiding mechanism.

[1]  Murali Kodialam,et al.  MPLS traffic engineering using enhanced minimum interference routing: an approach based on lexicographic max-flow , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).

[2]  Nelson Luis Saldanha da Fonseca,et al.  A minimum interference routing algorithm , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[3]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[4]  Antoine B. Bagula.  Hybrid traffic engineering: the least path interference algorithm , 2004 .

[5]  Tibor Cinkler,et al.  A precomputation scheme for minimum interference routing: the least-critical-path-first algorithm , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Hussein M. Alnuweiri,et al.  A fuzzy constraint-based routing algorithm for traffic engineering , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[7]  Raouf Boutaba,et al.  Dynamic Online Routing Algorithm for MPLS Traffic Engineering , 2002, NETWORKING.

[8]  Murali S. Kodialam,et al.  Online multicast routing with bandwidth guarantees: a new approach using multicast network flow , 2003, TNET.

[9]  Deepak Kumar,et al.  Routing guaranteed bandwidth virtual paths with simultaneous maximization of additional flows , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[10]  Antoine B. Bagula,et al.  Online traffic engineering: the least interference optimization algorithm , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[11]  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).

[12]  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).

[13]  Angela L. Chiu,et al.  Overview and Principles of Internet Traffic Engineering , 2002, RFC.

[14]  Daniel Bauer,et al.  A New Class of Online Minimum-Interference Routing Algorithms , 2002, NETWORKING.