Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: ACM International Conference on Supercomputing, New York, USA (2002)
Ganguly, N., Deutsch, A.: Developing Efficient Search Algorithms for P2P Networks Using Proliferation and Mutation. In: Proceedings of the International Conference on Artificial Immune Systems,Catania, Italy (September13-16, 2004)
KaZaA website, http://www.kazaa.com
Pyun, Y.J., Reeves, D.S.: Constructing a Balanced, log(N)-Diameter Super-peer Topology. In: Proceedings of the 4th International Conference on Peer-to-Peer Computing, Zurich, Switzerland (August 2004)
Yang, B., Garcua-Molina, H.: Designing a Super-Peer Networks. In: Proceedings of the International Conference on Data Engineering (ICDE), Los Alamitos, CA ( March 2003)
Stutzbach, D., Rejaie, R., Sen, S.: Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems. In: Proceedings of ACM SIGCOMM/USENIX Internet Measurement Conference, Berkeley, CA (October 2005)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts. Multimedia Systems Journal 8(5) (2002)
Montresor, A.: A Robust Protocol for Building Superpeer Overlay Topologies. In: Proceedings of the 4th International Conference on Peer-to-Peer Computing, Zurich, Switzerland (August 2004)
Schollmeier, R.: Signaling And Networkin. In Unstructured Peer-To-Peer Networks, Ph.D. Thesis, Technical University, Munchen, pp. 75–86 (2005)
Cohen, R., Erez, K., Avraham, D., Havlin, S.: Resilience of the Internet to Random Breakdown. Physical Review Letters 85(21) (2000)
Cohen, R., Erez, K., Avraham, D., Havlin, S.: Resilience of the Internet under Intentional Attack. Physical Review Letters 86(16) (2001)
Albert, R., Jhong, H., Barabsi, A.L.: Error and Attack Tolerance of Complex Networks. Nature 406 (2000)
Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Random Graphs with Arbitrary Degree Distributions and Their Application. Physical Review E (2001)
Callaway, D.S., Newman, M.E.J., Strogatz, S.H., Watts, D.J.: Network Robustness and Fragility: Percolation on Random graphs. Physical Review Letters 85(21) (2000)
Molloy, M., Reed, B.: The Size of the Giant Component of a Random Graph with a Given Degree Sequence. Combinatorics, Probability and Computing 7, 295–298 (1998)
Erdos, P., Renyi, A.: On the Evolution of Random Graphs. Publ. Math. Inst. Hangar Acad. Sci. 5, 17–61 (1960)
Majumdar, S.N., Evans, M.R., Zia, R.K.P.: Nature of the Condensate in Mass Transport Models. Physical Review Letters 94, 180601 (2005)
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network Motifs: Simple Building Blocks Of Complex Networks. Science 298, 824–827 (2002)
Milo, R., Kashtan, N., Itzkovitz, S., Newman, M.E.J., Alon, U.: On the Uniform Generation of Random Graphs with Prescribed Degree Sequences. eprint arXiv:cond-mat/0312028 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mitra, B., Ghose, S., Ganguly, N. (2007). Effect of Dynamicity on Peer to Peer Networks. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds) High Performance Computing – HiPC 2007. HiPC 2007. Lecture Notes in Computer Science, vol 4873. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77220-0_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-77220-0_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77219-4
Online ISBN: 978-3-540-77220-0
eBook Packages: Computer ScienceComputer Science (R0)