一种端到端网络的不相交多路径QoS路由算法  

A Disjoint Multipath QoS Routing Algorithm in an End to End Network

作　　者：朱尚明[1] 庄新华[2] 高大启[1] 

机构地区：[1]华东理工大学计算机科学与工程系,上海200237 [2]美国密苏里大学计算机科学系,美国mo65211

出　　处：《计算机科学》2007年第9期35-38,共4页Computer Science

基　　金：国家自然科学基金(No.60373073);美国NIH基金(DHHS 1 R01 DC04340-01A2);美国NSF基金(ElA9911095)

摘　　要：不相交多路径路由算法旨在一个端到端的网络中为应用流选择多个路径,且这些路径在瓶颈链路上是彼此不相交的。本文提出的不相交多路径QoS路由(DMQR)算法在Dijkstra最短路径和最短最宽路径(SWP)算法的基础上,能够动态地计算时延最短、带宽最宽、在瓶颈链路上互不相交的路径,且保证每个路径都是满足一定服务质量的。在视频会议、远程医疗和远程教育等重要的视频通信场合,要求应用层和网络层必须协同工作以保证一些必要的QoS,例如端到端的带宽、时延和包丢失率等。本文针对端到端的网络,重点讨论不相交多路径QoS路由算法在应用层的设计和实现。性能分析和模拟结果显示,所提出的不相交多路径QoS路由算法总是收敛的,且当网络流量增加时,该算法具有较低的包丢失率和较高的吞吐量。Disjoint multipath routing algorithm is aimed at selecting multiple paths for a flow in an end-to-end network, which are mutually disjoint w. r. t. bottleneck links. In this paper, the proposed Disjoint Multipath QoS Routing （DMQR） algorithm is based on both Dijkstra Shortest Path and Shortest Widest Path （SWP） algorithm, and can dynamically find paths mutually disjoint w. r. t. bottleneck links. Each path is the shortest among the widest ones and its QoS is guaranteed. In many important multimedia applications such as video over IP in teleconference, telemedicine and teleeducation, the application- and network-layer must collaborate in order to provide some necessary QoS guarantee, such as end-to-end bandwidth, delay and packet loss rate, etc. In this paper, we mainly focus on a scenario of one source and one destination and design the Disjoint Multipath QoS Routing algorithm to achieve certain QoS level at the application-layer. Simulation results and performance analysis demonstrate that the algorithm converges, offers lower end-to-end packet loss rate and higher throughput as network traffic grows.

关 键 词：不相交路径 多路径路由 带宽 时延 

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