Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The Harvest information discovery and access system
Computer Networks and ISDN Systems
On the scale and performance of cooperative Web proxy caching
Proceedings of the seventeenth ACM symposium on Operating systems principles
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A survey of web caching schemes for the Internet
ACM SIGCOMM Computer Communication Review
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Observations on the Dynamic Evolution of Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Peer-to-Peer Caching Schemes to Address Flash Crowds
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
A hierarchical internet object cache
ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference
IEEE Transactions on Dependable and Secure Computing
Can ISPS and P2P users cooperate for improved performance?
ACM SIGCOMM Computer Communication Review
Reliable on-demand management operations for large-scale distributed applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Designing less-structured P2P systems for the expected high churn
IEEE/ACM Transactions on Networking (TON)
HAPS: supporting effective and efficient full-text P2P search with peer dynamics
Journal of Computer Science and Technology
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
A case for design methodology research in self-* distributed systems
Self-star Properties in Complex Information Systems
Hi-index | 0.01 |
Denial of service attacks on peer-to-peer (p2p) systems can arise from sources otherwise considered non-malicious. We focus on one such commonly prevalent source, called "churn". Churn arises from continued and rapid arrival and failure (or departure) of a large number of participants in the system, and traces from deployments have shown that it can lead to extremely stressful networking conditions. It has the potential to increase host loads and block a large fraction of normal insert and lookup operations in the peer-to-peer system. This paper studies a cooperative web caching system that is resistant to churn attacks. Based on the Kelips peer-to-peer routing substrate, it imposes a constant load on participants and is able to reorganize itself continuously under churn. Peer pointers are automatically established among more available participants, thus ensuring high cache hit rates even when the system is stressed under churn. In addition, the system improves on the network locality of cache accesses in previous web caching schemes. The paper presents experimental results from a real implementation running over a commodity PC cluster, as well as trace-based simulations that use real host availability traces obtained from another deployed p2p system.