Latency-driven replica placement

Michał Szymaniak, Guillaume Pierre, Maarten van Steen

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

43 Citations (Scopus)


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 languageEnglish
Title of host publication2005 Symposium on Applications and the Internet, SAINT 2005
Place of PublicationPiscataway, NJ
Number of pages7
ISBN (Print)9780769522623
Publication statusPublished - 1 Dec 2005
Externally publishedYes
Event5th International Symposium on Applications and the Internet 2005 - Trento, Italy
Duration: 31 Jan 20054 Feb 2005
Conference number: 5


Conference5th International Symposium on Applications and the Internet 2005
Abbreviated titleSAINT 2005
Internet address


Dive into the research topics of 'Latency-driven replica placement'. Together they form a unique fingerprint.

Cite this