Multiple Paths Selection Algorithm for DiffServ-Aware MPLS Traffic Engineering

This paper proposes a new per-class bandwidth constraint algorithm, called the multipath selection algorithm (MSA), for a DiffServ-aware traffic engineering (DiffServ-TE). The MSA comprises three steps. First, a given source uses the MSA to find multiple label switch paths (LSPs) from the source to a destination for a specific class type (CT). Second, the source uses the available bandwidth of the CT on all the links along these LSPs to allocate the initial traffic to the selected LSPs. Third, the source dynamically adjusts traffic to these LSPs based on individual round trip time. Simulation results indicate that the proposed algorithm offers better performance than existing approaches in average transmission time, average packet loss rate, average throughput, and available bandwidth variance for each link.

[1]  Dongli Zhang,et al.  QoS Performance Analysis in Deployment of DiffServ-aware MPLS Traffic Engineering , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

[2]  Ram Krishnan,et al.  Multi-Protocol Label Switching (MPLS) Support of Differentiated Services , 2002, RFC.

[3]  Yong-liu,et al.  QoS Performance Analysis in Deployment of DiffServ-aware MPLS Traffic Engineering , 2007 .

[4]  Oliver W. W. Yang,et al.  Bandwidth Management for Supporting Differentiated Service Aware Traffic Engineering , 2007, IEEE Transactions on Parallel and Distributed Systems.

[5]  Jerry Ash,et al.  Max Allocation with Reservation Bandwidth Constraints Model for Diffserv-aware MPLS Traffic Engineering & Performance Comparisons , 2005, RFC.

[6]  Ian F. Akyildiz,et al.  New preemption policies for DiffServ-aware traffic engineering to minimize rerouting in MPLS networks , 2004, IEEE/ACM Transactions on Networking.

[7]  Zartash Afzal Uzmi,et al.  CAIP: a restoration routing architecture for DiffServ aware MPLS traffic engineering , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

[8]  Wai Sum Lai,et al.  Maximum Allocation Bandwidth Constraints Model for Diffserv-aware MPLS Traffic Engineering , 2005, RFC.

[9]  Wai Sum Lai,et al.  Requirements for Support of Differentiated Services-aware MPLS Traffic Engineering , 2003, RFC.

[10]  Ariel Orda,et al.  Computing shortest paths for any number of hops , 2002, TNET.

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

[12]  Francois Le Faucheur,et al.  Considerations on Bandwidth Constraints Models for DS-TE , 2002 .

[13]  Aviezri S. Fraenkel,et al.  Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N , 1981, ICALP.

[14]  Francois Le Faucheur,et al.  Russian Dolls Bandwidth Constraints Model for Diffserv-aware MPLS Traffic Engineering , 2005, RFC.

[15]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[16]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.