A coarse-grained differentiated routing algorithm in multi-protocol label switching traffic engineering

A new coarse-grained differentiated least interference routing algorithm (CDLI) with DiffServ-Aware was presented. This algorithm is composed of off-line and on-line stages, taking into account both real-time traffic and best-effort traffic. Off-line stage is to determine the shortest path set disjointed path (DP) database for real-time traffic, and to identify link critical value by traffic profile information of real-time traffic and DP database. On-line stage is at first to select route in the DP database for real-time traffic, if there is no path to meet the needs, the dynamic routing will be operated. On-line routing algorithm chooses the relatively short path for real-time traffic to meet their bandwidth requirements, and for best-effort traffic it chooses a lighter load path. The simulation results show that compared with the dynamic online routing algorithm (DORA) and constrained shortest path first (CSPF) algorithm, the new algorithm can significantly improve network throughput and reduce the average path length of real-time traffic. This guarantees quality of service (QoS) of real-time traffic while improving the utilization of network resources.

[1]  J. Barakovic,et al.  QoS Design Issues and Traffic Engineering in Next Generation IP/MPLS Network , 2007, 2007 9th International Conference on Telecommunications.

[2]  D.A. Karras,et al.  A Framework for Traffic Engineering and Routing in Survivable Multi-service High Bit Rates Optical Networks , 2006, Proceedings ELMAR 2006.

[3]  Sung-Kwan Youm,et al.  Traffic Engineering using a Heuristic Multi-Path Routing Strategy in MPLS Network , 2006, 2006 Asia-Pacific Conference on Communications.

[4]  Zheng Zhi.  A Least Interference Path Algorithm for MPLS Traffic Engineering , 2007 .

[5]  Sung Hei Kim,et al.  Advanced Routing Algorithms and Load Balancing on MPLS , 2007, The 9th International Conference on Advanced Communication Technology.

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

[7]  Cui Yong,et al.  Study of Minimum Interference Routing Algorithm for MPLS Traffic Engineering , 2006 .

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

[9]  Wolfgang Huber,et al.  Interference minimizing bandwidth guaranteed on-line routing algorithm for traffic engineering , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

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

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

[12]  Choong Seon Hong,et al.  M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering , 2005 .

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

[14]  Philip Jacob,et al.  Technical challenges in the delivery of interprovider QoS , 2005, IEEE Communications Magazine.

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