基于网络链路空闲率的QoS选播路由算法  

QoS Anycast Routing Algorithm Based on Link Idleness Probability of Networks

作　　者：王增勇[1] 林亚平[1] 王雷[1] 

机构地区：[1]湖南大学计算机与通信学院,长沙410082

出　　处：《计算机工程》2004年第21期87-88,91,共3页Computer Engineering

基　　金：湖南省自然科学基金资助项目(01JJY1007)

摘　　要：提出一种基于网络链路空闲率的QoS选播路由算法。该算法从负载平衡的思想出发,赋予每条链路一个与全局资源相关的权值即链路相对空闲率,寻找链路相对空闲率较高的选播路径。实验结果表明,该算法能有效平衡网络负载和服务器负载,提高源节点的请求接受率。This paper proposes a new QoS anycast routing algorithm based on the idleness probability of links in network, in which each link is given a weight related to the global resources by considering the load balance. The weight is the relative idleness probability of links, so an anycast route with the relatively bigger idleness probability can be found out. Experiment results show that the algorithm can balance the load of networks and servers, and can increase the accepting rate of request efficiently.

关 键 词：选播 QoS 负载平衡 最短路径算法 网络链路 空闲率 

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