Queueing Systems

, Volume 72, Issue 3–4, pp 279–309 | Cite as

Distributed caching over heterogeneous mobile networks

  • Stratis Ioannidis
  • Laurent Massoulié
  • Augustin Chaintreau


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.


Distributed caching Heterogeneity Mobile networks Content distribution 

Mathematics Subject Classification

60K20 68M10 68M14 


  1. 1.
    Altman, E., Nain, P., Bermond, J.C.: Distributed storage managements of evolving files in delay tolerant ad hoc networks. In: IEEE INFOCOM (2009) Google Scholar
  2. 2.
    Altman, E., Pellegrini, F.D., Miorandi, D., Neglia, G.: Decentralized stochastic control of delay tolerant networks. In: IEEE INFOCOM (2009) Google Scholar
  3. 3.
    Borkar, V.S.: Stochastic Approximation: A Dynamical Systems Viewpoint. Cambridge University Press, Cambridge (2008) Google Scholar
  4. 4.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004) Google Scholar
  5. 5.
    Chaintreau, A., Boudec, J.Y.L., Ristanovic, N.: The age of gossip: spatial mean-field regime. In: ACM SIGMETRICS (2009) Google Scholar
  6. 6.
    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) CrossRefGoogle Scholar
  7. 7.
    Gunawardena, D., Karagiannis, T., Proutiere, A., Santos-Neto, E., Vojnovic, M.: Scoop: Decentralized and opportunistic multicasting of information streams. In: ACM MobiCom (2011) Google Scholar
  8. 8.
    Guo, S., Keshav, S.: Fair and efficient scheduling in data ferrying networks. In: ACM CoNEXT (2007) Google Scholar
  9. 9.
    Ioannidis, S., Chaintreau, A., Massoulié, L.: Optimal and scalable distribution of content updates over a mobile social network. In: IEEE INFOCOM (2009) Google Scholar
  10. 10.
    Isaacman, S., Martonosi, M.: Potential for collaborative caching and prefetching in largely-disconneced villages. In: Wireless Networks and Systems for Developing Regions Workshop (2008) Google Scholar
  11. 11.
    Lenders, V., May, M., Karlsson, G.: Wireless ad hoc podcasting. In: IEEE SECON (2007) Google Scholar
  12. 12.
    Papadopouli, M., Schulzrinne, H.: Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices. In: ACM MobiHoc (2001) Google Scholar
  13. 13.
    Reich, J., Chaintreau, A.: The age of impatience: Optimal replication schemes for opportunistic networks. In: ACM CoNext (2009) Google Scholar
  14. 14.
    Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1996) Google Scholar
  15. 15.
    Yoneki, E., Hui, P., Chan, S., Crowcroft, J.: A socio-aware overlay for pub/sub communication in DTN. In: ACM MSWiM (2007) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Stratis Ioannidis
    • 1
  • Laurent Massoulié
    • 2
  • Augustin Chaintreau
    • 3
  1. 1.TechnicolorPalo AltoUSA
  2. 2.TechnicolorParisFrance
  3. 3.Columbia UniversityNew YorkUSA

Personalised recommendations