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.

Distributed Content Backup and Sharing using Social Information / Jiang, Jin; Casetti, CLAUDIO ETTORE - In: Networking 2012, Lecture Notes in Computer Science / Robert Bestak , Lukas Kencl , Li Erran Li , Joerg Widmer and Hao Yin. - STAMPA. - Berlin, Heidelberg, New York : SPRINGER, 2012. - ISBN 9783642300448. - pp. 68-81 [10.1007/978-3-642-30045-5]

Distributed Content Backup and Sharing using Social Information

JIANG, JIN;CASETTI, CLAUDIO ETTORE
2012

Abstract

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.
2012
9783642300448
Networking 2012, Lecture Notes in Computer Science
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2499590
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo