ACM Home Page
Please provide us with feedback. Feedback
A speed-based adaptive dynamic parallel downloading technique
Full text PdfPdf (550 KB)
Source ACM SIGOPS Operating Systems Review archive
Volume 39 ,  Issue 1  (January 2005) table of contents
Pages: 63 - 69  
Year of Publication: 2005
ISSN:0163-5980
Authors
Zhou Xu  College of Computer Science and Engineering of UEST of China, Chengdu, China
Lu Xianliang  College of Computer Science and Engineering of UEST of China, Chengdu, China
Hou Mengshu  College of Computer Science and Engineering of UEST of China, Chengdu, China
Zhan Chuan  College of Computer Science and Engineering of UEST of China, Chengdu, China
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 26,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1044552.1044559
What is a DOI?

ABSTRACT

In this paper, we describe adPD, an improved parallel downloading approach for Peer-to-Peer environment. adPD assigns each server equal portion of file as large as possible, and ensures client downloading from each server without interrupt. And after faster servers finish their own work, adPD reallocates part of unfinished work of some slower servers to them. This reallocation is proportional to the ratio of server speed. By this means, adPD dynamically adjusts the proportion of a file retrieved from each server during the downloading process to match the bandwidth of each connection, and also reduces the number of block requests as many as possible. Our experiment results show that adPD is an effective parallel download scheme in Peer-to-Peer environment.


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
A. Miu and E. Shih, Performance Analysis of a Dynamic Parallel Downloading Scheme from Mirror Sites Throughout the Internet, url: http://nms.lcs.mit.edu/~aklmiu/comet/paraload.html, December 1999.
 
2
Pablo Rodriguez, Andreas Kirpal, and Ernst W. Biersack. Parallel-access for mirror sites in the internet. In Proceedings of IEEE INFOCOM 2000, March 2000.
 
3
Speedbit's download accelerator. http://www.speedbit.com
 
4
Bram Cohen, Incentives Build Robustness in BitTorrent, http://bitconjurer.org/BitTorrent/documentation.html, May, 2003.
5
 
6
Musiccity, http://www.musiccity.com
 
7
"OpenCola Swarmcast", http://www.opencola.org/projects/swarmcast.shtml.
 
8
Andy Myers, Peter A. Dinda, and Hui Zhang. Performance characteristics of mirror servers on the internet. In INFOCOM (1), pages 304--312, 1999.
 
9
 
10
 
11
 
12
A. Zeitoun, H. Jamjoom, and M. El-Gendy. Scalable Parallel-Access For Mirrored Servers. In The 20th IASTED International Conference on Applied Informatics (AI 2002), Innsbruck, Austria, Feb. 2002.
 
13
Wei Qingsong, The Research on Large-Scale Distributed Storage Technology, Ph. D. Thesis, UESTC, China, 2004

Collaborative Colleagues:
Zhou Xu: colleagues
Lu Xianliang: colleagues
Hou Mengshu: colleagues
Zhan Chuan: colleagues