On neighbor-selection strategy in hybrid peer-to-peer networks
Future Generation Computer Systems - Systems performance analysis and evaluation
Structuring connections between content delivery servers groups
Future Generation Computer Systems
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
SMC: an energy conserving P2P file sharing model for mobile devices
MobiDE '12 Proceedings of the Eleventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
| Hi-index | 0.00 |
Peer-to-peer systems contain a collection of equivalententities that form an application-layer overlay network.Each entity acts as client, server, and overlaynetwork router. Peer-to-peer systems enable the rapiddevelopment of distributed applications; in short order,peer-to-peer file sharing has become one of the mostpopular Internet applications. There are two primaryfunctions in a peer-to-peer file sharing application: contentdiscovery (determining which peers have the desiredcontent) and content retrieval (transferring contentfrom a peer to the requester). We focus on two aspectsof content retrieval that have received limited attention,namely peer selection and request buffering. Using acombination of analytic modelling and simulation, wefind that a simple greedy scheme that uses only local informationto select a peer has performance comparableto alternative schemes, including those that make moreglobally-informed decisions. We also find that the optimalrequest buffering strategy depends on the systemload and availability of peer information. For example,when peer information is scarce, download bufferingworks well; when peer information is plentiful, nobuffering is preferable for better throughput. Our resultshave implications for the design of high-performance,low overhead peer-to-peer file sharing systems.