On-line caching as cache size varies
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for data placement in arbitrary networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Energy-efficient caching strategies in ad hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Replica allocation methods in ad hoc networks with data update
Mobile Networks and Applications
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Energy-conserving data placement and asynchronous multicast in wireless sensor networks
Proceedings of the 1st international conference on Mobile systems, applications and services
Cost-aware WWW proxy caching algorithms
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Design and analysis of an adaptive object replication algorithm in distributed network systems
Computer Communications
A queueing approach to optimal resource replication in wireless sensor networks
Performance Evaluation
Performance evaluations of data-centric information retrieval schemes for DTNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Integrating caching techniques on a content distribution network
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
A content replication scheme for wireless mesh networks
Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video
Document replication strategies for geographically distributed web search engines
Information Processing and Management: an International Journal
Job scheduling and dynamic data replication in data grid environment
The Journal of Supercomputing
Exploiting graph partitioning for hierarchical replica placement in WMNs
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
A divide-and-conquer approach for content replication in WMNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
MORM: A Multi-objective Optimized Replication Management strategy for cloud storage cluster
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.01 |
Emerging multi-hop wireless mesh networks have much different characteristics than the Internet. They have low dimensionality and large diameters. Content and service replication can greatly improve their scalability. However, replication strategies in such networks have not been well studied. This paper studies the optimality of replication strategies and explores it in multi-hop wireless mesh networks for the first time. We start with the problem of determining the optimal numbers of replicas for a set of objects which have distinct probabilities of being requested in large 2-D mesh networks. We reveal the structure of the optimal replication strategy to minimize object access cost. To minimize average cost to access an object in 2-D mesh networks, the optimal strategy replicates an object such that the number of its replicas is proportional to p0.667, where p is the access probability of the object. This result indicates the inefficiency of demand-driven content and service replication in 2-D mesh networks, where an object is replicated such that the number of its replicas is proportional to p. We further study practical, online algorithms to approximate the optimal strategy. Interestingly, the optimal replication can be approximated well by a localized replacement algorithm. The algorithm utilizes only handy information and incurs no communication overhead. The paper demonstrates a significant performance gain by the optimal strategy, and the effectiveness of the online replacement algorithm.