Abstract
This paper presents HotZone, an algorithm to place replicas in a wide-area network such that the client-toreplica 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(N2) to O(N · max(logN,K)).
Original language | English |
---|---|
Title of host publication | 2005 Symposium on Applications and the Internet, SAINT 2005 |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 399-405 |
Number of pages | 7 |
ISBN (Print) | 9780769522623 |
DOIs | |
Publication status | Published - 1 Dec 2005 |
Externally published | Yes |
Event | 5th International Symposium on Applications and the Internet 2005 - Trento, Italy Duration: 31 Jan 2005 → 4 Feb 2005 Conference number: 5 http://www.saintconference.org/2005/ |
Conference
Conference | 5th International Symposium on Applications and the Internet 2005 |
---|---|
Abbreviated title | SAINT 2005 |
Country/Territory | Italy |
City | Trento |
Period | 31/01/05 → 4/02/05 |
Internet address |