The Effect of Peer Selection with Hopcount or Delay Constraint on Peer-to-Peer Networking

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.

• Type: Conference
• Year: 2008
• Where: NETWORKING
• Authors: Siyu Tang, Huijuan Wang, Piet Van Mieghem
• Keywords: Computer Networks, Nearby Peer, NETWORKING 2008, Peer Group Size, Peer Selection Problem