Performance evaluation of advanced routing algorithms for unstructured peer-to-peer networks

Peer-to-peer systems have recently emerged to address the problem of enabling the virtualization of distributed resources such as processing, network bandwidth and storage capacity, to create a single system image, granting users and applications seamless access to vast IT capabilities. Participants in peer-to-peer networks are not only potential consumers but also potential resource providers, and operate autonomously with no central authority. Efficient resource sharing and discovery mechanisms are both essential for the functioning of the system as a whole and for the benefit of all participants.This paper illustrates our contributions to the characterization of unstructured peer-to-peer architectures, in which the overlay network topology and the adopted routing strategy are not deterministically correlated. Starting from classic analytical results in the field of random graphs, we introduce several novel topological models which put the emphasis on capturing the network growth, and that in our view are very significant for peer-to-peer systems. Moreover, we introduce a novel routing algorithm called HALO, which has been compared to the SRDI strategy adopted by JXTA. Simulation results of HALO and JXTA performance are provided for different overlay network topologies.

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

[2]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[3]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[4]  Michalis Faloutsos,et al.  Power laws and the AS-level internet topology , 2003, TNET.

[5]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[6]  Li Xiao,et al.  Approaching optimal peer-to-peer overlays , 2005, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[7]  Paul Baran,et al.  On Distributed Communications: I. Introduction to Distributed Communications Networks , 1964 .

[8]  Qi He,et al.  Mapping peer behavior to packet-level details: a framework for packet-level simulation of peer-to-peer systems , 2003, 11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003..

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

[10]  Christos H. Papadimitriou,et al.  On the Eigenvalue Power Law , 2002, RANDOM.

[11]  Jaime Lloret,et al.  The popularity parameter in unstructured P2P file sharing networks , 2004 .

[12]  Brey,et al.  Normal solutions for master equations with time-dependent transition rates: Application to heating processes. , 1993, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

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

[14]  Fabrício Benevenuto,et al.  Quantitative evaluation of unstructured peer-to-peer architectures , 2004 .

[15]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[16]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[17]  Bill Yeager,et al.  Project JXTA 2.0 Super-Peer Virtual Network , 2003 .