摘要
在分析现有MPLS快速重路由算法基础上提出了一种分布式的MPLS快速重路由算法,并给出了算法描述。算法通过划分自治域并行预先建立备份路径,从而降低了原来算法中对整个拓扑预先建立备份路径的复杂度。仿真试验表明该算法在丢包率、重路由成功率上比现有算法有较好的性能。
A novel MPLS fast rerouting algorithm is presented and described in detail. The algorithm is characterized by dividing the core network into several autonomous domains to make pre- constructed backup path in parallel, thus reduce the complexity. The simulation results show the given algorithm generate lower packet loss and higher success ratio.
出处
《计算机工程与设计》
CSCD
北大核心
2007年第2期365-367,共3页
Computer Engineering and Design
基金
河南省自然科学基金项目(0411014100)
