A Study on r-Configurations---A Resource Assignment Problem on Graphs
SIAM Journal on Discrete Mathematics
Approximating the Domatic Number
SIAM Journal on Computing
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
An analysis of live streaming workloads on the internet
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Maximizing the Lifetime of Dominating Sets
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13
Should internet service providers fear peer-assisted content distribution?
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Modeling and Caching of Peer-to-Peer Traffic
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
A Measurement Study of a Large-Scale P2P IPTV System
IEEE Transactions on Multimedia
Characterizing Peer-to-Peer Streaming Flows
IEEE Journal on Selected Areas in Communications
The disparity between P2P overlays and ISP underlays: issues, existing solutions, and challenges
IEEE Network: The Magazine of Global Internetworking
Optimal network locality in distributed virtualized data-centers
Computer Communications
A non-dominated sorting bit matrix genetic algorithm for p2p relay optimization
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
A novel data replication mechanism in P2P VoD system
Future Generation Computer Systems
| Hi-index | 0.00 |
Peer-to-peer content distribution has become a major source of bandwidth costs for Internet service providers (ISPs). One way for ISPs to decrease these costs is to deploy caches for p2p traffic. To make efficient use of the caches, in this paper we propose a cooperative caching and relaying scheme that is compatible with the existing business relations between ISPs. We formulate the problem of cooperative caches as a resource allocation problem, and show that it is related to the problem of r-configuration studied in graph theory. We propose a distributed algorithm to solve the resource allocation problem, and show that cooperation leads to significant gains compared to non-cooperative caching.