Distributed Content Backup and Sharing Using Social Information - NETWORKING 2012 Access content directly
Conference Papers Year : 2012

Distributed Content Backup and Sharing Using Social Information


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.
Fichier principal
Vignette du fichier
978-3-642-30045-5_6_Chapter.pdf (745.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01531125 , version 1 (01-06-2017)





Jin Jiang, Claudio E. Casetti. Distributed Content Backup and Sharing Using Social Information. 11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.68-81, ⟨10.1007/978-3-642-30045-5_6⟩. ⟨hal-01531125⟩
84 View
55 Download



Gmail Facebook X LinkedIn More