The effect of peer selection with hopcount or delay constraint on peer-to-peer networking

Authors:
S. Tang;H. Wang;P. Van Mieghem
Affiliations:
Delft University of Technology, Delft, The Netherlands;Delft University of Technology, Delft, The Netherlands;Delft University of Technology, Delft, The Netherlands
Venue:
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Year:
2008

Citing 4
Cited 0

FIRST-PASSAGE PERCOLATION ON THE RANDOM GRAPH

Probability in the Engineering and Informational Sciences
Performance Analysis of Communications Networks and Systems

Performance Analysis of Communications Networks and Systems
Weight of the shortest path to the first encountered peer in a peer group of size m

Probability in the Engineering and Informational Sciences
The weight and hopcount of the shortest path in the complete graph with exponential weights

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.