RBLCP:一种覆盖网络的QoS路由改进算法  

RBLCP:improved QoS-aware routing algorithm for overlay networks

作　　者：应必娣[1] 陈惠芳[1] 朱孙斌[1] 仇佩亮[1] 

机构地区：[1]浙江大学信息科学与工程学院,浙江杭州310027

出　　处：《浙江大学学报（工学版）》2007年第4期646-649,共4页Journal of Zhejiang University：Engineering Science

基　　金：浙江省自然科学基金资助项目(Y105407)

摘　　要：针对传统IPQoS路由算法不能满足覆盖网络的服务需求的问题,提出了一种通用覆盖网络下的QoS路由算法——资源均衡最小代价路径(RBLCP)算法.该算法从覆盖链路带宽和覆盖服务节点处理能力受限的角度出发,寻找一条既满足QoS要求又保证网络资源均衡的路由.对该算法的QoS满意率、覆盖链路带宽的均衡性以及节点处理能力的均衡性进行了性能仿真.结果表明,与改进的最短路径算法和成比例的带宽最小路径算法相比,RBLCP算法具有更好的QoS满意率,在对网络资源尤其是稀缺资源的均衡方面也有良好的性能.Because traditional IPQoS routing schemes cannot meet the requirements of the overlay network, a new QoS routing algorithm named resource-balanced least cost path （RBLCP） for the generic overlay network was proposed. This algorithm can not only find a QoS-satisfied overlay path, but also try to balance the overlay traffic among the nodes and the overlay links in the network with constrained resource components. Performances of the algorithm, such as the QoS success ratio, the balance of the overlay link bandwidth and the balance of the node computing capability, were simulated. The results showed that the QoS success ratio of RBLCP algorithm is better than those of the modified shortest-distance path algorithm and the proportional bandwidth shortest path algorithm. Moreover, the RBLCP algorithm can also balance resource well, especially for the resource that is constrained in the network.

关 键 词：覆盖网络 QOS路由 RBLCP算法 资源均衡 

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