一种链路不相交的多约束QoS路由算法  

A MULTI-CONSTRAINT QOS ROUTING ALGORITHM WITH LINK-DISJOINT PATHS

作　　者：王秀君[1] 王新华[1] 徐连诚[1] 

机构地区：[1]山东师范大学信息科学与工程学院,山东济南250014

出　　处：《计算机应用与软件》2008年第3期24-25,53,共3页Computer Applications and Software

基　　金：国家自然科学基金项目(60373063;90612003)

摘　　要：为提高网络路由可靠性,改善网络资源利用率,提出一种满足多个QoS约束的基于链路保护机制的路由算法。该算法首先通过图论的有关性质找到满足给定约束条件的节点对间的全部路径,并在此基础上利用邻接矩阵的方法得到其最短链路不相交相似路径,最后赋以算例分析。结果证明,该算法在减小网路传输时延方面有一定的优势,对于高实时性网络应用有更好的优化作用。In order to enhance the reliability of the routing and improve the utilization of resources in the network, a multi-constraint QoS routing algorithm based on protection mechanism is presented . This algorithm first obtains all the routing paths which satisfy the bandwidth and the latency guarantee between source and destination nodes through the related nature of graph theory. TWO shortest link-disjoint similar paths are achieved by the way of matrix. An instance is presented to analyze the algorithm and the result shows that this algorithm has the advantage in delay reducing in the network so that the real-time network application could be better optimized.

关 键 词：多约束QOS路由 保护机制 链路不相交 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术] O158[自动化与计算机技术—计算机科学与技术]