Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-22T06:17:45.875Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Published online by Cambridge University Press:  18 December 2007

P. Van Mieghem  and
S. Tang
P. Van Mieghem
Affiliation:
Delft University of Technology, 2600 GA Delft, The Netherlands E-mail: [email protected]; [email protected]
S. Tang
Affiliation:
Delft University of Technology, 2600 GA Delft, The Netherlands E-mail: [email protected]; [email protected]
Get access Rights & Permissions [Opens in a new window]

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 independent and identically distributed 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 for estimating the minimal number of peers to offer an acceptable quality (delay or latency).

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 22 , Issue 1 , January 2008 , pp. 37 - 52
Copyright
Copyright © Cambridge University Press 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

1.Abramowitz, M. & Stegun, I.A. (1968). Handbook of mathematical functions. New York: Dover Publications.Google Scholar
2.Ashcroft, N.W. & Mermin, N.D. (1985). Solid state physics. Tokyo: Holt-Saunders International Editions.Google Scholar
3.Berndt, B.C. (1985). Ramanuyan's notebooks. New York: Springer-Verlag, Part I.Google Scholar
4.van der Hofstad, R., Hooghiemstra, G., & Van Mieghem, P. (2001). First-passage percolation on the random graph. Probability in the Engineering and Informational Sciences 15: 225–237.CrossRefGoogle Scholar
5.Van Mieghem, P. (2006). Performance analysis of communication systems and networks. Cambridge: Cambridge University Press.Google Scholar
6.Van Mieghem, P. (2006). Data communications networking. Amsterdam: Techne Press.Google Scholar