SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:kth-147088"
 

Search: onr:"swepub:oai:DiVA.org:kth-147088" > High-bandwidth Data...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist
  • Kostic, DejanEPFL (author)

High-bandwidth Data Dissemination for Large-scale Distributed Systems

  • Article/chapterEnglish2008

Publisher, publication year, extent ...

  • 2008-03-10
  • Association for Computing Machinery (ACM),2008
  • electronicrdacarrier

Numbers

  • LIBRIS-ID:oai:DiVA.org:kth-147088
  • https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-147088URI
  • https://doi.org/10.1145/1328671.1328674DOI

Supplementary language notes

  • Language:English
  • Summary in:English

Part of subdatabase

Classification

  • Subject category:ref swepub-contenttype
  • Subject category:art swepub-publicationtype

Notes

  • QC 20140702
  • 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.

Subject headings and genre

Added entries (persons, corporate bodies, meetings, titles ...)

  • Snoeren, Alex C. (author)
  • Vahdat, Amin (author)
  • Braud, Ryan (author)
  • Killian, Charles (author)
  • Anderson, James W. (author)
  • Albrecht, Jeannie (author)
  • Rodriguez, Adolfo (author)
  • Vandekieft, Erik (author)
  • EPFL (creator_code:org_t)

Related titles

  • In:ACM Transactions on Computer Systems: Association for Computing Machinery (ACM)26:10734-20711557-7333

Internet link

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view