Measuring robustness of superpeer topologies

In this paper, we propose an analytical framework based on percolation theory to assess the robustness of superpeer topologies 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.

[1]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[2]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Andreas Deutsch,et al.  Nonequilibrium clustering of self-propelled rods. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[5]  Rüdiger Schollmeier,et al.  Signaling and networking in unstructured peer-to-peer networks , 2005 .

[6]  Krishna P. Gummadi,et al.  Measuring and analyzing the characteristics of Napster and Gnutella hosts , 2003, Multimedia Systems.

[7]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[8]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[9]  Alberto Montresor.  A robust protocol for building superpeer overlay topologies , 2004 .

[10]  R K P Zia,et al.  Nature of the condensate in mass transport models. , 2005, Physical review letters.

[12]  Daniel Stutzbach,et al.  Characterizing unstructured overlay topologies in modern P2P file-sharing systems , 2005 .

[13]  S. Havlin,et al.  Optimization of network robustness to waves of targeted and random attacks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[15]  Alberto Montresor,et al.  A robust protocol for building superpeer overlay topologies , 2004, Proceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings..

[16]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[17]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002 .

[18]  Niloy Ganguly,et al.  Developing Efficient Search Algorithms for P2P Networks Using Proliferation and Mutation , 2004, ICARIS.

[19]  M. Newman,et al.  On the uniform generation of random graphs with prescribed degree sequences , 2003, cond-mat/0312028.

[20]  S. Shen-Orr,et al.  Networks Network Motifs : Simple Building Blocks of Complex , 2002 .

[21]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.