``Downloading Replicated, Wide-Area Files -- A Framework and Empirical Evaluation''
Rebecca L. Collins
James S. Plank.
Technical Report UT-CS-04-527, University of Tennessee, June, 2004.
This paper has been published
Citation: Rebecca L. Collins and James S. Plank, ``Downloading Replicated, Wide-Area Files -- a Framework and Empirical Evaluation,''
The 3rd IEEE International Symposium on Network Computing and Applications, Cambridge, MA, USA, August, 2004.
See this link for further information, and for the
PDF of that paper.
Available via anonymous ftp to cs.utk.edu in
The challenge of efficiently retrieving files that are broken into
segments and replicated across the wide-area is of prime importance
to wide-area, peer-to-peer, and Grid file systems. Two differing
algorithms addressing this challenge have been proposed and
evaluated. While both have been successful in differing performance
scenarios, there has been no unifying work that can view both
algorithms under a single framework. In this paper, we define such a
framework, where download algorithms are defined in terms of four
dimensions: the number of simultaneous downloads, the degree of work
replication, the failover strategy, and the server selection
algorithm. We then explore the impact of varying parameters along
each of these dimensions.
PDF of the paper
- Plain Text:
author R. L. Collins and J. S. Plank
title Downloading Replicated, Wide-Area Files --
A Framework and Empirical Evaluation
institution University of Tennessee
author = "R. L. Collins and J. S. Plank",
title = "Downloading Replicated, Wide-Area Files --
A Framework and Empirical Evaluation",
institution = "University of Tennessee",
number = "CS-04-527",
month = "June",
year = "2004",
where = "http://web.eecs.utk.edu/~jplank/plank/papers/CS-04-527.html"