By Topic

Distributed server selection with imprecise state for replicated server group

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
$33 $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)
Heng Chang ; Inf. Network Eng. & Res. Center, South China Univ. of Technol., Guangzhou, China ; Weijia Jia ; Ling Zhang

Server replication is an approach often used to improve service access efficiency and availability for a large number of clients. This paper adopts a simple service model and investigates a set of efficient algorithms for server selection in an anycast group under the condition of imprecise network delay. The algorithms use ticket-based probing approach to search the path with short delay and probe the server load at the same time and try to optimize the server and path delay at the same time. The simulation results demonstrate that our algorithms are efficient in terms of server response time for sever selection compared with several other server selection algorithms.

Published in:

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

Date of Conference:

10-12 May 2004