ACM Home Page
Please provide us with feedback. Feedback
Bullet: high bandwidth data dissemination using an overlay mesh
Full text PdfPdf (416 KB)
Source ACM Symposium on Operating Systems Principles archive
Proceedings of the nineteenth ACM symposium on Operating systems principles table of contents
Bolton Landing, NY, USA
SESSION: Overlay & peer-to-peer networks table of contents
Pages: 282 - 297  
Year of Publication: 2003
ISBN:1-58113-757-5
Also published in ...
Authors
Dejan Kostić  Duke University
Adolfo Rodriguez  Duke University
Jeannie Albrecht  Duke University
Amin Vahdat  Duke University
Sponsors
SIGOPS: ACM Special Interest Group on Operating Systems
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 142,   Citation Count: 72
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/945445.945473
What is a DOI?

ABSTRACT

In recent years, overlay networks have become an effective alternative to IP multicast for efficient point to multipoint communication across the Internet. Typically, nodes self-organize with the goal of forming an efficient overlay tree, one that meets performance targets without placing undue burden on the underlying network. In this paper, we target high-bandwidth data distribution from a single source to a large number of receivers. Applications include large-file transfers and real-time multimedia streaming. For these applications, we argue that an overlay mesh, rather than a tree, can deliver fundamentally higher bandwidth and reliability relative to typical tree structures. This paper presents Bullet, a scalable and distributed algorithm that enables nodes spread across the Internet to self-organize into a high bandwidth overlay mesh. We construct Bullet around the insight that data should be distributed in a disjoint manner to strategic points in the network. Individual Bullet receivers are then responsible for locating and retrieving the data from multiple points in parallel.Key contributions of this work include: i) an algorithm that sends data to different points in the overlay such that any data object is equally likely to appear at any node, ii) a scalable and decentralized algorithm that allows nodes to locate and recover missing data items, and iii) a complete implementation and evaluation of Bullet running across the Internet and in a large-scale emulation environment reveals up to a factor two bandwidth improvements under a variety of circumstances. In addition, we find that, relative to tree-based solutions, Bullet reduces the need to perform expensive bandwidth probing. In a tree, it is critical that a node's parent delivers a high rate of application data to each child. In Bullet however, nodes simultaneously receive data from multiple sources in parallel, making it less important to locate any single source capable of sustaining a high transmission rate.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
 
3
Bittorrent. http://bitconjurer.org/BitTorrent.
4
 
5
6
7
 
8
Ken Calvert, Matt Doar, and Ellen~W. Zegura. Modeling Internet Topology. IEEE Communications Magazine, June 1997.
9
10
 
11
Ludmila Cherkasova and Jangwon Lee. FastReplica: Efficient Large File Distribution within Content Delivery Networks. In 4th USENIX Symposium on Internet Technologies and Systems, March 2003.
 
12
Reuven Cohen and Gideon Kaempfer. A Unicast-based Approach for Streaming Multicast. In INFOCOM, pages 440--448, 2001.
13
 
14
15
 
16
 
17
Vivek K Goyal. Multiple Description Coding: Compression Meets the Network. IEEE Signal Processing Mag., pages 74--93, May 2001.
18
19
20
 
21
John Jannotti, David K. Gifford, Kirk L. Johnson, M. Frans Kaashoek, and Jr. James W. O'Toole. Overcast: Reliable Multicasting with an Overlay Network. In Proceedings of Operating Systems Design and Implementation (OSDI), October 2000.
 
22
Kazaa media desktop. http://www.kazaa.com.
 
23
Min Sik Kim, Simon S. Lam, and Dong-Young Lee. Optimal Distribution Tree for Internet Streaming Media. Technical Report TR-02-48, Department of Computer Sciences, University of Texas at Austin, September 2002.
 
24
Dejan Kostić, Adolfo Rodriguez, Jeannie Albrecht, Abhijeet Bhirud, and Amin Vahdat. Using Random Subsets to Build Scalable Network Services. In Proceedings of the USENIX Symposium on Internet Technologies and Systems, March 2003.
 
25
26
27
 
28
Venkata N. Padmanabhan, Lili Qiu, and Helen J. Wang. Server-based Inference of Internet Link Lossiness. In Proceedings of the IEEE Infocom, San Francisco, CA, USA, 2003.
 
29
30
 
31
Larry Peterson, Tom Anderson, David Culler, and Timothy Roscoe. A Blueprint for Introducing Disruptive Technology into the Internet. In Proceedings of ACM HotNets-I, October 2002.
 
32
R. C. Prim. Shortest Connection Networks and Some Generalizations. In Bell Systems Technical Journal, pages 1389--1401, November 1957.
 
33
Adolfo Rodriguez, Sooraj Bhat, Charles Killian, Dejan Kostić, and Amin Vahdat. MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks. Technical Report CS-2003-09, Duke University, July 2003.
 
34
 
35
Stefan Savage. Sting: A TCP-based Network Measurement Tool. In Proceedings of the 2nd USENIX Symposium on Internet Technologies and Systems (USITS-99), pages 71--80, Berkeley, CA, October 11--14 1999. USENIX Association.
36
37

CITED BY  74

Collaborative Colleagues:
Dejan Kostić: colleagues
Adolfo Rodriguez: colleagues
Jeannie Albrecht: colleagues
Amin Vahdat: colleagues