Abstract
Mobile Peer to Peer (MP2P) networks provide decentralization, self-organization, scalability characters, but suffer from high latency and link break problems. In this paper, we study the cache/replication placement and cache update problems arising in such kind of networks. While researchers have proposed various replication placement algorithms to place data across the network to address the problem, it was proven as NP-hard. As a result, many heuristic algorithms have been brought forward for solving the problem. In this article, we propose an effective and low cost cache placement strategy combined with an update scheme which can be easily implemented in a decentralized way. The contribution of this paper is the adaptive and flexible cache placement and update algorithms designed for real MP2P network usage. The combination of MP2P cache placement and update is the novelty of this article. Extensive experiments are conducted to demonstrate the efficiency of the cache placement and update scheme.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for k-median and facility location problems. Society for Industrial and Applied Mathematics. (2004)
Baev, I., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks, Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 661–670, USA, (2001)
Chan, A., Lau, R., Ng, B.: A hybrid motion prediction method for caching and prefetching in distributed virtual environments. ACM VRST 2001, pp. 135–142 (2001)
Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems, Proc. 40th IEEE Symposium on Foundations of Computer Science. 378–388 (1999)
Gupta, A., Kumar, A., Roughgarden, T.: Simpler and better approximation algorithms for network design. STOC’03, June 9–11, 2003, San Diego, California, USA
Hara, T.: Effective replica allocation in mobile P2P networks for improving data accessibility. IEEE INFOCOM (2001)
Kalpakis, K., Dasgupta, K., Wolfson, O.: Sterner-optimal data replication in tree networks with storage costs. Proc. IDEAS, (2001)
Krishnan, P., Raz, D., Shavitt, Y.: The cache location problem. IEEE/ACM Trans Networking 8(5), 568–582 (2000)
Li, W., Chan, E., Chen, D.: Energy-effective cache replacement policies for cooperative caching in mobile Ad Hoc network. Wireless Communications and Networking Conference (WCNC’07). (2007)
Li, F., Lau, R., Ng, F.: Vsculpt: A distributed virtual sculpting environment for collaborative design. IEEE Trans Multimedia 5(4), 570–580 (2003)
Ng, B., Si, A., Lau, R., Li, F.: A multi-server architecture for distributed virtual walkthrough, ACM VRST 2002. pp. 163–170, (2002)
Nuggehalli, P., Srinivasan, V., Chiasserini, C., Rao, R.R.: Efficient cache placement in multi-hop wireless networks. IEEE Transactions on Networking. 14(5): (2006)
Petrank, E., Rawitz, D.: The hardness of cache conscious data placement. Nord. J. Comput
Tamir, A.: An O(pn2) algorithms for the p-median and related problems on tree graphs. Oper. Res. Lett. 19, (1996)
Tang, B., Gupta, H., Das, S.R.: Benefit-based data caching in mobile P2P networks. IEEE Trans Mob Comput 7(3), 289–304 (2008)
Ye, F., Li, Q., Chen, E.: Adaptive caching with heterogeneous devices in mobile peer to peer network. ACM SAC’08
Yin, L., Cao, G.: Support cooperative caching in mobile P2P networks. IEEE Trans Mob Comput 5(1), 77–89 (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ye, F., Li, Q. & Chen, E. Benefit based cache data placement and update for mobile peer to peer networks. World Wide Web 14, 243–259 (2011). https://doi.org/10.1007/s11280-010-0103-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11280-010-0103-3