ACM Home Page
Please provide us with feedback. Feedback
Rethinking FTP: Aggressive block reordering for large file transfers
Full text PdfPdf (790 KB)
Source
ACM Transactions on Storage (TOS) archive
Volume 4 ,  Issue 4  (January 2009) table of contents
Article No. 13  
Year of Publication: 2009
ISSN:1553-3077
Authors
Stergios V. Anastasiadis  University of Ioannina, Greece
Rajiv G. Wickremesinghe  Oracle Corporation, Redwood Shores, CA
Jeffrey S. Chase  Duke University, Durham, NC
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 168,   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/1480439.1480442
What is a DOI?

ABSTRACT

Whole-file transfer is a basic primitive for Internet content dissemination. Content servers are increasingly limited by disk arm movement, given the rapid growth in disk density, disk transfer rates, server network bandwidth, and content size. Individual file transfers are sequential, but the block access sequence on a content server is effectively random when many slow clients access large files concurrently. Although larger blocks can help improve disk throughput, buffering requirements increase linearly with block size.

This article explores a novel block reordering technique that can reduce server disk traffic significantly when large content files are shared. The idea is to transfer blocks to each client in any order that is convenient for the server. The server sends blocks to each client opportunistically in order to maximize the advantage from the disk reads it issues to serve other clients accessing the same file. We first illustrate the motivation and potential impact of aggressive block reordering using simple analytical models. Then we describe a file transfer system using a simple block reordering algorithm, called Circus. Experimental results with the Circus prototype show that it can improve server throughput by a factor of two or more in workloads with strong file access locality.


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
3
 
4
 
5
6
7
8
9
10
11
12
 
13
14
 
15
 
16
Cohen, B. 2003. Incentives build robustness in bittorrent. bitconjurer.org.
 
17
Diot, C. and Gagnon, F. 1999. Impact of out-of-sequence processing on the performance of data transmission. Comput. Netw. 31, 475--492.
 
18
Doyle, R. P., Chase, J. S., Gadde, S., and Vahdat, A. M. 2001. The trickle-down effect: Web caching and server request distribut ion. In Proceedings of the International Workshop on Web Caching and Content Delivery.
 
19
 
20
21
 
22
 
23
 
24
25
 
26
27
 
28
 
29
30
 
31
Rost, S., Byers, J., and Bestavros, A. 2001. The cyclone server architecture: Streamlining delivery of popular content. In Proceedings of the International Workshop on Web Caching and Content Distribution. Boston, MA.
32
 
33
Saroiu, S., Gummadi, P. K., and Gribble, S. D. 2002. A measurement study of peer-to-peer file sharing systems. In Proceedings of the SPIE/ACM Multimedia Computing and Networking Conference.
34
 
35
36
37
38
39

Collaborative Colleagues:
Stergios V. Anastasiadis: colleagues
Rajiv G. Wickremesinghe: colleagues
Jeffrey S. Chase: colleagues