Developing analytical framework to measure robustness of peer-to-peer networks

Authors:
Bivas Mitra;Md. Moin Afaque;Sujoy Ghose;Niloy Ganguly
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India;Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India
Venue:
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Year:
2006

Citing 3
Cited 0

A critical point for random graphs with a given degree sequence

Random Graphs 93 Proceedings of the sixth international seminar on Random graphs and probabilistic methods in combinatorics and computer science
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In peer-to-peer (p2p) networks, peer nodes communicate with each other with the help of overlay structure. As the peers in the p2p system join and leave the network randomly, it makes the overlay network dynamic and unstable in nature. In this paper, we propose an analytical framework to assess the robustness of different topologies adopted by these overlay structures, to withstand the random movement of peers in the networks. We model the dynamic behavior of the peers through degree independent as well as degree dependent node failure. Recently superpeer networks are becoming the most widely used topology among the p2p networks [8]. Therefore we perform the stability analysis of superpeer networks as a case study. We validate the analytically derived results with the help of simulation.