Latency-driven replica placement

Michał Szymaniak, Guillaume Pierre, Maarten van Steen

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

33 Citations (Scopus)

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 languageEnglish
Title of host publication2005 Symposium on Applications and the Internet, SAINT 2005
Place of PublicationPiscataway, NJ
PublisherIEEE
Pages399-405
Number of pages7
ISBN (Print)9780769522623
DOIs
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
http://www.saintconference.org/2005/

Conference

Conference5th International Symposium on Applications and the Internet 2005
Abbreviated titleSAINT 2005
CountryItaly
CityTrento
Period31/01/054/02/05
Internet address

Fingerprint

Wide area networks
Internet
Costs

Cite this

Szymaniak, M., Pierre, G., & van Steen, M. (2005). Latency-driven replica placement. In 2005 Symposium on Applications and the Internet, SAINT 2005 (pp. 399-405). [1386140] Piscataway, NJ: IEEE. https://doi.org/10.1109/SAINT.2005.37
Szymaniak, Michał ; Pierre, Guillaume ; van Steen, Maarten. / Latency-driven replica placement. 2005 Symposium on Applications and the Internet, SAINT 2005. Piscataway, NJ : IEEE, 2005. pp. 399-405
@inproceedings{41c7d6cd5d62439f8cd1adc34a6e9927,
title = "Latency-driven replica placement",
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)).",
author = "Michał Szymaniak and Guillaume Pierre and {van Steen}, Maarten",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/SAINT.2005.37",
language = "English",
isbn = "9780769522623",
pages = "399--405",
booktitle = "2005 Symposium on Applications and the Internet, SAINT 2005",
publisher = "IEEE",
address = "United States",

}

Szymaniak, M, Pierre, G & van Steen, M 2005, Latency-driven replica placement. in 2005 Symposium on Applications and the Internet, SAINT 2005., 1386140, IEEE, Piscataway, NJ, pp. 399-405, 5th International Symposium on Applications and the Internet 2005, Trento, Italy, 31/01/05. https://doi.org/10.1109/SAINT.2005.37

Latency-driven replica placement. / Szymaniak, Michał; Pierre, Guillaume; van Steen, Maarten.

2005 Symposium on Applications and the Internet, SAINT 2005. Piscataway, NJ : IEEE, 2005. p. 399-405 1386140.

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

TY - GEN

T1 - Latency-driven replica placement

AU - Szymaniak, Michał

AU - Pierre, Guillaume

AU - van Steen, Maarten

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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)).

AB - 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)).

UR - http://www.scopus.com/inward/record.url?scp=78649717411&partnerID=8YFLogxK

U2 - 10.1109/SAINT.2005.37

DO - 10.1109/SAINT.2005.37

M3 - Conference contribution

SN - 9780769522623

SP - 399

EP - 405

BT - 2005 Symposium on Applications and the Internet, SAINT 2005

PB - IEEE

CY - Piscataway, NJ

ER -

Szymaniak M, Pierre G, van Steen M. Latency-driven replica placement. In 2005 Symposium on Applications and the Internet, SAINT 2005. Piscataway, NJ: IEEE. 2005. p. 399-405. 1386140 https://doi.org/10.1109/SAINT.2005.37