Analyzing the vulnerability of superpeer networks against attack

In this paper, we develop an analytical framework to measure the vulnerability of superpeer networks against attack. Two different kinds of attacks namely deterministic and degree dependent attack have been introduced here. We formally model the superpeer networks with the help of bimodal structure and different attacks with the help of graph dynamics. Our analysis shows that fraction of superpeers and their connectivity have profound impact upon the stability of the network. The results obtained from the theoretical analysis are validated through simulation. The agreement between the simulation results and theoretical predictions is almost perfect.

[1]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 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]  R K P Zia,et al.  Nature of the condensate in mass transport models. , 2005, Physical review letters.

[5]  Douglas S. Reeves,et al.  Constructing a balanced, (log(N)/1oglog(N))-diameter super-peer topology for scalable P2P systems , 2004 .

[6]  Roger Wattenhofer,et al.  Attacks on Peer-to-Peer Networks , 2005 .

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

[8]  Hector Garcia-Molina,et al.  Designing a super-peer network , 2003, Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405).

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

[10]  S. Shen-Orr,et al.  Network motifs: simple building blocks of complex networks. , 2002, Science.

[11]  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.

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

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