An efficient algorithm for application-layering anycasting

Yu, Shui, Zhou, Wanlei, Huang, Fuchun and Lan, Mingjun 2002, An efficient algorithm for application-layering anycasting, in DCW 2002 : Distributed communities on the Web : 4th international workshop, DCW 2002, Sydney, Australia, April 3-5, 2002 : revised papers, Springer, Berlin, Germany, pp. 74-83, doi: 10.1007/3-540-36261-4_9.

Attached Files
Name Description MIMEType Size Downloads

Title An efficient algorithm for application-layering anycasting
Author(s) Yu, ShuiORCID iD for Yu, Shui
Zhou, WanleiORCID iD for Zhou, Wanlei
Huang, Fuchun
Lan, Mingjun
Conference name Distributed Communities on the Web. Workshop (2002 : Sydney, N.S.W.)
Conference location Sydney, New South Wales
Conference dates 3-5 Apr. 2002
Title of proceedings DCW 2002 : Distributed communities on the Web : 4th international workshop, DCW 2002, Sydney, Australia, April 3-5, 2002 : revised papers
Editor(s) Plaice, John
Publication date 2002
Series Lecture notes in computer science ; 2468.
Conference series Distributed Communities on the Web Workshop
Start page 74
End page 83
Publisher Springer
Place of publication Berlin, Germany
Summary Anycasting communication is proposed in IPv6, and it is designed to support server replication by allowing applications to select and communicate with the “best” server, according to some performance or policy criteria, among the replicated servers. Originally any-cast researchers focus on network layer. In this paper we pay more attention to application-layer anycasting, because at application layer we can obtain more flexibility and scalability. First of all, we describe the application-layer anycast model, and then summarize the previous work in application-layer anycasting, especially the periodical probing algorithms for updating the database of anycast resolver. After that, we present our algorithm, the requirement-based probing algorithm, an efficient and practical algorithm. In the end, we analyse the algorithms using the queuing theory and the statistics characteristics of Internet traffic. The results show that the requirement-base probing algorithm has better performance not only in the average waiting time for all anycast queries, but also in the average time used for an anycast query.

ISBN 3540003010
Language eng
DOI 10.1007/3-540-36261-4_9
Field of Research 080309 Software Engineering
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2002, Springer-Verlag
Persistent URL

Connect to link resolver
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 1 times in TR Web of Science
Scopus Citation Count Cited 6 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 918 Abstract Views, 0 File Downloads  -  Detailed Statistics
Created: Mon, 07 Jul 2008, 09:42:29 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact