Internet Archive Scholar

WEIGHT OF THE SHORTEST PATH TO THE FIRST ENCOUNTERED PEER IN A PEER GROUP OF SIZE m

P. Van Mieghem, S. Tang
2007 Probability in the engineering and informational sciences (Print)  

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (269.3 kB)
https://web.archive.org/web/20081002132948/http://www.nas.ewi.tudelft.nl/people/Piet/papers/PEISweightofurtanycast.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL. The file type is application/pdf.

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
more » ... or the probability density function useful to estimate the minimal number of peers to offer an acceptable quality (delay or latency). *
doi:10.1017/s026996480800003x fatcat:4ips2ktqbrct5nubtopn5mavi4
Citation

P. Van Mieghem, S. Tang. "WEIGHT OF THE SHORTEST PATH TO THE FIRST ENCOUNTERED PEER IN A PEER GROUP OF SIZE m." Probability in the engineering and informational sciences (Print) 22.01 (2007)