By Topic

Selection algorithms for anycast relay routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jianping Zheng ; Inst. of Software, Chinese Acad. of Sci., Beijing, China ; Keqin Li ; Zhimei Wu

Anycast has been applied widely in service discovery and replicated service. Current researches on anycast routing mainly focus on the scenario that the anycast server is the final destination in a communication session. In this paper, we explore another scenario where anycast is applied for relay routing, and addresses the problem of selecting among the anycast relay routers. After analyzing the characteristics of anycast relay routing distinguished from general anycast routing, we present three selection algorithms for anycast relay routing, namely nearest to source, nearest to destination and random selection. Based on the results of probability analysis and simulation, we compare the performance of each algorithm, analyze how the placement and the number of relay routers impact the performance of selection algorithms, and further discuss how to apply these selection algorithms and how many relay routers should be deployed.

Published in:

Performance, Computing, and Communications, 2004 IEEE International Conference on

Date of Conference:

2004