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

AbstractTo ensure efcient content retrieval in a distributed network (e.g. peer-to-peer network), a connected peer with required replica should be "close " (depending on what crieria we are using) to the requesting peer. We model the peer selection problem as nding the most nearby peer with respect to the number of hops, and the delay (latency) separately. Both the exact probability density function of the hopcount and the asymptotic analysis of the delay indicate that a minimum peer group size exists to offer an acceptable content distribution service. The analysis are presented for a random graph with i.i.d exponential link weights, and these observations may shed light on the architectural design of a P2P storage system. I