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

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Network Coding for Large Scale Content Distribution

Cached

  • Download as a PDF

Download Links

  • [research.microsoft.com]
  • [www.larryblakeley.com]
  • [www.research.microsoft.com]
  • [cs.baylor.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [nslab.ee.ntu.edu.tw]
  • [cs.ecs.baylor.edu]
  • [www.cs.utexas.edu]
  • [www.cs.utexas.edu]
  • [nslab.ee.ntu.edu.tw]
  • [cs.ecs.baylor.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Christos Gkantsidis , Pablo Rodriguez Rodriguez
Citations:492 - 7 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Gkantsidis_networkcoding,
    author = {Christos Gkantsidis and Pablo Rodriguez Rodriguez},
    title = { Network Coding for Large Scale Content Distribution},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of block propagation, and, thus, makes the distribution more efficient. This is particularly important in large unstructured overlay networks, where the nodes need to make decisions based on local information only. We compare network coding to other schemes that transmit unencoded information (i.e. blocks of the original file) and, also, to schemes in which only the source is allowed to generate and transmit encoded packets. We study the performance of network coding in heterogeneous networks with dynamic node arrival and departure patterns, clustered topologies, and when incentive mechanisms to discourage free-riding are in place. We demonstrate through simulations of scenarios of practical interest that the expected file download time improves by more than 20-30 % with network coding compared to coding at the server only and, by more than 2-3 times compared to sending unencoded information. Moreover, we show that network coding improves the robustness of the system and is able to smoothly handle extreme situations where the server and nodes departure the system.

Keyphrases

network coding    large scale content distribution    unencoded information    content distribution    handle extreme situation    departure pattern    file download time    new scheme    heterogeneous network    local information    large unstructured overlay network    encoded packet    encoded block    distribution network    practical interest    original file    incentive mechanism    large file    block propagation    coding process    clustered topology    dynamic node arrival   

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