Abstract
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a local cache and share it with other users they meet, e.g., via Bluetooth or WiFi. The storage capacity of mobile devices is typically limited; therefore, identifying which content a user should store in her cache is a fundamental problem in the operation of any such content distribution system.
In this work we propose Psephos, a novel mechanism for determining the caching policy of each mobile user. Psephos is fully distributed: users compute their own policies individually, in the absence of a central authority. Moreover, it is designed for a heterogeneous environment, in which demand for content, access to resources, and mobility characteristics may vary across different users. Most importantly, the caching policies computed by our mechanism are optimal: we show that Psephos maximizes the system’s social welfare. To the best of our knowledge, our work is the first to address caching with heterogeneity in a fully distributed manner.
This is a preview of subscription content, log in via an institution to check access.
Notes
From \(\psi\eta\hspace*{-0.5mm}'\varphi o\varsigma\), the Greek word for “pebble”. Pebbles were used in ancient Greece as ballots during elections.
References
Altman, E., Nain, P., Bermond, J.C.: Distributed storage managements of evolving files in delay tolerant ad hoc networks. In: IEEE INFOCOM (2009)
Altman, E., Pellegrini, F.D., Miorandi, D., Neglia, G.: Decentralized stochastic control of delay tolerant networks. In: IEEE INFOCOM (2009)
Borkar, V.S.: Stochastic Approximation: A Dynamical Systems Viewpoint. Cambridge University Press, Cambridge (2008)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Chaintreau, A., Boudec, J.Y.L., Ristanovic, N.: The age of gossip: spatial mean-field regime. In: ACM SIGMETRICS (2009)
Costa, P., Mascolo, C., Musolesi, M., Picco, G.: Socially-aware routing for publish-subscribe in delay-tolerant mobile ad hoc networks. IEEE J. Sel. Areas Commun. 26(5), 748–760 (2008)
Gunawardena, D., Karagiannis, T., Proutiere, A., Santos-Neto, E., Vojnovic, M.: Scoop: Decentralized and opportunistic multicasting of information streams. In: ACM MobiCom (2011)
Guo, S., Keshav, S.: Fair and efficient scheduling in data ferrying networks. In: ACM CoNEXT (2007)
Ioannidis, S., Chaintreau, A., Massoulié, L.: Optimal and scalable distribution of content updates over a mobile social network. In: IEEE INFOCOM (2009)
Isaacman, S., Martonosi, M.: Potential for collaborative caching and prefetching in largely-disconneced villages. In: Wireless Networks and Systems for Developing Regions Workshop (2008)
Lenders, V., May, M., Karlsson, G.: Wireless ad hoc podcasting. In: IEEE SECON (2007)
Papadopouli, M., Schulzrinne, H.: Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices. In: ACM MobiHoc (2001)
Reich, J., Chaintreau, A.: The age of impatience: Optimal replication schemes for opportunistic networks. In: ACM CoNext (2009)
Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1996)
Yoneki, E., Hui, P., Chan, S., Crowcroft, J.: A socio-aware overlay for pub/sub communication in DTN. In: ACM MSWiM (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
An earlier version of this work appeared at the ACM Sigmetrics 2010 conference.
Rights and permissions
About this article
Cite this article
Ioannidis, S., Massoulié, L. & Chaintreau, A. Distributed caching over heterogeneous mobile networks. Queueing Syst 72, 279–309 (2012). https://doi.org/10.1007/s11134-012-9297-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11134-012-9297-7