Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2005, Vol. 28 ›› Issue (2): 21-24.doi: 10.13190/jbupt.200502.21.cuibf

• Papers • Previous Articles     Next Articles

A Parallel Label Switch Paths Traffic Allocation Algorithm Based on Minimum Utilization of Resource

CUI Bingfeng,YANG Zhen,DING Wei   

  1. Institute of Communication Networks Integrated Technique, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Online:2005-04-28 Published:2005-04-28

Abstract: A parallel label switch paths (LSP) traffic allocation algorithm based on hops and delay is proposed. The algorithm distributes traffic among LSPs according to hops and delay of each LSP adaptively,which can avoid congestion results from shortest path forwarding in traditional internet protocol (IP) routers. Simulation demonstrated that the algorithm could converge to pre defined value after about 15 iterations and achieve optimization of resource utilization in multiprotocol label switching (MPLS) networks.

Key words: multiprotocol label switching; label switch paths; hops, delay

CLC Number: