Peer Selection with Hopcount and Delay Constraint
Van Mieghem, P.
Electrical Engineering, Mathematics and Computer Science
Network Architectures and Services Group
We revisit the peer selection problem of finding the most nearby peer from an initiating peer. 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.
To reference this document use:
Delft University of Technology
Delft University of Technology, report20080222
Part of collection
(c) 2008 Tang, S.; Wang, H.; Van Mieghem, P.