Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A Lightweight, Robust P2P System to Handle Flash Crowds
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Peer-to-Peer Caching Schemes to Address Flash Crowds
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
BuddyWeb: A P2P-Based Collaborative Web Caching System
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
The Case for Cooperative Networking
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Updates in Highly Unreliable, Replicated Peer-to-Peer Systems
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The dark side of the Web: an open proxy's view
ACM SIGCOMM Computer Communication Review
A churn-resistant peer-to-peer web caching system
Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
Democratizing content publication with coral
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Optimal proactive caching in peer-to-peer network: analysis and application
Proceedings of the sixteenth ACM conference on Conference on information and knowledge management
Flower-CDN: a hybrid P2P overlay for efficient query processing in CDN
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A Highly Robust P2P-CDN under Large-Scale and Dynamic Participation
AP2PS '09 Proceedings of the 2009 First International Conference on Advances in P2P Systems
P2Prec: a social-based P2P recommendation system
Proceedings of the 20th ACM international conference on Information and knowledge management
Characterizing roles of front-end servers in end-to-end performance of dynamic content distribution
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
Hi-index | 0.00 |
Content distribution networks (CDN) are fundamental, yet expensive technologies for distributing the content of web-servers to large audiences. The P2P model is a perfect match to build a low-cost and scalable CDN infrastructure for popular websites by exploiting the underutilized resources of their user communities. However, building a P2P-based CDN is not a straightforward endeavor. In contrast to traditional CDNs, peers are autonomous and volunteer participants with their own heterogeneous interests that should be taken into account in the design of the P2P system. Moreover, churn rate is much higher than in dedicated CDN infrastructures, which can easily destabilize the system and severely degrade the performance. Finally and foremostly, while many P2P systems abstract any topological information about the underlying network, a top priority of a CDN is to incorporate locality-awareness in query routing in order to locate close-by content. This paper aims at building a P2P CDN with high performance, scalability and robustness. Our proposed protocols combine DHT efficiency with gossip robustness and take into account the interests and localities of peers. In short, Flower-CDN provides a hybrid and locality-aware routing infrastructure for user queries. PetalUp-CDN is a highly scalable version of Flower-CDN that dynamically adapts to variable rates of participation and prevent overload situations. In addition, we ensure the robustness of our P2P CDN via low-cost maintenance protocols that can detect and recover from churn and dynamicity. Our extensive performance evaluation shows that our protocols yield high performance gains under both static and highly dynamic environments. Furthermore, they incur acceptable and tunable overhead. Finally we provide main guidelines to deploy Flower-CDN for the public use.