Fast Content Distribution on Datacenter Networks

Authors:
Shakir James;Patrick Crowley
Affiliations:
-;-
Venue:
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
Year:
2011

Citing 3
Cited 0

Optimal scheduling of peer-to-peer file dissemination

Journal of Scheduling
A scalable, commodity data center network architecture

Proceedings of the ACM SIGCOMM 2008 conference on Data communication
VL2: a scalable and flexible data center network

Proceedings of the ACM SIGCOMM 2009 conference on Data communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

Peer-to-peer (P2P) applications distribute large files fast. That makes them popular on the Internet and has motivated their use on data center networks. On data center networks, however, these Internet applications waste bandwidth. To fully use available bandwidth, we propose the P2P copy (PCP) application. Results with a prototype show that PCP reduces content distribution times by an order of magnitude.