Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Competitive distributed file allocation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Static scheduling algorithms for allocating directed task graphs to multiprocessors
ACM Computing Surveys (CSUR)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Web caching and replication
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
A Dynamic Object Replication and Migration Protocol for an Internet Hosting Service
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Choosing Replica Placement Heuristics for Wide-Area Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
The Grid 2: Blueprint for a New Computing Infrastructure
The Grid 2: Blueprint for a New Computing Infrastructure
Optimizing Download Time of Embedded Multimedia Objects for Web Browsing
IEEE Transactions on Parallel and Distributed Systems
Object replication strategies in content distribution networks
Computer Communications
Mistreatment-resilient distributed caching
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Parallel and Distributed Systems
Formal Model and Scheduling Heuristics for the Replica Migration Problem
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Optimal replica placement in hierarchical Data Grids with locality assurance
Journal of Parallel and Distributed Computing
A file assignment strategy independent of workload characteristic assumptions
ACM Transactions on Storage (TOS)
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
A feedback control approach to mitigating mistreatment in distributed caching groups
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
A dynamic replica management strategy in data grid
Journal of Network and Computer Applications
CEA: A Cyclic Expansion Algorithm for data migration in parallel video servers
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RPP formulations fall into two categories: static and dynamic. The first assumes that access statistics are estimated in advance and remain static, and, therefore, a one-time replica distribution is sufficient (IRPP). In contrast, dynamic methods change the replicas in the network potentially upon every request. This paper proposes an alternative technique, named Continuous Replica Placement Problem (CRPP), which falls between the two extreme approaches. CRPP can be defined as: Given an already implemented replication scheme and estimated access statistics for the next time period, define a new replication scheme, subject to optimization criteria and constraints. As we show in the problem formulation, CRPP is different in that the existing heuristics in the literature cannot be used either statically or dynamically to solve the problem. In fact, even with the most careful design, their performance will be inferior since CRPP embeds a scheduling problem to facilitate the proposed mechanism. We provide insight on the intricacies of CRPP and propose various heuristics.