3.1 Problem Statement

Check out the new USENIX Web site.

Next: 3.2 FastReplica in the Up: 3 FastReplica Algorithm Previous: 3 FastReplica Algorithm

3.1 Problem Statement

We use the following notations:

Let be a node which has an original file and let denote the size of file in bytes;
Let $R = \{N_1, ..., N_n\}$ be a replication set of nodes.

The problem consists in replicating file

across nodes

while minimizing the overall replication time.