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

F. Ye, Qing Li, E. Chen

Research output: Journal article publicationJournal articleAcademic researchpeer-review

7 Citations (Scopus)

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. © 2010 Springer Science+Business Media, LLC.
Original languageEnglish
Pages (from-to)243-259
Number of pages17
JournalWorld Wide Web
Volume14
Issue number3
DOIs
Publication statusPublished - 1 May 2011
Externally publishedYes

Keywords

  • benefit based
  • cache placement
  • cache update
  • mobile data cache

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this