Latency-Driven Replica Placement (特集:ユビキタス社会を支えるコンピュータセキュリティ技術)
スポンサーリンク
概要
- 論文の詳細を見る
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)).
- 一般社団法人情報処理学会の論文
- 2006-08-15
著者
-
Steen Maarten
Vrije Universiteit Amsterdam Department Of Computer Science Amsterdam The Netherlands
-
Pierre Guillaume
Vrije Universiteit Amsterdam Department Of Computer Science Amsterdam The Netherlands
-
SZYMANIAK MICHAL
Vrije Universiteit Amsterdam Department of Computer Science Amsterdam, The Netherlands
-
Szymaniak Michal
Vrije Universiteit Amsterdam Department Of Computer Science Amsterdam The Netherlands