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.

Available via anonymous ftp to cs.utk.edu in pub/plank/papers/NCA-04.pdf.

Abstract

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 impack of varying parameters along each of these dimensions.

Citation Information

Plain Text:

author          R. L. Collins and J. S. Plank
title           Downloading Replicated, Wide-Area Files -- a Framework
                and Empirical Evaluation
booktitle       3rd IEEE International Symposium on Network Computing
                and Applications (NCA-2004)
address         Cambridge, MA
month           August
year            2004

Bibtex:

@INPROCEEDINGS{cp:04:drw,
        author = "R. L. Collins and J. S. Plank",
        title = "Downloading Replicated, Wide-Area Files -- a Framework
                and Empirical Evaluation",
        booktitle = "3rd IEEE International Symposium on Network Computing
                and Applications (NCA-2004)",
        address = "Cambridge, MA",
        month = "August",
        year = "2004",
        where = "http://web.eecs.utk.edu/~jplank/plank/papers/NCA-04.html"
}