|
Published Articles >> Table of Contents >> Abstract
2005 Symposium on Applications and the Internet (SAINT'05)
pp. 399-405
Latency-Driven Replica Placement
Michal Szymaniak, Vrije Universiteit Amsterdam, The Netherlands
Guillaume Pierre, Vrije Universiteit Amsterdam, The Netherlands
Maarten van Steen, Vrije Universiteit Amsterdam, The Netherlands
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SAINT.2005.37
Send link to a friend
| Abstract |
|
This paper presents HotZone, an algorithm to place replicas in a wide-area network such that the client-to-replica latency is minimized. Similar to the previously proposed HotSpot algorithm, HotZone places replicas on nodes that along with their neighboring nodes generate the highest load. In contrast to HotSpot, however, HotZone provides nearly-optimal results by considering overlapping neighborhoods. HotZone relies on a geometric model of Internet latencies, which effectively reduces the cost of placing K replicas among N potential replica locations from O(N^2) to O(N · max(logN, K)).
|
 Additional Information
|
Citation:
Michal Szymaniak, Guillaume Pierre, Maarten van Steen,
"Latency-Driven Replica Placement,"
saint,
pp. 399-405,
2005 Symposium on Applications and the Internet (SAINT'05),
2005
|
|
