An on-line replication strategy to increase availability in Data Grids
Future Generation Computer Systems
Practical large-scale latency estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
DADC '08 Proceedings of the 2008 international workshop on Data-aware distributed computing
On content delivery network implementation
Computer Communications
Self-organized service placement in ambient intelligence environments
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Topology-aware replica placement in fault-tolerant embedded networks
ARCS'08 Proceedings of the 21st international conference on Architecture of computing systems
Dynamic replication in a data grid using a Modified BHR Region Based Algorithm
Future Generation Computer Systems
Wide area placement of data replicas for fast and highly available data access
Proceedings of the fourth international workshop on Data-intensive distributed computing
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Active fault-tolerant system for open distributed computing
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Integrating caching techniques on a content distribution network
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Dynamic service placement in shared service hosting infrastructures
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
Decreasing power consumption with energy efficient data aware strategies
Future Generation Computer Systems
| Hi-index | 0.00 |
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)).