Anycast routing algorithms on the Internet

Chao Peng; Yi Ni Zhou

doi:10.1109/ICCNMC.2001.962620

Anycast routing algorithms on the Internet

Chao Peng, Yi Ni Zhou

Fudan University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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 is one that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. A lot of work has been done on routing anycast packets. We propose and analyze a routing protocol for anycast messages. 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 the paper data show that our protocol is efficient and fault-tolerant.

Original language	English
Title of host publication	Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	362-367
Number of pages	6
ISBN (Electronic)	0769513816, 9780769513812
DOIs	https://doi.org/10.1109/ICCNMC.2001.962620
State	Published - 2001
Externally published	Yes
Event	International Conference on Computer Networks and Mobile Computing, ICCNMC 2001 - Beijing, China Duration: 16 Oct 2001 → 19 Oct 2001

Publication series

Name	Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001

Conference

Conference	International Conference on Computer Networks and Mobile Computing, ICCNMC 2001
Country/Territory	China
City	Beijing
Period	16/10/01 → 19/10/01

Access to Document

10.1109/ICCNMC.2001.962620

Cite this

Peng, C., & Zhou, Y. N. (2001). Anycast routing algorithms on the Internet. In Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001 (pp. 362-367). Article 962620 (Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCNMC.2001.962620

@inproceedings{977df3d4d22d4293b7e48bba4c764632,

title = "Anycast routing algorithms on the Internet",

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 is one that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. A lot of work has been done on routing anycast packets. We propose and analyze a routing protocol for anycast messages. 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 the paper data show that our protocol is efficient and fault-tolerant.",

author = "Chao Peng and Zhou, \{Yi Ni\}",

note = "Publisher Copyright: {\textcopyright} 2001 IEEE.; International Conference on Computer Networks and Mobile Computing, ICCNMC 2001 ; Conference date: 16-10-2001 Through 19-10-2001",

year = "2001",

doi = "10.1109/ICCNMC.2001.962620",

language = "英语",

series = "Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "362--367",

booktitle = "Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001",

address = "美国",

}

Peng, C & Zhou, YN 2001, Anycast routing algorithms on the Internet. in Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001., 962620, Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001, Institute of Electrical and Electronics Engineers Inc., pp. 362-367, International Conference on Computer Networks and Mobile Computing, ICCNMC 2001, Beijing, China, 16/10/01. https://doi.org/10.1109/ICCNMC.2001.962620

Anycast routing algorithms on the Internet. / Peng, Chao; Zhou, Yi Ni.
Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001. Institute of Electrical and Electronics Engineers Inc., 2001. p. 362-367 962620 (Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Anycast routing algorithms on the Internet

AU - Peng, Chao

AU - Zhou, Yi Ni

PY - 2001

Y1 - 2001

N2 - 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 is one that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. A lot of work has been done on routing anycast packets. We propose and analyze a routing protocol for anycast messages. 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 the paper data show that our protocol is efficient and fault-tolerant.

AB - 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 is one that should be delivered to one member in a group of designated recipients. Using anycast services may considerably simplify some applications. A lot of work has been done on routing anycast packets. We propose and analyze a routing protocol for anycast messages. 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 the paper data show that our protocol is efficient and fault-tolerant.

UR - https://www.scopus.com/pages/publications/0009537687

U2 - 10.1109/ICCNMC.2001.962620

DO - 10.1109/ICCNMC.2001.962620

M3 - 会议稿件

AN - SCOPUS:0009537687

T3 - Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001

SP - 362

EP - 367

BT - Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - International Conference on Computer Networks and Mobile Computing, ICCNMC 2001

Y2 - 16 October 2001 through 19 October 2001

ER -

Peng C, Zhou YN. Anycast routing algorithms on the Internet. In Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001. Institute of Electrical and Electronics Engineers Inc. 2001. p. 362-367. 962620. (Proceedings - 2001 International Conference on Computer Networks and Mobile Computing, ICCNMC 2001). doi: 10.1109/ICCNMC.2001.962620

Anycast routing algorithms on the Internet

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this