Abstract
Inspired by the observation that most researches on cluster, grid, and cloud computing are intended to reduce the replication cost of files between client and server instead of minimizing the transmission time, this paper presents an efficient data replication mechanism for parallel download called DRMPD to minimize the average transmission time, by replicating the so-called popular files to multiple nodes that are more efficient for download while at the same time taking into account parallelism in download, especially when many applications nowadays can support parallel download. Simulation results indicate that the proposed scheme outperforms the previous schemes in terms of the average transmission time in both the best case and the average case.
| Original language | English |
|---|---|
| Pages (from-to) | 7031-7053 |
| Number of pages | 23 |
| Journal | International Journal of Innovative Computing, Information and Control |
| Volume | 8 |
| Issue number | 10 B |
| Publication status | Published - 2012 Oct |
All Science Journal Classification (ASJC) codes
- Software
- Theoretical Computer Science
- Information Systems
- Computational Theory and Mathematics