Change search
ReferencesLink to record
Permanent link

Direct link
Using Random Subsets to Build Scalable Network Services
Duke.ORCID iD: 0000-0002-1256-1070
Show others and affiliations
2003 (English)In: Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems (USITS), USENIX - The Advanced Computing Systems Association, 2003, 19- p.Conference paper (Refereed)
Abstract [en]

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. As a first demonstration of the RanSub utility, we construct SARO, a scalable and adaptive application-layer overlay tree. SARO uses RanSub state information tolocate appropriate peers for meeting application-specific delay and bandwidth targets and to dynamically adapt to changing network conditions. A large-scale evaluation of 1000 overlay nodes participating in an emulated 20,000- node wide-area network topology demonstrate both the adaptivity and scalability (in terms of per-node state and network overhead) of both RanSub and SARO. Finally, we use an existing streaming media server to distribute content through SARO running on top of the PlanetLab Internet testbed.

Place, publisher, year, edition, pages
USENIX - The Advanced Computing Systems Association, 2003. 19- p.
National Category
Computer Science
URN: urn:nbn:se:kth:diva-147146OAI: diva2:727735
The 4th USENIX Symposium on Internet Technologies and Systems (USITS),

QC 20140704

Available from: 2014-06-23 Created: 2014-06-23 Last updated: 2014-07-04Bibliographically approved

Open Access in DiVA

fulltext(208 kB)59 downloads
File information
File name FULLTEXT01.pdfFile size 208 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links

ACM Digital Library

Search in DiVA

By author/editor
Kostic, Dejan
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 59 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 21 hits
ReferencesLink to record
Permanent link

Direct link