• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh (2003)

Cached

  • Download as a PDF

Download Links

  • [www.cs.ucsd.edu]
  • [nsl.epfl.ch]
  • [www.comp.nus.edu.sg]
  • [www.cs.cornell.edu]
  • [www.ics.uci.edu]
  • [www.cs.ubc.ca]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.duke.edu]
  • [www.ics.uci.edu]
  • [www.cs.ubc.ca]
  • [cseweb.ucsd.edu]
  • [people.cs.ubc.ca]
  • [www.cs.cornell.edu]
  • [www.cs.duke.edu]
  • [cseweb.ucsd.edu]
  • [www.comp.nus.edu.sg]
  • [people.kth.se]
  • [people.cs.ubc.ca]
  • [infoscience.epfl.ch]
  • [www.cs.arizona.edu]
  • [www.csl.mtu.edu]
  • [www.cs.rochester.edu]
  • [www.cs.huji.ac.il]
  • [cs.brown.edu]
  • [www.cs.uiuc.edu]
  • [www.cs.rochester.edu]
  • [strength.ucsd.edu]
  • [www.eecs.harvard.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Dejan Kostic , Adolfo Rodriguez , Jeannie Albrecht , Amin Vahdat
Citations:422 - 22 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Kostic03bullet:high,
    author = {Dejan Kostic and Adolfo Rodriguez and Jeannie Albrecht and Amin Vahdat},
    title = {Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh},
    year = {2003}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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 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.

Keyphrases

overlay mesh    high bandwidth data dissemination using    distributed algorithm    bandwidth improvement    strategic point    real-time multimedia streaming    complete implementation    expensive bandwidth probing    typical tree structure    effective alternative    large number    node spread    data object    multiple point    underlying network    performance target    efficient point    individual bullet receiver    key contribution    large-file transfer    disjoint manner    high bandwidth overlay mesh    single source    large-scale emulation environment    high-bandwidth data distribution    undue burden    ip multicast    efficient overlay tree    recent year    tree-based solution    overlay network    erent point    data item    decentralized algorithm   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University