ACM Home Page
Please provide us with feedback. Feedback
Improving peer-to-peer performance through server-side scheduling
Full text PdfPdf (992 KB)
Source
ACM Transactions on Computer Systems (TOCS) archive
Volume 26 ,  Issue 4  (December 2008) table of contents
Article No. 10  
Year of Publication: 2008
ISSN:0734-2071
Authors
Yi Qiao  Northwestern University, Evanston, IL
Fabián E. Bustamante  Northwestern University, Evanston, IL
Peter A. Dinda  Northwestern University, Evanston, IL
Stefan Birrer  Northwestern University, Evanston, IL
Dong Lu  Ask Jeeves
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 23,   Downloads (12 Months): 350,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1455258.1455260
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Almeida, J., Dabu, M., Manikutty, A., and Cao, P. 1998. Providing differentiated quality-of-service in Web hosting services. In Proceedings of the 1st Workshop on Internet Server Performance (WISP).
 
3
aMule. 2004. aMule homepage. http://www.amule.org.
4
 
5
Bernstein, D. S., Feng, Z., Levine, B. N., and Zilberstein, S. 2003. Adaptive peer selection. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS).
 
6
 
7
 
8
Brockwell, P. J. and Davis, R. A. 2002. Introduction to Time Series and Forecasting, 2nd ed. Springer, New York.
 
9
Bustamante, F. E. and Qiao, Y. 2003. Friendships that last: Peer lifespan and its role in P2P protocols. In Proceedings of the 8th International Workshop on Web Content and Caching Distribution.
 
10
 
11
CacheLogic. 2005. P2P in 2005. http://www.cachelogic.com/research/index.php.
 
12
13
 
14
15
 
16
Deng, S. 1996. Empirical model of WWW document arivals at access links. In Proc. IEEE ICC.
 
17
eDonkey. 2004. About mftp (multisource file transmission protocol). http://www.edonkey2000.com/documentation/mftp.html.
 
18
eMule. 2004. eMule homepage. http://www.emule-project.net.
19
20
 
21
 
22
Harchol-Balter, M., Crovella, M., and Park, S. 1998. The case for SRPT scheduling in Web servers. Tech. Rep. MIT-LCS-TR-767.
23
 
24
25
 
26
 
27
Lu, D., Dinda, P. A., Qiao, Y., Sheng, H., and Bustamante, F. E. 2004. Applications of SRPT scheduling with inaccurate information. In Proceedings of the IEEE/ACM Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS).
 
28
 
29
 
30
MetaMachine. 2004. eDonkey homepage. http://www.edonkey2000.com.
 
31
 
32
 
33
Mutella. 2004. Mutella homepage. http://mutella.sourceforge.net.
 
34
 
35
Perera, R. 1993. The variance of delay time in queueing system M/G/1 with optimal strategy SRPT. Archiv fur Elektronik und Uebertragungstechnik 47, 2, 110--114.
36
 
37
 
38
 
39
40
41
 
42
Saroiu, S., Gummadi, P. K., and Gribble, S. D. 2002. A measurement study of peer-to-peer file sharing systems. In Proceedings of the Annual Multimedia Computing and Networking (MMCN).
 
43
Schrage, L. E. 1968. A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16, 678--690.
 
44
Schrage, L. E. and Miller, L. W. 1966. The queue M/G/1 with the shortest remaining processing time discipline. Oper. Res. 14, 670--684.
45
 
46
Sharman Networks Ltd. 2004. Kazaa homepage. http://www.kazaa.com.
47
 
48
 
49
 
50
 
51

Collaborative Colleagues:
Yi Qiao: colleagues
Fabián E. Bustamante: colleagues
Peter A. Dinda: colleagues
Stefan Birrer: colleagues
Dong Lu: colleagues