-
47浏览
-
0点赞
-
0收藏
-
0分享
-
171下载
-
0评论
-
引用
期刊论文
Multi-Constrained Anycast Routing Based on Ant Algorithm
,-0001,():
With the development of the Internet, network service requirements exceed the capabilities of the network, which causes a great influence to the application of Quality of Service (QoS). As the scale of new generation of the Internet becoming larger, it is difficult to know the global information of the network. How to solve the anycast routing with QoS guaranty on the condition of just being aware of the local information has been a hot researching point in recent years. Most of the current anycast algorithms are not distributed and not suitable for the super large-scale distributed network. A novel approach using distributed Multiple Ant Colonies algorithm with positive interaction is presented in this paper, in which ants adjust individual behavior via cooperation to make colony behavior intelligent and only need local information to find optimal routing. The theoretical analysis and simulation results show that the innovative ant algorithm is a desirable routing algorithm for the anycast routing problem with multiple QoS constraints, which offers significant performance gains across a wide range of operational scenarios.
【免责声明】以下全部内容由[林亚平]上传于[2007年03月15日 11时03分20秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果