An efficient anycast routing protocol based on multi-metrics
Zhang L.2; Jia W.1; Yan W.2; Li X.-M.2
Source PublicationProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
AbstractAnycast communication becomes popular recently as it can be used to provide effective routing to server members in a replicated server group that is represented by an anycast address. This paper proposes a novel anycast routing protocol called Anycast Routing protocol based on Multi-Metrics (ARMM). ARMM protocol sets up the routing by taking hop number, data transmission delay, residual bandwidth, and server load as the server and path selection criteria. ARMM differs from other approaches as it uses values of bandwidth and delay on the direction from servers (anycast members) to clients, rather than the normal direction from clients to servers. So ARMM can select the best server/path with sufficient network resource (say bandwidth etc) for server data transmission to clients. Simulation results demonstrated that our protocol performs better than those protocols using conventional client to server routing approach in case that the servers may require to transmit a large volume of flows to the clients.
URLView the original
Fulltext Access
Document TypeConference paper
CollectionUniversity of Macau
Affiliation1.City University of Hong Kong
2.Peking University
Recommended Citation
GB/T 7714
Zhang L.,Jia W.,Yan W.,et al. An efficient anycast routing protocol based on multi-metrics[C],2004:24-29.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhang L.]'s Articles
[Jia W.]'s Articles
[Yan W.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang L.]'s Articles
[Jia W.]'s Articles
[Yan W.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang L.]'s Articles
[Jia W.]'s Articles
[Yan W.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.