Benefit based cache data placement and update for mobile peer to peer networks

Authors:
Fan Ye;Qing Li;Enhong Chen
Affiliations:
School of Computer Science and Technology, University of Science and Technology of China, Hefei, China and Web Service, Joint Research Lab of Excellence, CityU-USTC Advanced Research Institute, Su ...;Web Service, Joint Research Lab of Excellence, CityU-USTC Advanced Research Institute, Suzhou, China and Department of Computer Science, City University of Hong Kong, Hong Kong, China;School of Computer Science and Technology, University of Science and Technology of China, Hefei, China and Web Service, Joint Research Lab of Excellence, CityU-USTC Advanced Research Institute, Su ...
Venue:
World Wide Web
Year:
2011

Citing 14
Cited 1

The cache location problem

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
A hybrid motion prediction method for caching and prefetching in distributed virtual environments

VRST '01 Proceedings of the ACM symposium on Virtual reality software and technology
A multi-server architecture for distributed virtual walkthrough

VRST '02 Proceedings of the ACM symposium on Virtual reality software and technology
Steiner-Optimal Data Replication in Tree Networks with Storage Costs

IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Simpler and better approximation algorithms for network design

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Supporting Cooperative Caching in Ad Hoc Networks

IEEE Transactions on Mobile Computing
The hardness of cache conscious data placement

Nordic Journal of Computing
Efficient cache placement in multi-hop wireless networks

IEEE/ACM Transactions on Networking (TON)
Benefit-Based Data Caching in Ad Hoc Networks

IEEE Transactions on Mobile Computing
Adaptive caching with heterogeneous devices in mobile peer to peer network

Proceedings of the 2008 ACM symposium on Applied computing
VSculpt: a distributed virtual sculpting environment for collaborative design

IEEE Transactions on Multimedia
An O(pn2) algorithm for the p -median and related problems on tree graphs

Operations Research Letters

Advances in ubiquitous media technologies and applications

World Wide Web

Quantified Score

Hi-index	0.00

Visualization

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.