Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Using Random Subsets to Build Scalable Network Services Dejan Kostic, Adolfo Rodriguez, Jeannie Albrecht, Abhijeet Bhirud, and Amin Vahdat
 

Summary: Using Random Subsets to Build Scalable Network Services
Dejan Kosti´c, Adolfo Rodriguez, Jeannie Albrecht, Abhijeet Bhirud, and Amin Vahdat

Department of Computer Science
Duke University¡
dkostic,razor,albrecht,abhi,vahdat¢ @cs.duke.edu
Abstract
In this paper, we argue that a broad range of large-scale
network services would benefit from a scalable mecha-
nism for delivering state about a random subset of global
participants. Key to this approach is ensuring that mem-
bership in the subset changes periodically and with uni-
form representation over all participants. Random sub-
sets could help overcome inherent scaling limitations to
services that maintain global state and perform global
network probing. It could further improve the routing
performance of peer-to-peer distributed hash tables by
locating topologically-close nodes. This paper presents
the design, implementation, and evaluation of RanSub, a
scalable protocol for delivering such state.

  

Source: Albrecht, Jeannie - Computer Science Department, Williams College
Vahdat, Amin - Department of Computer Science and Engineering, University of California at San Diego

 

Collections: Computer Technologies and Information Sciences