An Adaptable Anycast Routing Algorithm based on Density and Prozimity

摘要：

Most existing anycast routing algorithms are based on shortest path algorithm. In this paper, an adaptable anycast routing algorithm based on density and proximity is proposed. While determining anycast member, both the proximity factor and nearby anycast members number of the target (density factor) should be considered. Density is calculated on the base of field theory. In comparison with proximity-based algorithm, density-based algorithm is strong in routing robustness, but weak in routing efficiency, so the best performance lies in a tradeoff between proximity and density. In this algorithm, parameter k adjusts the weight of proximity factor and density factor hence influences anycast member selection, therefore the algorithm is characteristic of adaptable. Simulation experiments performed in networks of different dynamic degrees show that by adjusting parameter k, routing robustness and routing efficiency can be well balanced.

关键词： anycast routing algorith density prozimity

作者: Xin Xu Yun-li Gu Jie Du Huan-yan Qian

作者单位: Institute of Computer & Software Nanjing University of Information Science and Technology Nanjing 21 Institute of Computer & Software Nanjing University of Information Science and Technology Nanjing 21 School of Computer Science & Technology Nanjing University of Science & Technology Nanjing 210094, C

会议类型: 国际会议

会议名称: 2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)

会议地点: 太原

会议语种:英文

页码: 725-728

在线出版日期: 2009-07-10（万方平台首次上网日期，不代表论文的发表时间）