Using Random Subsets to Build Scalable Network Services

Using Random Subsets to Build Scalable Network Services (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dejan Kostic , Adolfo Rodriguez , Jeannie Albrecht , Abhijeet Bhirud , Amin Vahdat

Citations:

53 - 11 self

BibTeX

@MISC{Kostic03usingrandom,
    author = {Dejan Kostic and Adolfo Rodriguez and Jeannie Albrecht and Abhijeet Bhirud and Amin Vahdat},
    title = {Using Random Subsets to Build Scalable Network Services},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participants. Key to this approach is ensuring that membership in the subset changes periodically and with uniform representation over all participants. Random subsets 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.

Citations

2353	A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001
1503	Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems - Rowstron, Druschel - 2001
968	A Case for End System Multicast - Chu, Rao, et al. - 2000
928	Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001
854	Resilient overlay networks - Andersen, Balakrishnan, et al. - 2001
778	Wide-area cooperative storage with cfs - DABEK, KAASHOEK, et al.
593	Epidemic algorithms for replicated database maintenance - Demers, Greene, et al. - 1988
512	Scalable application layer multicast - Banerjee, Bhattacharjee, et al. - 2002
463	T.: A blueprint for introducing disruptive technology into the Internet - Peterson, Anderson, et al. - 2003
363	Bayeux: An architecture for scalable and faulttolerant wide-area data dissemination - Zhuang, Zhao, et al. - 2001
352	Managing update conflicts in Bayou, a weakly connected replicated storage system - Terry, Theimer, et al. - 1995
296	Application-level multicast using contentaddressable networks - RATNASAMY, HANDLEY, et al.
276	ALMI: An Application level Multicast Infrastructure - Pendarakis, Shi, et al. - 2001
268	Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture - Chu, Rao, et al. - 2001
254	SCRIBE: The design of a large-scale event notification infrastructure - Rowstron, Kermarrec, et al. - 2001
210	Yoid: Extending the Internet Multicast Architecture. http://www.icir.org/yoid - Francis
201	Scalability and accuracy in a large-scale network emulator - VAHDAT, YOCUM, et al.
199	Lightweight probabilistic broadcast - Eugster, Handurukande, et al. - 2001
179	Informed contentdelivery across adaptive overlay networks - Byers, Considine, et al.
131	Host multicast: A framework for delivering multicast to end users - Zhang, Jamin, et al. - 2002
128	Towards capturing representative AS-level Internet topologies - Chang, Govindan, et al.
102	Rmx: Reliable multicast for heterogeneous networks - Chawathe, McCanne, et al. - 2000
92	Tracebased Mobile Network Emulation - Noble, Satyanarayanan, et al. - 1997
83	SCAMP: Peer-to-peer lightweight membership service for large scale group communication - Ganesh, Kermarrec, et al. - 2001
37	Interpreting stale load information - DAHLIN - 2000
33	Overcast: Reliable Multicasting with an Overlay Network - O’Toole - 2000
32	End-host multicast communication using switch-tree protocols - Helder, Jamin - 2002
26	Oznur Ozkasap - Birman, Hayden - 1999
18	Chord: A scalable peer to peer lookup service for internet applications - STOICA, MORRIS, et al. - 2001