Informed Content Delivery Across Adaptive Overlay Networks
- 18 October 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 12 (5) , 767-780
- https://doi.org/10.1109/tnet.2004.836103
Abstract
Overlay networks have emerged as a powerful and highly flexible method for delivering content. We study how to optimize throughput of large transfers across richly connected, adaptive overlay networks, focusing on the potential of collaborative transfers between peers to supplement ongoing downloads. First, we make the case for an erasure-resilient encoding of the content. Using the digital fountain encoding approach, end hosts can efficiently reconstruct the original content of size n from a subset of any n symbols drawn from a large universe of encoding symbols. Such an approach affords reliability and a substantial degree of application-level flexibility, as it seamlessly accommodates connection migration and parallel transfers while providing resilience to packet loss. However, since the sets of encoding symbols acquired by peers during downloads may overlap substantially, care must be taken to enable them to collaborate effectively. Our main contribution is a collection of useful algorithmic tools for efficient summarization and approximate reconciliation of sets of symbols between pairs of collaborating peers, all of which keep message complexity and computation to a minimum. Through simulations and experiments on a prototype implementation, we demonstrate the performance benefits of our informed content-delivery mechanisms and how they complement existing overlay network architectures.Keywords
This publication has 22 references indexed in Scilit:
- Scalable on-demand media streaming with packet loss recoveryIEEE/ACM Transactions on Networking, 2003
- A digital fountain approach to asynchronous reliable multicastIEEE Journal on Selected Areas in Communications, 2002
- A case for end system multicastIEEE Journal on Selected Areas in Communications, 2002
- Compressed Bloom filtersIEEE/ACM Transactions on Networking, 2002
- Informed content delivery across adaptive overlay networksACM SIGCOMM Computer Communication Review, 2002
- Efficient erasure correcting codesIEEE Transactions on Information Theory, 2001
- The end-to-end effects of Internet path selectionACM SIGCOMM Computer Communication Review, 1999
- A note on the probabilistic analysis of patricia treesRandom Structures & Algorithms, 1992
- How many random questions are necessary to identify n distinct objects?Journal of Combinatorial Theory, Series A, 1990
- Random sampling with a reservoirACM Transactions on Mathematical Software, 1985