Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
Combinatorics, Probability and Computing
A Robust Protocol for Building Superpeer Overlay Topologies
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Constructing a Balanced, (log(N)/loglog(N))-Diameter Super-Peer Topology for Scalable P2P Systems
P2P '04 Proceedings of the Fourth International Conference on Peer-to-Peer Computing
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Hi-index | 0.00 |
In this paper, we propose an analytical framework based on percolation theory to assess the robustness of peer to peer networks in face of user churns and/or attacks targeted towards important nodes. It is observed in practice that in spite of churn of peers, superpeer networks show exceptional robustness and do not disintegrate into disconnected components. With the help of the analytical framework developed, we formally measure its stability against user churn and validate the general observation. The effect of intentional attacks upon the superpeer networks is also investigated. Our analysis shows that fraction of superpeers in the network and their connectivity have profound impact upon the stability of the network. The results obtained from the theoretical analysis are validated through simulation. The simulation results and theoretical predictions match with high degree of precision.