Research on the Robustness of Peer-to-Peer Overlay

Article Preview

Abstract:

Many complex networks display a surprising degree of tolerance against error comes at a high price in that these networks are extremely vulnerable to attacks (that is , to the removal of a few nodes that play a vital role in the networks). Complex peer-to-peer overlay networks display a surprising degree of robustness: although some components regularly malfunction, local failures rarely lead to the loss of the information carrying ability of the network. The stability of these and other complex systems is often attributed to the redundant wiring of the functional web defined by the systems components. In this paper a model of peer-to-peer overlay is presented based on the actual topology. According to the model it is found that such error tolerance and attack vulnerability are generic properties of peer-to-peer overlay.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

2884-2887

Citation:

Online since:

September 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Jeong, H., Tombor, B., Albert, R., Oltvai, Z. & Barabasi, A. -L., The large-scale organization of metabolic networks, Nature, vol. 407, 2000, p.651–654, doi: 10. 1038/35036627.

DOI: 10.1038/35036627

Google Scholar

[2] Faloutsos, M., On power-law relationships of the Internet topology, Proc. conference on Applications, technologies, architectures, and protocols for computer communication, Oct. 1999, pp.251-262, doi: 10. 1145/316188. 316229.

DOI: 10.1145/316188.316229

Google Scholar

[3] Albert, R, Error and attack tolerance of complex networks, Nature (London), vol. 406, Jul. 2000, p.378–382, doi: 10. 1038/35019019.

Google Scholar

[4] Crucitti, P., Model for cascading failures in complex networks, Physical review. E, Statistical, nonlinear, and soft matter physics, vol. 64, Apr. 2004, p.0451041—0451044, doi: 10. 1103/physreve. 69. 045104.

Google Scholar

[5] Banavar, J., Size and form in efficient transportation networks, Nature (London), vol. 399, May. 1999, p.130—132, doi: 10. 1038/20144.

Google Scholar

[6] Vito Latora and Massimo Marchiori, Vulnerability and protection of infrastructure networks, Physical review. E, vol. 71, 2005, p.015103.

Google Scholar

[7] Reuven Cohen, Keren Erez, Daniel ben Avraham, and Shlomo Havlin., Breakdown of the internet under intentional attack, Phys. Rev. Lett., vol. 86, Apr. 2001, p.3682, doi: 10. 1103/physrevlett. 86. 3682.

DOI: 10.1103/physrevlett.86.3682

Google Scholar

[8] Duncan S. Callaway, M. E. J. Newman, Steven H. Strogatz, and Duncan J. Watts., Network robustness and fragility: Percolation on random graphs, Phys. Rev. Lett., vol. 85, Oct. 2000, p.5648.

DOI: 10.1103/physrevlett.85.5468

Google Scholar

[9] M. E. J. Newman and M. Girvan., Finding and evaluating community structure in networks, Physical review. E, vol. 69, Aug. 2004, p.026113, doi: 10. 1103/physreve. 69. 026113.

Google Scholar

[10] T. Tanizawa, G. Paul, R. Cohen, S. Havlin, and H. E. Stanley, Optimization of network robustness to waves of targeted and random attacks, Physical review. E, vol. 71, 2005, p.047101.

DOI: 10.1103/physreve.71.047101

Google Scholar

[11] Kurant, M., Error and attack tolerance of layered complex networks, Physical review. E, Statistical, nonlinear, and soft matter physics, vol. 76, (2007).

Google Scholar

[12] Zegura, E., A quantitative comparison of graph-based models for Internet topology, IEEE/ACM transactions on networking, vol. 5, 1997, p.770—775, doi: 10. 1109/90. 650138.

DOI: 10.1109/90.650138

Google Scholar

[13] Adamic, LA; Abiteboul, S; Vercoustre, AM., The small World Web, Proc. In Research and Advanced Technology for Digital Libraries, vol. 1696, Sep. 1999, pp.443-452, doi: 10. 1007/3-540-48155-9_27.

Google Scholar