Peer Selection with Hopcount and Delay Constraint

Report (2008)
Department
Network Architectures and Services Group (EEMCS) (TU Delft)
Copyright: © 2008 Tang, S.; Wang, H.; Van Mieghem, P.
More Info
expand_more

Published Date

2008

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Source:

Delft University of Technology, report20080222

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Network Architectures and Services Group

Abstract

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.