摘要
MRP算法作为 Anycast路由算法,可以减少部分不精确信息的影响。但是作为确定性算法的MRP算法在均衡网络负载方面不如随机性算法。本文改进了MRP算法,增大了相同请求选择不同路径的概率,在不需要增加路由器的计算时间和存储空间的情况下,理论上能够提高 QoS满足率、降低网络负载不均的情况和减少不精确信息的影响。本文对几种Anycast路由算法进行了模拟。模拟结果基本上证实了理论分析。
MRP algorithm, as an Anycast routing algorithm, can reduce the impact of some inaccurate iaformation. But, as a confirmability algorithm, it does not work well as random algorithm in network load balancing. In this pa- per, MRP algorithm is improved,the probability for selecting different path in the same request is increased,the QoS satisfaction rate can be enhanced theoretically, the network load asymmetry and inaccurate information impact can be reduced at a certain extent. This paper simulates several kinds of Anycast routing algorithm and on the whole, the result approves theoretical analysis.
出处
《计算机科学》
CSCD
北大核心
2005年第7期44-46,共3页
Computer Science
基金
广州市科技局2002年重点科研项目(022G2160)
