Informed content delivery across adaptive overlay networks

@article{Byers2004InformedCD,
  title={Informed content delivery across adaptive overlay networks},
  author={John W. Byers and Jeffrey Considine and Michael Mitzenmacher and Stanislav Rost},
  journal={IEEE/ACM Trans. Netw.},
  year={2004},
  volume={12},
  pages={767-780}
}
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 <i>n</i… 
Content distribution in overlay multicast
TLDR
The approximation bound of the solution regarding the optimal throughput is proved, and it is shown that this bound is greatly outperformed when experimenting under various node dynamics and network topologies.
Network coding for large scale content distribution
TLDR
It is demonstrated 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, byMore than 2-3 times compared to sending unencoded information.
Path Diversity Based Techniques for Resilient Overlay Multimedia Multicast
TLDR
The results show that the proposed techniques are effective in dealing with packet losses in the network, improving FEC goodput by 20-35% and MDC connectivity by 15-20%.
Resilient peer-to-peer streaming
TLDR
A simple tree management algorithm is presented that provides the necessary path diversity and an adaptation framework for MDC based on scalable receiver feedback is described, which shows very significant benefits in using multiple distribution trees and MDC, with a 22 dB improvement in PSNR in some cases.
Characterizing overlay multicast networks and their costs
TLDR
It is shown that the mean number of hops and mean per-hop delay between parent and child hosts in overlay trees generally decrease as the level of the host in the overlay tree increases, and this phenomenon yields overlay tree cost savings.
Characterizing Overlay Multicast Networks and Their Costs
TLDR
It is shown that the mean number of hops and mean per-hop delay between parent and child hosts in overlay trees generally decrease as the level of the host in the overlay tree increases, and this phenomenon yields overlay tree cost savings.
rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes
  • Chuan Wu, Baochun Li
  • Computer Science
    IEEE Transactions on Parallel and Distributed Systems
  • 2008
TLDR
This paper proposes to use a recent coding technique, referred to as rateless codes, to code the multimedia bitstreams before they are transmitted over peer-to-peer links, which eliminates the requirements of content reconciliation, as well as the risks of delivering redundant content over the network.
Overlay Networks with Linear Capacity Constraints
  • Yingnan Zhu, Baochun Li
  • Computer Science, Business
    IEEE Transactions on Parallel and Distributed Systems
  • 2008
TLDR
This work introduces a model of overlays that incorporates correlated link capacities and linear capacity constraints (LCC) to formulate hidden shared bottlenecks and shows that LCC-overlay is perfectly accurate and, hence, enjoys much higher efficiency than the inaccurate independent overlay.
Synergy: An overlay internetworking architecture and implementation
TLDR
Synergy, a utility-based overlay internetworking architecture that fosters overlay cooperation, is designed and results from Internet experiments with cooperative forwarding overlays indicate that the Synergy prototype improves delay, throughput, and loss performance, while maintaining the autonomy and heterogeneity of individual overlay networks.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 48 REFERENCES
Informed content delivery across adaptive overlay networks
TLDR
This work makes the case for an erasure-resilient encoding of the content, and demonstrates the performance benefits of informed content-delivery mechanisms and how they complement existing overlay network architectures.
Bullet: high bandwidth data dissemination using an overlay mesh
TLDR
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, and finds that, relative to tree-based solutions, Bullet reduces the need to perform expensive bandwidth probing.
Overcast: reliable multicasting with on overlay network
TLDR
Simulations indicate that Overcast quickly builds bandwidth-efficient distribution trees that, compared to IP Multicast, provide 70%-100% of the total bandwidth possible, at a cost of somewhat less than twice the network load.
Resilient overlay networks
TLDR
It is found that forwarding packets via at most one intermediate RON node is sufficient to overcome faults and improve performance in most cases, demonstrating the benefits of moving some of the control over routing into the hands of end-systems.
SplitStream: high-bandwidth multicast in cooperative environments
TLDR
The design and implementation of SplitStream are presented and experimental results show that SplitStream distributes the forwarding load among all peers and can accommodate peers with different bandwidth capacities while imposing low overhead for forest construction and maintenance.
A case for end system multicast
TLDR
The potential benefits of transferring multicast functionality from end systems to routers significantly outweigh the performance penalty incurred and the results indicate that the performance penalties are low both from the application and the network perspectives.
Scalable on-demand media streaming with packet loss recovery
TLDR
The new protocols, Reliable Periodic Broadcast and Reliable Bandwidth Skimming, are simple to implement and achieve nearly the best possible scalability and efficiency for a given set of client characteristics and desirable/feasible media quality.
A digital fountain approach to asynchronous reliable multicast
TLDR
This work develops a protocol that closely approximates a digital fountain using two new classes of erasure codes that for large block sizes are orders of magnitude faster than standard erasures codes.
The end-to-end effects of Internet path selection
TLDR
A measurement-based study comparing the performance seen using the "default" path taken in the Internet with the potential performance available using some alternate path, finding that in 30-80% of the cases, there is an alternate path with significantly superior quality.
Rateless Codes and Big Downloads
TLDR
When nodes leave the network in the middle of uploads, the algorithm minimizes the duplicate information shared by nodes with truncated downloads, so any two peers with partial knowledge of a given file can almost always fully benefit from each other's knowledge.
...
1
2
3
4
5
...