Distributed Content Backup and Sharing Using Social Information

  • Jin Jiang
  • Claudio E. Casetti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7289)


This paper addresses the need for content sharing and backup in household equipped with a home gateway that stores, tags and manages the data collected by the home users. Our solution leverages the interaction between remote gateways in a social way, i.e., by exploiting the users’ social networking information, so that backup recipients are those gateways whose users are most likely to be interested in accessing the shared content. We formulate this problem as a Budgeted Maximum Coverage (BMC) problem and we numerically compute the optimal content backup solution. We then propose a low-complexity, distributed heuristic algorithm and use simulation in a synthetic social network scenario to show that the final content placement among “friendly” gateways well approximates the optimal solution under different network settings.


Content sharing social networks federated homes 


  1. 1.
    The FIGARO FP7 ICT project,
  2. 2.
    Defrance, S., Gendrot, R., Le Roux, J., Straub, G., Tapie, T.: Home Networking as a Distributed File System View. In: HomeNets (August 2011)Google Scholar
  3. 3.
    Backstrom, L., Sun, E., Marlow, C.: Find me if you can: improving geographical prediction with social and spatial proximity. In: 19th ACM WWW (April 2010)Google Scholar
  4. 4.
    Belaramani, N., Dahlin, M., Gao, L., Nayate, A., Venkataramani, A., Yalagandula, P., Zheng, J.: PRACTI replication. In: USENIX Symposium on Networked Systems Design and Implementation (NSDI) (May 2006)Google Scholar
  5. 5.
    Ramasubramanian, V., Rodeheffer, T., Terry, D., Walraed-Sullivan, M., Wobber, T., Marshall, C., Vahdat, A.: Cimbiosys: A platform for content-based partial replication. In: NSDI (August 2009)Google Scholar
  6. 6.
    Post, A., Kuznetsov, P., Druschel, P.: PodBase: Transparent storage management for personal devices. In: USENIX International Workshop on Peer-to-peer Systems (February 2008)Google Scholar
  7. 7.
    Boldrini, C., Conti, M., Passarella, A.: ContentPlace: social-aware data dissemination in opportunistic networks. In: ACM MSWiM 2008. ACM (October 2008)Google Scholar
  8. 8.
    Jaho, E., Stavrakakis, I.: Joint interest-and locality-aware content dissemination in social networks. In: IEEE/IFIP WONS 2009 (February 2009)Google Scholar
  9. 9.
    Pantazopoulos, P., Stavrakakis, I., Passarella, A., Conti, M.: Efficient Social-aware Content Placement in Opportunistic Networks. In: IEEE/IFIP WONS 2010 (February 2010)Google Scholar
  10. 10.
    Jiang, J., Casetti, C.: Socially-aware Gateway-based Content Sharing and Backup. In: HomeNets (August 2011)Google Scholar
  11. 11.
    Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Information Processing Letters 70(1), 39–45 (1999)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.

Copyright information

© IFIP International Federation for Information Processing 2012

Authors and Affiliations

  • Jin Jiang
    • 1
  • Claudio E. Casetti
    • 1
  1. 1.Dipartimento di Elettronica e TelecomunicazioniPolitecnico di TorinoItaly

Personalised recommendations