针对MPLS网络流量工程的链路关键性路由算法  

Link Criticality Routing Algorithm for MPLS Traffic Engineering

作　　者：唐治果[1] 李乐民[1] 虞红芳[1] 

机构地区：[1]电子科技大学宽带光纤传输与通信网技术重点实验室,成都610054

出　　处：《电子与信息学报》2007年第5期1187-1190,共4页Journal of Electronics & Information Technology

基　　金：国家自然科学基金(60302010)资助课题

摘　　要：该文针对多协议标签交换(MPLS)网络流量工程提出了一种链路关键性路由算法(LCRA),该算法通过定义链路的平均期望负载来确定链路的关键性,进而映射为链路的权值来决定路由的选择。该算法的目的是使网络快捷地建立尽可能多的有带宽保证的路由,并且使这些路由均衡通过网络,实现网络负载均衡。与其他算法相比,该算法在路由拒绝率和重路由性能方面有很好的表现,并且路由的建立时间相当快捷。Link Criticality Routing Algorithm （LCRA） is presented for Multi-Protocol Label Switch （MPLS） traffic engineering. It defines the link weight and chooses a path for a Label Switch Path set-up request through defining the average expectation load of links and determining the criticality of links. The main objective of LCRA is to swiftly set up paths as many as possible with bandwidth guaranteed, and matte these paths go through evenly the network. Simulation shows the algorithm is better than other algorithms in reject ratio of the traffic requests and performance of rerouting the traffic requests when a link is failure, especially in computing time cost.

关 键 词：负载均衡 多协议标签交换 流量工程 标签交换路径 

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