Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Journal of Algorithms
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Locality-aware request distribution in cluster-based network servers
Proceedings of the eighth international conference on Architectural support for programming languages and operating systems
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Selection algorithms for replicated Web servers
ACM SIGMETRICS Performance Evaluation Review
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
An algorithm for finding a K-median in a directed tree
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
On network-aware clustering of Web clients
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Optimal solutions for multi-unit combinatorial auctions: branch and bound heuristics
Proceedings of the 2nd ACM conference on Electronic commerce
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
On the origin of power laws in Internet topologies
ACM SIGCOMM Computer Communication Review
Maintenance-Free Global Data Storage
IEEE Internet Computing
Allocating Data and Operations to Nodes in Distributed Database Design
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Approximation Algorithms for Data Distribution with Load Balancing of Web Servers
CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Data Distribution Algorithms For Load Balanced Fault-Tolerant Web Access
SRDS '97 Proceedings of the 16th Symposium on Reliable Distributed Systems
Scalable Web Server Design for Distributed Data Management
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Load Balancing in Distributed Web Server Systems with Partial Document Replication
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Dynamic Replica Management in the Service Grid
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
An Overview of Data Replication on the Internet
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Analysis and modeling of world wide web traffic
Analysis and modeling of world wide web traffic
Caching and replication schemes on the internet
Caching and replication schemes on the internet
The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy
Distributed Computing
Towards capturing representative AS-level Internet topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Static and adaptive distributed data replication using genetic algorithms
Journal of Parallel and Distributed Computing
A Powerful Direct Mechanism for Optimal WWW Content Replication
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Optimal File Allocation in a Multiple Computer System
IEEE Transactions on Computers
IEEE Communications Magazine
Design and evaluation of data allocation algorithms for distributed multimedia database systems
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
Using Multicast Transfers in the Replica Migration Problem: Formulation and Scheduling Heuristics
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Caching in content-based publish/subscribe systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Wide area placement of data replicas for fast and highly available data access
Proceedings of the fourth international workshop on Data-intensive distributed computing
The Journal of Supercomputing
Document replication strategies for geographically distributed web search engines
Information Processing and Management: an International Journal
GCplace: geo-cloud based correlation aware data replica placement
Proceedings of the 28th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
This paper compares and analyzes 10 heuristics to solve the fine-grained data replication problem over the Internet. In fine-grained replication, frequently accessed data objects (as opposed to the entire website contents) are replicated onto a set of selected sites so as to minimize the average access time perceived by the end users. The paper presents a unified cost model that captures the minimization of the total object transfer cost in the system, which in turn leads to effective utilization of storage space, replica consistency, fault-tolerance, and load-balancing. The set of heuristics include six A-Star based algorithms, two bin packing algorithms, one greedy and one genetic algorithm. The heuristics are extensively simulated and compared using an experimental test-bed that closely mimics the Internet infrastructure and user access patterns. GT-ITM and Inet topology generators are used to obtain 80 well-defined network topologies based on flat, link distance, power-law and hierarchical transit-stub models. The user access patterns are derived from real access logs collected at the websites of Soccer World Cup 1998 and NASA Kennedy Space Center. The heuristics are evaluated by analyzing the communication cost incurred due to object transfers under the variance of server capacity, object size, read access, write access, number of objects and sites. The main benefit of this study is to facilitate readers with the choice of algorithms that guarantee fast or optimal or both types of solutions. This allows the selection of a particular algorithm to be used in a given scenario.