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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Tang, S., Wang, H., & Van Mieghem, P. (2008). The effect of peer selection with hopcount or delay constraint on peer-to-peer networking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4982 LNCS, pp. 358–365). https://doi.org/10.1007/978-3-540-79549-0_31
Mendeley helps you to discover research relevant for your work.