%0 Conference Proceedings
%T Distributed Content Backup and Sharing Using Social Information
%+ Dipartimento di Elettronica e Telecomunicazioni [Torino] (DET)
%A Jiang, Jin
%A Casetti, Claudio, E.
%Z Part 2: Social Networks
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 11th International Networking Conference (NETWORKING)
%C Prague, Czech Republic
%Y Robert Bestak
%Y Lukas Kencl
%Y Li Erran Li
%Y Joerg Widmer
%Y Hao Yin
%I Springer
%3 NETWORKING 2012
%V LNCS-7289
%N Part I
%P 68-81
%8 2012-05-21
%D 2012
%R 10.1007/978-3-642-30045-5_6
%K Content sharing
%K social networks
%K federated homes
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01531125/document
%2 https://inria.hal.science/hal-01531125/file/978-3-642-30045-5_6_Chapter.pdf
%L hal-01531125
%U https://inria.hal.science/hal-01531125
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-LNCS-7289
%~ IFIP-NETWORKING