loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)
Distributed Server Selection with Imprecise State for Replicated Server Group
Hong Kong, SAR, China
May 10-May 12
ISBN: 0-7695-2135-5
ASCII Text
x 
 
Heng Chang, Weijia Jia, Ling Zhang, "Distributed Server Selection with Imprecise State for Replicated Server Group," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 73, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2004.1300460,
author = {Heng Chang and Weijia Jia and Ling Zhang},
title = {Distributed Server Selection with Imprecise State for Replicated Server Group},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2004},
issn = {1087-4089},
pages = {73},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300460},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Distributed Server Selection with Imprecise State for Replicated Server Group
SN - 1087-4089
SP
EP
A1 - Heng Chang,
A1 - Weijia Jia,
A1 - Ling Zhang,
PY - 2004
KW - null
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Heng Chang, South China University of Technology, Guangzhou, P.R.China
Weijia Jia, City University of Hong Kong, Kowloon
Ling Zhang, South China University of Technology, Guangzhou, P.R.China
Server 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.
Citation:
Heng Chang, Weijia Jia, Ling Zhang, "Distributed Server Selection with Imprecise State for Replicated Server Group," ispan, pp.73, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.