Title
Peer Selection with Hopcount and Delay Constraint
Author
Tang, S.
Wang, H.
Van Mieghem, P.
Faculty
Electrical Engineering, Mathematics and Computer Science
Department
Network Architectures and Services Group
Date
2008
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.
To reference this document use:
http://resolver.tudelft.nl/uuid:15494d54-9d42-4433-91ff-b2901438b1a2
Publisher
Delft University of Technology
Source
Delft University of Technology, report20080222
Part of collection
Institutional Repository
Document type
report
Rights
(c) 2008 Tang, S.; Wang, H.; Van Mieghem, P.