一种资源占用最小的并行LSPs流量分配算法  

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

作　　者：崔丙锋[1] 杨震[1] 丁炜[1] 

机构地区：[1]北京邮电大学通信网络综合技术研究所,北京100876

出　　处：《北京邮电大学学报》2005年第2期21-24,共4页Journal of Beijing University of Posts and Telecommunications

基　　金：教育部博士专项基金(20020013011)

摘　　要：提出了一种资源占用最小的并行标签交换路径(LSPs)流量分配算法.该算法根据LSP(labelswitchpaths)的跳数和时延来进行自适应流量分配,避免了传统基于最短路径路由流量分配算法引起的网络拥塞.仿真表明,该算法经过约15次迭代就可以收敛到预定的阈值,实现多协议交换网络资源的优化利用.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.

关 键 词：多协议标签交换 标签交换路径 跳数 时延 

分 类 号：TN913.24[电子电信—通信与信息系统]