Improving Peer-to-Peer Performance through Server-Side Scheduling

• Published in: ACM transactions on computer systems 2008-12, Vol.26 (4), p.1-30
• Main Authors: YI QIAO, BUSTAMANTE, Fabian E, DINDA, Peter A, BIRRER, Stefan, DONG LU
• Format: Article
• Language: English
• Subjects: Applied sciences; Exact sciences and technology; Interconnected networks; Networks and services in france and abroad; Telecommunications; Telecommunications and information theory; Teleprocessing networks. Isdn; Valuation and optimization of characteristics. Simulation
• ISSN: 0734-2071; 1557-7333
• DOI: 10.1145/1455258.1455260

We show how to significantly improve the mean response time seen by both uploaders and downloaders in peer-to-peer data-sharing systems. Our work is motivated by the observation that response times are largely determined by the performance of the peers serving the requested objects, that is, by the peers in their capacity as servers. With this in mind, we take a close look at this server side of peers, characterizing its workload by collecting and examining an extensive set of traces. Using trace-driven simulation, we demonstrate the promise and potential problems with scheduling policies based on shortest-remaining-processing-time (SRPT), the algorithm known to be optimal for minimizing mean response time. The key challenge to using SRPT in this context is determining request service times. In addressing this challenge, we introduce two new estimators that enable predictive SRPT scheduling policies that closely approach the performance of ideal SRPT. We evaluate our approach through extensive single-server and system-level simulation coupled with real Internet deployment and experimentation.