Analyzing the vulnerability of superpeer networks against attack

Authors:
Bivas Mitra;Fernando Peruani;Sujoy Ghose;Niloy Ganguly
Affiliations:
Indian Institute of Technology: Kharagpur, Kharagpur, West Bengal, India;Technical University of Dresden, Dresden, Germany;Indian Institute of Technology: Kharagpur, Kharagpur, West Bengal, India;Indian Institute of Technology: Kharagpur, Kharagpur, West Bengal, India
Venue:
Proceedings of the 14th ACM conference on Computer and communications security
Year:
2007

Citing 2
Cited 3

The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Combinatorics, Probability and 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

How do superpeer networks emerge?

INFOCOM'10 Proceedings of the 29th conference on Information communications
Formal understanding of the emergence of superpeer networks: a complex network approach

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
An adversarial evaluation of network signaling and control mechanisms

ICISC'10 Proceedings of the 13th international conference on Information security and cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.