Mobile dynamic content distribution networks
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Allocating Fragments in Distributed Databases
IEEE Transactions on Parallel and Distributed Systems
Continuous Replica Placement schemes in distributed systems
Proceedings of the 19th annual international conference on Supercomputing
QoS-Aware Replica Placement for Content Distribution
IEEE Transactions on Parallel and Distributed Systems
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
Analysis of Replica Placement under Expiration-Based Consistency Management
IEEE Transactions on Parallel and Distributed Systems
Optimal Replica Placement under TTL-Based Consistency
IEEE Transactions on Parallel and Distributed Systems
Supporting mobile multimedia applications in MAPGrid
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
File grouping for scientific data management: lessons from experimenting with real traces
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Efficient application placement in a dynamic hosting platform
Proceedings of the 18th international conference on World wide web
Comparison of Access Policies for Replica Placement in Tree Networks
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
A file assignment strategy independent of workload characteristic assumptions
ACM Transactions on Storage (TOS)
Replica placement in ring based content delivery networks
Computer Communications
Combining replica placement and caching techniques in content distribution networks
Computer Communications
Self-organized service placement in ambient intelligence environments
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Replicating web contents using a hybrid particle swarm optimization
Information Processing and Management: an International Journal
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
A scalable framework for content replication in multicast-based content distribution networks
MMNS'06 Proceedings of the 9th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services
Replica based distributed metadata management in grid environment
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
Roles of agents in data-intensive web sites
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Knowledge management framework for the collaborative distribution of information
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
DELOS'04 Proceedings of the 6th Thematic conference on Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures
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
Replicating for performance: case studies
Replication
QoS-aware placement of stream processing service
The Journal of Supercomputing
Developing an optimized application hosting framework in Clouds
Journal of Computer and System Sciences
Hi-index | 0.00 |
Data replication is used extensively in wide-area distributed systems to achieve low data-access latency. A large number of heuristics have been proposed to perform replicaplacement. Practical experience indicates that the choice of heuristic makes a big difference in terms of the cost of required infrastructure (e.g., storage capacity and network bandwidth), depending on system topology, workload and performance goals.This paper describes a method to assist system designers choose placement heuristics that meet their performance goals for the lowest possible infrastructure cost. Existing heuristics are classified according to a number of properties. The inherent cost (lower bound) for each class of heuristics is obtained for given system, workload and performance goals. The system designer compares different classes of heuristics on the basis of these lower bounds. Experimental results show that choosing a heuristic with the proposed methodology results in up to 7 times lower cost compared to using an "obvious" heuristic, such as caching.