On Data Caching for Mobile Clouds

Recent advances in smart device technologies have enabled a new computing paradigm in which large amounts of data are stored and processed on mobile devices. Despite the available powerful hardware, the actual capabilities of mobile devices are rather limited as they are often battery powered. This paper explores data caching for k-out-of-n computing in mobile cloud environments, with the goal of distributing data in a way that the expected future energy consumption for nodes to retrieve data is minimized, while preserving reliability. More specifically, we propose to place data caches (in addition to the originally stored data) based on the actual data access patterns and the network topology. Consequently, we formulate the cache placement optimization problem and propose a centralized caching framework that optimally solves the problem and a distributed solution that approximates the optimal solution. The distributed caching framework (DC) learns data access patterns by sniffing packets and informing a resident cache daemon about popular data items. Extensive evaluations are carried out through both simulations and a proof-of-concept hardware implementation. The results show that our proposed DC effectively improves the energy efficiency by up to 70% when compared with a no-caching framework, and even outperforms the centralized framework when taking the overhead into account.

[1]  Chi-Yin Chow,et al.  Cache signatures for peer-to-peer cooperative caching in mobile environments , 2004, 18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004..

[2]  Rajmohan Rajaraman,et al.  Approximation algorithms for data placement in arbitrary networks , 2001, SODA '01.

[3]  Lawrence W. Dowdy,et al.  Comparative Models of the File Assignment Problem , 1982, CSUR.

[4]  Geoffrey G. Xie,et al.  Energy-efficient fault-tolerant data storage & processing in dynamic networks , 2013, MobiHoc.

[5]  Jaroslaw Byrka An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2007, APPROX-RANDOM.

[6]  Wei Zhou,et al.  DistressNet: a wireless ad hoc and sensor network architecture for situation management in disaster response , 2010, IEEE Communications Magazine.

[7]  Chi-Yin Chow,et al.  Group-based cooperative cache management for mobile clients in a mobile environment , 2004 .

[8]  Kannan Ramchandran,et al.  Network Coding for Distributed Storage in Wireless Networks , 2008 .

[9]  Sandeep K. S. Gupta,et al.  Improving on-demand data access efficiency in MANETs with cooperative caching , 2009, Ad Hoc Networks.

[10]  Takahiro Hara Quantifying Impact of Mobility on Data Availability in Mobile Ad Hoc Networks , 2010, IEEE Transactions on Mobile Computing.

[11]  Bin Tang,et al.  Benefit-based Data Caching in Ad Hoc Networks , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[12]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[13]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[14]  Geoffrey G. Xie,et al.  Resource Allocation for Energy Efficient k-out-of-n System in Mobile Ad Hoc Networks , 2013, 2013 22nd International Conference on Computer Communication and Networks (ICCCN).

[15]  C Rajabhushanam,et al.  Survey of Wireless MANET Application in Battlefield Operations , 2011 .

[16]  Vinod M. Prabhakaran,et al.  Decentralized erasure codes for distributed networked storage , 2006, IEEE Transactions on Information Theory.

[17]  Antony I. T. Rowstron,et al.  Squirrel: a decentralized peer-to-peer web cache , 2002, PODC '02.

[18]  Chi-Yin Chow,et al.  Group-based cooperative cache management for mobile clients in a mobile environment , 2004, International Conference on Parallel Processing, 2004. ICPP 2004..

[19]  Jaroslaw Byrka,et al.  An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem , 2006, SIAM J. Comput..

[20]  Suman Banerjee,et al.  An ensemble of replication and erasure codes for cloud file systems , 2013, 2013 Proceedings IEEE INFOCOM.

[21]  Robert Beverly,et al.  Building and evaluating a k-resilient mobile distributed file system resistant to device compromise , 2011, 2011 - MILCOM 2011 Military Communications Conference.

[22]  Chaitanya Swamy,et al.  Approximation Algorithms for Data Placement Problems , 2008, SIAM J. Comput..

[23]  Kay A. Robbins,et al.  A viability analysis of cooperative proxy caching , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[24]  Guohong Cao,et al.  Supporting cooperative caching in ad hoc networks , 2004, IEEE Transactions on Mobile Computing.

[25]  Yunnan Wu,et al.  A Survey on Network Codes for Distributed Storage , 2010, Proceedings of the IEEE.

[26]  Shudong Jin,et al.  Content and service replication strategies in multi-hop wireless mesh networks , 2005, MSWiM '05.