GMPLS网络中约束最短路径优先算法研究  

Research on Constraint-Based Shortest Path First with SRLG Constraints in GMPLS Networks

作　　者：吴梦晓[1] 郭学理[1] 华宇[1] 

机构地区：[1]武汉大学计算机学院,湖北武汉430072

出　　处：《武汉大学学报（理学版）》2004年第1期65-68,共4页Journal of Wuhan University:Natural Science Edition

基　　金：湖北省自然科学基金资助项目(2001B057)

摘　　要：针对GMPLS网络中求解最短路径问题,提出了一种具有共享风险链路约束的启发式约束最短路径优先路由算法,对该算法的有效性和可靠性进行了比较全面的仿真测试,仿真结果显示此算法提高了网络资源的利用率,减少了网络的阻塞,同时降低了链路失效时的风险,提高了网络的强壮性和可靠性.GMPLS is the core technology in the next generation networks. The purpose of the paper is to present an algorithm to solve the problem of getting shortest paths in GMPLS networks. And the algorithm combined with heuristic character is the constraint-based shortest path first algorithm with SRLG constraints. Furthermore, the simulation is made in order to verify the performance and validity of the algorithm. At the same time, the results of the simulation are also deeply analyzed.

关 键 词：GMPLS网络 约束最短路径 共享风险链路组 通用多协议标记交换 优先算法 

分 类 号：TN915.04[电子电信—通信与信息系统] TP393.0[电子电信—信息与通信工程]