In recent years, overlay networks have become an e#ective alternative to IP multicast for e#cient point to multipoint communication across the Internet. Typically, nodes self-organize with the goal of forming an e#cient 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 di#erent 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...
|
906
|
Reliable multicast framework for lightweight sessions and application level framing
– Floyd, Jacobson, et al.
- 1995
|
|
873
|
Modeling TCP throughput: A simple model and its empirical validation
– Padhye, Firoiu, et al.
- 1988
|
|
863
|
Space/Time Trade-offs in Hash Coding with Allowable Errors
– Bloom
- 1970
|
|
824
|
A case for end system multicast
– Chu, Rao, et al.
- 2002
|
|
564
|
Equation-based congestion control for unicast applications
– Floyd, Handle, et al.
- 2000
|
|
428
|
Scalable application layer multicast
– Banerjee, Bhattacharjee, et al.
|
|
384
|
A blueprint for introducing disruptive technology into the internet
– Peterson, Anderson, et al.
- 2002
|
|
341
|
Modeling internet topology
– CALVERT, DOAR, et al.
- 1997
|
|
327
|
Shortest connection networks and some generalizations
– Prim
- 1957
|
|
230
|
Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture
– Chu, Rao, et al.
- 2001
|
|
215
|
SCRIBE: The design of a large-scale event notification infrastructure
– Rowstron, Kermarrec, et al.
|
|
190
|
On the resemblance and containment of documents
– Broder
- 1997
|
|
160
|
Informed content delivery across adaptive overlay networks
– Byes, Considine, et al.
- 2002
|
|
158
|
Practical Loss-resilient Codes
– Luby, Mitzenmacher, et al.
- 1997
|
|
156
|
Multiple description coding: Compression meets the network
– Goyal
- 2001
|
|
144
|
Scalability and Accuracy in a Large-Scale Network Emulator
– Vahdat, Yocum, et al.
- 2002
|
|
142
|
LT Codes
– Luby
- 2002
|
|
103
|
Towards Capturing Representative AS-Level Internet Topologies
– Chang, Govindan, et al.
- 2002
|
|
97
|
Resilient peer-to-peer streaming
– Padmanabhan, Wang, et al.
- 2003
|
|
83
|
Sting: a TCP-based Network Measurement Tool
– Savage
- 1999
|
|
68
|
M: Mitzenmacher and A. Rege, “A Digital Fountain Approach to Reliable Distribution of Bulk Data
– Byers, Luby
- 1998
|
|
58
|
Mesh-based content routing using XML
– Snoeren, Conley, et al.
- 2001
|
|
50
|
MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks
– Rodriguez, Killian, et al.
- 2004
|
|
48
|
Server-based inference of Internet link lossiness
– Padmanabhan, Qiu, et al.
- 2003
|
|
39
|
Constantinos Dovrolis, “End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput
– Jain
- 2002
|
|
34
|
Spacetime trade-o s in hash coding with allowable errors
– Bloom
- 1970
|
|
31
|
Overcast: Reliable Multicasting with an Overlay Network
– O’Toole
- 2000
|
|
30
|
Anne-Marie Kermarrec, Animesh Nandi, Antony Rowstron, and Atul Singh. Splitstream: High-bandwidth Content Distribution in Cooperative Environments
– Castro, Druschel
- 2003
|
|
27
|
Fastreplica: Efficient large file distribution within content delivery networks
– Cherkasova, Lee
- 2003
|
|
21
|
Oznur Ozkasap
– Birman, Hayden
- 1999
|
|
18
|
A unicast-based approach for streaming multicast
– Cohen, Kaempfer
- 2001
|
|
18
|
Optimal distribution tree for Internet streaming media
– KIM, LAM, et al.
- 2002
|
|
12
|
Chou Kunwadee Sripanidkulchai “Distributing Streaming Media Content Using Cooperative Networking” Microsoft technical report MSR-TR-202-37
– Padmanabhan, Wang, et al.
- 2002
|
|
7
|
Abhijeet Bhirud, and Amin Vahdat. Using Random Subsets to Build Scalable Network Services
– Kostić, Rodriguez, et al.
- 2003
|
|
6
|
Sidath Handurukande, Rachid Guerraoui, Anne-Marie Kermarrec, and Petr Kouznetsov. Lightweight probabilistic broadcast
– Eugster
- 2001
|
|
4
|
Modeling TCP Throughput: ASimple Model and its Empirical Validation
– Padhye, Firoiu, et al.
- 1998
|
|
3
|
Dejan Kostić, and Amin Vahdat. MACEDON: Methodology for Automatically Creating, Evaluating, and Designing Overlay Networks
– Rodriguez, Killian, et al.
- 2004
|
|
1
|
Sting: ATCP-based Network Measurement Tool
– Savage
- 1999
|
|
1
|
FastReplica: E#cient Large File Distribution within Content Delivery Networks
– Cherkasova, Lee
- 2003
|
|
