The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking

  • S. Tang
  • H. Wang
  • Piet Van Mieghem
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4982)


We revisit the peer selection problem of finding the most nearby peer from an initiating node. The metrics to assess the closeness between peers are hopcount and delay, respectively. Based on a dense graph model with i.i.d regular link weight, we calculate the probability density function to reach a peer with minimum hopcount and asymptotically analyze the probability to reach a peer with the smallest delay within a group of peers. Both results suggest that a small peer group size is enough to offer an acceptable content distribution service. We also demonstrate the applicability of our model via Internet measurements.


Link Weight Delay Constraint Dense Graph Short Path Tree Short Path Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Clauset, A., Moore, C.: Accuracy and scaling phenomena in Internet mapping. Physical Review Letters 94, 18701 (2005)CrossRefGoogle Scholar
  2. 2.
    Hooghiemstra, G., Van Mieghem, P.: The weight and hopcount of the shortest path in the complete graph with exponential weights. CPC (submitted)Google Scholar
  3. 3.
    ITU-T Rec. G.114, One-way transmission time (May 2003)Google Scholar
  4. 4.
    Van Mieghem, P.: Performance Analysis of Communications Networks and Systems. Cambridge University Press, Cambridge (2006)CrossRefzbMATHGoogle Scholar
  5. 5.
    Van Mieghem, P., Tang, S.: Weight of the Shortest Path to the First Encountered Peer in a Peer Group of Size m. Probability in the Engineering and Informational Sciences (PEIS) 22, 37–52 (2008)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Van der Hofstad, R., Hooghiemstra, G., Van Mieghem, P.: First Passage Percolation on the Random Graph. Probability in the Engineering and Informational Sciences (PEIS) 15, 225–237 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Tang, S., Wang, H., Van Mieghem, P.: Peer selection with hopcount and delay constraint, Delft University of Technology, report20080222 (2008)Google Scholar
  8. 8.
    Hei, X., Liang, C., Liang, J., Liu, Y., Ross, K.W.: Insights into PPLive: A measurement study of a large-scale P2P IPTV system. In: Workshop on Internet Protocol TV (IPTV) services over World Wide Web, Edinburgh, Scotland, May 23 (2006)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • S. Tang
    • 1
  • H. Wang
    • 1
  • Piet Van Mieghem
    • 1
  1. 1.Delft University of TechnologyDelftThe Netherlands

Personalised recommendations