Anycast Routing Algorithms on the Internet

Authors:
Chao Peng;YiNi Zhou
Affiliations:
-;-
Venue:
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Year:
2001

Citing 3
Cited 0

Routing Algorithms for Anycast Messages

ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
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
Multi-Path Routing combined with Resource Reservation

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution

Quantified Score

Hi-index	0.00

Visualization

Abstract

The anycasting communication paradigm is designed to support server replication by allowing applications to easily select and communicate with the "best" sever, according to some performance or policy criteria, in a group of content-equivalent servers. An anycast packet isone that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. There are lots of work has been done on routing anycast packets. In this paper, we propose and analyze a routing protocol foranycast message. It is composed of three sub-protocols: the routing table establishment sub-protocol, the route maintenance sub-protocol and the packet forwarding sub-protocol. The specific description and analysis are given in this paper, data shows that our protocol isefficient and fault-tolerant.