Brief announcement: the overlay network content distribution problem

Authors:
Chip Killian;Michael Vrable;Alex C. Snoeren;Amin Vahdat;Joseph Pasquale
Affiliations:
University of California, San Diego;University of California, San Diego;University of California, San Diego;University of California, San Diego;University of California, San Diego
Venue:
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Year:
2005

Citing 0
Cited 3

Formal Model and Scheduling Heuristics for the Replica Migration Problem

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Using Multicast Transfers in the Replica Migration Problem: Formulation and Scheduling Heuristics

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Quantifying the benefits of joint content and network routing

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many overlay multicast protocols have been designed and deployed across the Internet to support content distribution. To our knowledge, however, none have provided a rigorous analysis of the problem or the effectiveness of their proposed solutions. We define the Overlay Network Content Distribution (OCD) problem to allow such analyses.