Analysis of the Shortest Path Length in Peer-to-Peer Networks
Hai Jin · Journal of Chinese Computer Systems · 2006
Peer-to-Peer(P2P)networks can be represented as graphs,where vertexes represent nodes in networks and edges represent the links between nodes.Like other complex networks such as Internet,web and social network,P2P networks often exhibit power-law degree distribution.Traditionally,communication networks were always modeled as random graphs with Poisson degree distributions, which will lead to mischaracterize real networks.In communication networks, shortest path length between two arbitrary nodes is a very important characteristic, and the design and implementation of many algorithms such as routing and searching is based on it.This paper presened theoretical modeling and analysis in detail to P2P network,and verifies the correctness of theoretical analysis through measuring real Gnutella network.