loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers
PReCinCt: A Scheme for Cooperative Caching in Mobile Peer-to-Peer Systems
Denver, Colorado
April 04-April 08
ISBN: 0-7695-2312-9
Huaping Shen, University of Texas at Arlington
Mary Suchitha Joseph, University of Texas at Arlington
Mohan Kumar, University of Texas at Arlington
Sajal K. Das, University of Texas at Arlington
Mobile Peer-to-Peer (MP2P) systems consist of mobile peers that collaborate with each other to complete application problems. Information sharing in such environments is a challenging problem due to the fundamental limitations of battery power, wireless bandwidth, and users' frequent mobility. We proposed a novel scheme, called Proximity Regions for Caching in Cooperative MP2P Networks (PReCinCt) to efficiently support scalable data retrieval in large-scale MP2P networks. In the PReCinCt scheme, the network topology is divided into geographical regions where each region is responsible for a set of keys representing the data. In this paper, we extend the PReCinCt scheme to facilitate consistent cooperative caching in MP2P systems. The caching scheme considers data popularity, data size and region-distance during replacement to optimize cache content of peers. PReCinCt employs a hybrid push/pull mechanism to maintain data consistency among replicas in the network. Simulation results show the cost of consistency maintenance in terms of latency and energy consumption is significantly improved in the PReCinCt scheme.
Citation:
Huaping Shen, Mary Suchitha Joseph, Mohan Kumar, Sajal K. Das, "PReCinCt: A Scheme for Cooperative Caching in Mobile Peer-to-Peer Systems," ipdps, vol. 1, pp.57a, 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers, 2005
Usage of this product signifies your acceptance of the Terms of Use.