Journal of Northeastern University ›› 2005, Vol. 26 ›› Issue (8): 736-738.DOI: -

• OriginalPaper • Previous Articles     Next Articles

A kind of dynamic routing algorithm of weight allocation for traffic engineering

Du, Li (1); Yang, Lin (1); Li, Jun (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2005-08-15 Published:2013-06-24
  • Contact: Du, L.
  • About author:-
  • Supported by:
    -

Abstract: Proposes a new dynamic routing algorithm of weight allocation for MPLS networks, taking mainly the hops, demands for bandwidth fragment and idle bandwidth rate into account to allocate rationally the bandwidth resource for incoming traffic. After implementing the routing selection at the border of MPLS networks, the explicit routing technique in MPLS is used to get rid of the effect of routing algorithms at middle nodes so as to give an LSP that will meet QoS requirements of all kinds of services. The simulation results indicated that the new algorithm can balance the traffic better, decrease the congestion in networks, utilize sufficiently the network resources by decreasing bandwidth fragment and enhancing the utilization of bandwidth and guarantee QoS to a certain extent by improving some parameters such as the losing rate.

CLC Number: