Print Email Facebook Twitter Weight of the Shortest Path to the First Encountered Peer in a Peer Group of Size m Title Weight of the Shortest Path to the First Encountered Peer in a Peer Group of Size m Author Van Mieghem, P. Tang, S. Faculty Electrical Engineering, Mathematics and Computer Science Department Network Architectures and Services Group Abstract We model the weight (e.g. delay, distance or cost) from an arbitrary node to the nearest (in weight) peer in a peer-to-peer (P2P) network. The exact probability generating function and an asymptotic analysis is presented for a random graph with i.i.d. exponential link weights. The asymptotic distribution function is a Fermi-Dirac distribution that frequently appears in statistical physics. The good agreement with simulation results for relatively small P2P networks makes the asymptotic formula for the probability density function useful to estimate the minimal number of peers to offer an acceptable quality (delay or latency). To reference this document use: http://resolver.tudelft.nl/uuid:f1ae5d52-3267-4bce-81b2-1fbd08866af6 Publisher Cambridge University Press ISSN 0269-9648 Source Linear Algebra and its Applications, Vol. 429, No. 2-3, July 2008 Part of collection Institutional Repository Document type journal article Rights (c) 2008 Van Mieghem, P.; Tang, S. Files PDF PEISweightofurtanycast.pdf 263.02 KB Close viewer /islandora/object/uuid:f1ae5d52-3267-4bce-81b2-1fbd08866af6/datastream/OBJ/view