The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking
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.
KeywordsLink Weight Delay Constraint Dense Graph Short Path Tree Short Path Tree
- 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.ITU-T Rec. G.114, One-way transmission time (May 2003)Google Scholar
- 7.Tang, S., Wang, H., Van Mieghem, P.: Peer selection with hopcount and delay constraint, Delft University of Technology, report20080222 (2008)Google Scholar
- 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