UM
Distributed server selection with imprecise state for replicated server group
Chang H.2; Jia W.2; Zhang L.2
2004-08-16
Source PublicationProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Pages73-78
AbstractServer replication is an approach often used to improve service access efficiency and availability for a large number of clients. This paper adopts a simple service model and investigates a set of efficient algorithms for server selection in an anycast group under the condition of imprecise network delay. The algorithms use ticket-based probing approach to search the path with short delay and probe the server load at the same time and try to optimize the server and path delay at the same time. The simulation results demonstrate that our algorithms are efficient in terms of server response time for sever selection compared with several other server selection algorithms.
URLView the original
Language英語
Fulltext Access
Document TypeConference paper
CollectionUniversity of Macau
Affiliation1.City University of Hong Kong
2.South China University of Technology
Recommended Citation
GB/T 7714
Chang H.,Jia W.,Zhang L.. Distributed server selection with imprecise state for replicated server group[C],2004:73-78.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Chang H.]'s Articles
[Jia W.]'s Articles
[Zhang L.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Chang H.]'s Articles
[Jia W.]'s Articles
[Zhang L.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chang H.]'s Articles
[Jia W.]'s Articles
[Zhang L.]'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.