Change search
ReferencesLink to record
Permanent link

Direct link
High-bandwidth Data Dissemination for Large-scale Distributed Systems
EPFL.ORCID iD: 0000-0002-1256-1070
Show others and affiliations
2008 (English)In: ACM Transactions on Computer Systems, ISSN 0734-2071, Vol. 26, no 1Article in journal (Refereed) Published
Abstract [en]

This article focuses on the multireceiver data dissemination problem. Initially, IP multicast formed the basis for efficiently supporting such distribution. More recently, overlay networks have emerged to support point-to-multipoint communication. Both techniques focus on constructing trees rooted at the source to distribute content among all interested receivers. We argue, however, that trees have two fundamental limitations for data dissemination. First, since all data comes from a single parent, participants must often continuously probe in search of a parent with an acceptable level of bandwidth. Second, due to packet losses and failures, available bandwidth is monotonically decreasing down the tree.

To address these limitations, we present Bullet, a data dissemination mesh that takes advantage of the computational and storage capabilities of end hosts to create a distribution structure where a node receives data in parallel from multiple peers. For the mesh to deliver improved bandwidth and reliability, we need to solve several key problems: (i) disseminating disjoint data over the mesh, (ii) locating missing content, (iii) finding who to peer with (peering strategy), (iv) retrieving data at the right rate from all peers (flow control), and (v) recovering from failures and adapting to dynamically changing network conditions. Additionally, the system should be self-adjusting and should have few user-adjustable parameter settings. We describe our approach to addressing all of these problems in a working, deployed system across the Internet. Bullet outperforms state-of-the-art systems, including BitTorrent, by 25-70% and exhibits strong performance and reliability in a range of deployment settings. In addition, we find that, relative to tree-based solutions, Bullet reduces the need to perform expensive bandwidth probing.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2008. Vol. 26, no 1
National Category
Computer Science
URN: urn:nbn:se:kth:diva-147088DOI: 10.1145/1328671.1328674ISI: 000254081300003OAI: diva2:727643

QC 20140702

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

Open Access in DiVA

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

Other links

Publisher's full textArticle in ACM Digital Library

Search in DiVA

By author/editor
Kostic, Dejan
In the same journal
ACM Transactions on Computer Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 41 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

Altmetric score

Total: 33 hits
ReferencesLink to record
Permanent link

Direct link