Criticality-based analysis and design of unstructured peer-to-peer networks as "Complex systems"

Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are either inaccurate, because of oversimplification, or analytically inapplicable, due to their high complexity. By recognizing unstructured peer-to-peer networks as "complex systems ", we employ statistical models used before to characterize complex systems for formal analysis and efficient design of peer-to-peer networks. We provide two examples of application of this modeling approach that demonstrate its power. For instance, using this approach we have been able to formalize the main problem with normal flooding search, propose a remedial approach with our probabilistic flooding technique, and find the optimal operating point for probabilistic flooding rigorously, such that it improves scalability of the normal flooding by 99%.

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

[2]  Walter Willinger,et al.  Scaling phenomena in the Internet: Critically examining criticality , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[3]  Baruch Awerbuch,et al.  Concurrent Online Tracking of Mobile Users , 1991, SIGCOMM.

[4]  Franz J. Hauck,et al.  A Model for Worldwide Tracking of Distributed Objects , 1996 .

[5]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[6]  F. Kashani,et al.  Decentralized Resource Management for a Distributed Continuous Media Server , 2002, IEEE Trans. Parallel Distributed Syst..

[7]  Bhaskar Krishnamachari,et al.  Distributed Constraint Satisfaction in a Wireless Sensor Tracking System , 2001 .

[8]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[9]  Makoto Yokoo,et al.  The Phase Transition in Distributed Constraint Satisfaction Problems: Fist Results , 2000, CP.

[10]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[11]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[12]  Amnon Aharony,et al.  Diffusion on Percolation Clusters , 1987 .

[13]  Victor R. Lesser,et al.  Problem structure and subproblem sharing in multi-agent systems , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[14]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[15]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[16]  Hector Garcia-Molina,et al.  Efficient search in peer to peer networks , 2004 .

[17]  M. Newman,et al.  Exact solution of site and bond percolation on small-world networks. , 2000, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[18]  S. Havlin,et al.  Diffusion in disordered media , 2002 .

[19]  Hector Garcia-Molina,et al.  Routing indices for peer-to-peer systems , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[20]  Bruce M. Maggs,et al.  Globally Distributed Content Delivery , 2002, IEEE Internet Comput..

[21]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[22]  Toru Ohira,et al.  PHASE TRANSITION IN A COMPUTER NETWORK TRAFFIC MODEL , 1998 .

[23]  John Doyle,et al.  Complexity and robustness , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[25]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[26]  Mihajlo A. Jovanović,et al.  Modeling Large-scale Peer-to-Peer Networks and a Case Study of Gnutella , 2001 .

[27]  Christian Bessiere,et al.  Backtracking in Distributed Constraint Networks , 1998 .

[28]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[29]  E. M.,et al.  Statistical Mechanics , 2021, Manual for Theoretical Chemistry.

[30]  Scott Shenker,et al.  Can Heterogeneity Make Gnutella Scalable? , 2002, IPTPS.

[31]  Béla Bollobás,et al.  Random Graphs , 1985 .

[32]  H. Wilf.  generatingfunctionology: Third Edition , 1990 .

[33]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[34]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[35]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[36]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[37]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

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

[39]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

[40]  Š. Barta,et al.  Anomalous diffusion on percolating clusters , 1994 .

[41]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[42]  Harris,et al.  Diffusion on percolating clusters. , 1987, Physical review. B, Condensed matter.

[43]  Andy Oram,et al.  Peer-to-Peer: Harnessing the Power of Disruptive Technologies , 2001 .

[44]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.