A speed-based adaptive dynamic parallel downloading technique
ACM SIGOPS Operating Systems Review
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On neighbor-selection strategy in hybrid peer-to-peer networks
Future Generation Computer Systems - Systems performance analysis and evaluation
QoS Driven Parallelization of Resources to Reduce File Download Delay
IEEE Transactions on Parallel and Distributed Systems
Minimizing file download time in stochastic peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Future Generation Computer Systems
A novel algorithm for fast retrival of information from a multiprocessor server
SEPADS'08 Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems
A Recursively-Adjusting Co-allocation scheme with a Cyber-Transformer in Data Grids
Future Generation Computer Systems
Performance evaluation of the multi-source file transfer protocol in peer-to-peer network
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Characterizing the file hosting ecosystem: A view from the edge
Performance Evaluation
| Hi-index | 0.02 |
Recently, the scheme of parallel downloading (PD) has been adopted by a number of Internet file downloading applications. With the wide deployment of content distribution networks and peer-to-peer networks, PD is expected to be more commonly used for file distribution. There have been experiments showing that PD results in higher aggregated downloading throughput and therefore shorter downloading time experienced by clients. However, these experimental studies focused on the performance experienced by a particular user and did not consider theimpact of PD on the network when it is largely deployed. In this paper we present our efforts toward an in-depth understanding of large-scale deployment of PD through simulation and analysis. Our results suggest that while PD may achieve a shorter downloading time, its impact on the network and server is signi.cant. Our analysis is also used for network dimensioning and content distribution service provisioning. We show that with proper admission control and dimensioning, single-server downloading can perform just as well as PD, without the complexity and overhead incurred by PD.