Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Binding Clients to Replicated Servers: Initial and Continuous Binding Hyewon Jun, Matt Sanders, Mostafa H. Ammar, and Ellen W. Zegura
 

Summary: Binding Clients to Replicated Servers: Initial and Continuous Binding
Hyewon Jun, Matt Sanders, Mostafa H. Ammar, and Ellen W. Zegura
College of Computing
Georgia Institute of Technology
Atlanta, GA 30332­0280
fhyewon,msanders,ammar,ewzg@cc.gatech.edu
Abstract
Much effort has been dedicated to the development of
application­layer and network­layer mechanisms for select­
ing the ``best'' server among a set of replicated servers. In
this work, we highlight a different problem that arises in the
replicated server context; namely, when to to invoke and use
a server selection mechanism. We use the term ``binding''
to refer to the function that queries a server selection mech­
anism and makes decisions about how to use the results.
We consider two extreme cases of binding frequency, Initial
Binding at the start of a connection, and Continuous Bind­
ing for each packet. We propose and evaluate a Continuous
Binding scheme, and then compare these two extremes to
one another. Our results indicate that a single client can

  

Source: Ammar, Mostafa - College of Computing, Georgia Institute of Technology

 

Collections: Computer Technologies and Information Sciences