Algorithms for High Performance, Wide-area Distributed File Downloads
James S. Plank,
Parallel Processing Letters,
Volume 13, Number 2, June, 2003, pages 207-224.
Get the paper from the journal's
web site. Who knows how long it will be available without a subscription.
If you have problems, send me email and I can send you one of my reprints.
Additionally, you can grab the technical report of
This paper explores three algorithms for high-performance downloads of
wide-area, replicated data. The storage model is based on the Network Storage
Stack, which allows for flexible sharing and utilization of writable
storage as a network resource. The algorithms assume that data is
replicated in various storage depots in the wide area, and the
data must be delivered to the client either as a downloaded file
or as a stream to be consumed by an application, such as a
media player. The algorithms are threaded and adaptive, attempting
to get good performance from nearby replicas, while still utilizing
the faraway replicas. After defining the algorithms, we explore their
performance downloading a 50 MB file replicated on six storage depots
in the U.S., Europe and Asia, to two clients in different parts of the U.S.
One algorithm, called progress-driven redundancy exhibits
excellent performance characteristics for both
file and streaming downloads.
- Plain Text:
author J. S. Plank and S. Atchley and Y. Ding and M. Beck
title Algorithms for High Performance, Wide-area
Distributed File Downloads
journal Parallel Processing Letters
author = "J. S. Plank and S. Atchley and Y. Ding and M. Beck",
title = "Algorithms for High Performance, Wide-area
Distributed File Downloads",
journal = "Parallel Processing Letters",
month = "June",
year = "2003",
volume = "13",
number = "2",
pages = "207-224",
where = "http://web.eecs.utk.edu/~jplank/plank/papers/PPL-03.html