An efficient reliable architecture for application layer anycast service

Authors:
Shui Yu;Wanlei Zhou
Affiliations:
School of Information Techonolgy, Deakin University, Burwood, Victoria, Australia;School of Information Techonolgy, Deakin University, Burwood, Victoria, Australia
Venue:
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Year:
2005

Citing 9
Cited 0

Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
Fault-tolerant servers for the RHODOS system

Journal of Systems and Software
End-to-end internet packet dynamics

IEEE/ACM Transactions on Networking (TON)
A Routing Protocol for Anycast Messages

IEEE Transactions on Parallel and Distributed Systems
On the nonstationarity of Internet traffic

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An Efficient Algorithm for Application-Layer Anycasting

DCW '02 Revised Papers from the 4th International Workshop on Distributed Communities on the Web
On the Quality of Service of Failure Detectors

DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Application-Layer Anycasting

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Measurements of Wide Area Internet TraffiC

Measurements of Wide Area Internet TraffiC

Quantified Score

Hi-index	0.00

Visualization

Abstract

Anycast is a new service in IPv6, and there are some open issues about the anycast service. In this paper, we focus on efficient and reliable aspects of application layer anycast. We apply the requirement based probing routing algorithm to replace the previous period based probing routingalgorithm for anycast resolvers. We employ the twin server model among the anycast servers, therefore, try to present a reliable service in the Internet environment. Our theoretical analysis shows that the proposed architecture works well, and it offers a more efficient routing performance and fault tolerance capability.