On the Degree Distribution of Faulty Peer-to-Peer Overlay Networks

This paper presents an analytical approach to model fault-tolerance in P2P overlays, represented as complex networks. We define a distributed protocol for managing the overlay and reacting to node faults; peers try to maintain a desired degree andmake (accept) requests for creating links only if their actual degree is lower than their desired degree. Based on the protocol, evolution equations are defined and manipulated by resorting to generating functions. Obtained outcomes provide insights on the nodes’ degree probability distribution. We study different networks, characterized by three specific desired degree distributions, i.e. fixed desired degree, random graphs and power law. All these networks are assessed via the analytical tool and simulation as well. Results show that based on the provided mathematical model, it is possible to properly tune the average attachment rate at peers so as they are enabled to maintain their own desired degree.

[1]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[2]  Marco Tomassini,et al.  Impact of Scale-free Topologies on Gossiping in Ad Hoc Networks , 2007, Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007).

[3]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.

[4]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

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

[6]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[7]  Matthieu Latapy,et al.  Complex Network Measurements: Estimating the Relevance of Observed Properties , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[8]  Bo Li,et al.  CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Radu Dobrescu,et al.  Web traffic simulation with scale-free network models , 2007 .

[10]  Ming-Feng Yang,et al.  Fault Tolerance for Super-Peers of P2P Systems , 2007, 13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007).

[11]  Manish Parashar,et al.  A Study of Discovery Mechanisms for Peer-to-Peer Applications , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[12]  George H. L. Fletcher,et al.  Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance , 2004, AP2PC.

[13]  M. Newman.  Random Graphs as Models of Networks , 2002, cond-mat/0202208.

[14]  Stefano Ferretti.  On the degree distribution of opportunistic networks , 2010, MobiOpp '10.

[15]  Kang G. Shin,et al.  Internet routing resilience to failures: analysis and implications , 2007, CoNEXT '07.

[16]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[17]  Taoufik En-Najjary,et al.  Long Term Study of Peer Behavior in the kad DHT , 2009, IEEE/ACM Transactions on Networking.

[18]  S. Havlin,et al.  Structural properties of scale‐free networks , 2005 .

[19]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[20]  Lada A. Adamic,et al.  Local Search in Unstructured Networks , 2002, ArXiv.

[21]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[22]  Dmitri Loguinov,et al.  On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks , 2005, IEEE/ACM Transactions on Networking.

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

[24]  Hermann de Meer,et al.  Modeling of Self-Organizing Systems , 2008, Prax. Inf.verarb. Kommun..

[25]  Dick H. J. Epema,et al.  Optimizing Peer Relationships in a Super-Peer Network , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

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

[27]  Stratis Ioannidis,et al.  On the design of hybrid peer-to-peer systems , 2008, SIGMETRICS '08.

[28]  A. Jamakovic,et al.  On the relationship between the algebraic connectivity and graph's robustness to node and link failures , 2007, 2007 Next Generation Internet Networks.

[29]  Fabio Panzieri,et al.  Mobile games through the nets: a cross-layer architecture for seamless playing , 2010, SimuTools.

[30]  L. Amaral,et al.  The web of human sexual contacts , 2001, Nature.

[31]  Aleksandar Kuzmanovic,et al.  Denial-of-service resilience in peer-to-peer file sharing systems , 2005, SIGMETRICS '05.

[32]  Dmitri Loguinov,et al.  On zone-balancing of peer-to-peer networks: analysis of random node join , 2004, SIGMETRICS '04/Performance '04.

[33]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[34]  Dario Pompili,et al.  Multicast algorithms in service overlay networks , 2008, Comput. Commun..

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

[36]  George Varghese,et al.  Network monitoring using traffic dispersion graphs (tdgs) , 2007, IMC '07.

[37]  Gabriele D'Angelo,et al.  Simulation of scale-free networks , 2009, SIMUTools 2009.

[38]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[39]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[40]  Brian F. Cooper.  An Optimal Overlay Topology for Routing Peer-to-Peer Searches , 2005, Middleware.

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

[42]  Vittorio Ghini,et al.  A Web 2.0, Location-Based Architecture for a Seamless Discovery of Points of Interests , 2009, 2009 Fifth Advanced International Conference on Telecommunications.

[43]  Liam Kilmartin,et al.  Discriminating graphs through spectral projections , 2011, Comput. Networks.