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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

A Digital Fountain Approach to Reliable Distribution of Bulk Data (1998)

Cached

  • Download as a PDF

Download Links

  • [www.cs.berkeley.edu]
  • [www.cs.ucsb.edu]
  • [www.cs.ucsb.edu]
  • [www-cse.ucsd.edu]
  • [ramp.ucsd.edu]
  • [cseweb.ucsd.edu]
  • [www.stanford.edu]
  • [www.cs.rutgers.edu]
  • [www.ecse.rpi.edu]
  • [www.ecse.rpi.edu]
  • [ftp.digital.com]
  • [www.eecs.harvard.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.wisc.edu]
  • [www.cs.bu.edu]
  • [ftp.icsi.berkeley.edu]
  • [www.research.digital.com]
  • [ftp.icsi.berkeley.edu]
  • [www.icsi.berkeley.edu]
  • [gatekeeper.research.compaq.com]
  • [apotheca.hpl.hp.com]
  • [www.eecs.harvard.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.bu.edu]
  • [www.cc.gatech.edu]
  • [www.cc.gatech.edu]
  • [www.hpl.hp.com]
  • [bitsavers.trailing-edge.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Michael Luby, et al.
Citations:490 - 18 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Luby98adigital,
    author = {Michael Luby and et al.},
    title = {A Digital Fountain Approach to Reliable Distribution of Bulk Data},
    year = {1998}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous clients to acquire bulk data with optimal efficiency at times of their choosing. Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. We develop a protocol that closely approximates a digital fountain using a new class of erasure codes that are orders of magnitude faster than standard erasure codes. We provide performance measurements that demonstrate the feasibility of our approach and discuss the design, implementation and performance of an experimental system.

Keyphrases

bulk data    digital fountain approach    reliable distribution    digital fountain    broadcast protocol    heterogeneous client    high loss rate    erasure code    experimental system    new class    standard erasure code    performance measurement    new multicast    reliable delivery    autonomous client    large number    optimal efficiency    feedback channel    distribute bulk data    scalable protocol   

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