Latency-driven replica placement
Latency-driven replica placement
复制标题
延迟驱动的副本放置
DOI：
10.1109/saint.2005.37
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
M. Steen
中科院分区：
文献类型：
--
作者：
Michal Szymaniak;G. Pierre;M. Steen
本文介绍了HotZone，一种算法，将副本在广域网中，使客户端到副本的延迟最小化。与之前提出的HotSpot算法类似，HotZone将副本放置在沿着其相邻节点生成最高负载的节点上。然而，与HotSpot相比，HotZone通过考虑重叠的邻域提供了接近最佳的结果。HotZone依赖于互联网空间的几何模型，有效地将在N个潜在副本位置中放置K个副本的成本从O（N/sup 2/）降低到O（N /spl middot/ max（logN，K））。
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/sup 2/) to O(N /spl middot/ max(logN, K)).