Benefit based cache data placement and update for Mobile Peer to Peer networks

Fan Ye, Qing Li, Enhong Chen

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (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 our paper, we propose an effective and low cost cache placement strategy combined with an update scheme which can be easily implemented in a decentralized way. Extensive experiments are conducted to demonstrate the efficiency of the cache placement and update scheme.

Original languageEnglish
Title of host publication2010 3rd IEEE International Conference on Ubi-Media Computing, U-Media 2010
Pages50-57
Number of pages8
DOIs
Publication statusPublished - 20 Sep 2010
Externally publishedYes
Event2010 3rd IEEE International Conference on Ubi-Media Computing, U-Media 2010 - Jinhua, China
Duration: 5 Jul 20106 Jul 2010

Publication series

Name2010 3rd IEEE International Conference on Ubi-Media Computing, U-Media 2010

Conference

Conference2010 3rd IEEE International Conference on Ubi-Media Computing, U-Media 2010
CountryChina
CityJinhua
Period5/07/106/07/10

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this