基于社会感知网关的内容共享和备份

Jin Jiang, C. Casetti
{"title":"基于社会感知网关的内容共享和备份","authors":"Jin Jiang, C. Casetti","doi":"10.1145/2018567.2018582","DOIUrl":null,"url":null,"abstract":"The amount of data that home users generate, store, and share with their friends via a multitude of devices has grown significantly in the past few years. In our paper, we assume that every household is equipped with a home gateway that stores and manages the data collected by the home users. To accelerate the content sharing and backup for such users, we propose an efficient backup scheme that hinges upon gateway interactions exploiting the users' social networking in- formation. We formulate this problem as a Budgeted Maximum Coverage (BMC) problem and we numerically compute the optimal content backup solution under a synthetic social network scenario. Then, we compare it with two different content placement strategies for gateways with various quota sizes, in a realistic synthetic social network.","PeriodicalId":301655,"journal":{"name":"HomeNets '11","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Socially-aware gateway-based content sharing and backup\",\"authors\":\"Jin Jiang, C. Casetti\",\"doi\":\"10.1145/2018567.2018582\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The amount of data that home users generate, store, and share with their friends via a multitude of devices has grown significantly in the past few years. In our paper, we assume that every household is equipped with a home gateway that stores and manages the data collected by the home users. To accelerate the content sharing and backup for such users, we propose an efficient backup scheme that hinges upon gateway interactions exploiting the users' social networking in- formation. We formulate this problem as a Budgeted Maximum Coverage (BMC) problem and we numerically compute the optimal content backup solution under a synthetic social network scenario. Then, we compare it with two different content placement strategies for gateways with various quota sizes, in a realistic synthetic social network.\",\"PeriodicalId\":301655,\"journal\":{\"name\":\"HomeNets '11\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"HomeNets '11\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2018567.2018582\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"HomeNets '11","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2018567.2018582","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

家庭用户通过各种设备生成、存储和与朋友分享的数据量在过去几年中显著增长。在本文中,我们假设每个家庭都配备了一个家庭网关,用于存储和管理家庭用户收集的数据。为了加速此类用户的内容共享和备份,我们提出了一种基于网关交互的高效备份方案,该方案利用用户的社交网络信息。我们将此问题表述为预算最大覆盖(BMC)问题,并在合成社交网络场景下数值计算最佳内容备份解决方案。然后,我们将其与现实合成社交网络中具有不同配额大小的网关的两种不同内容放置策略进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Socially-aware gateway-based content sharing and backup
The amount of data that home users generate, store, and share with their friends via a multitude of devices has grown significantly in the past few years. In our paper, we assume that every household is equipped with a home gateway that stores and manages the data collected by the home users. To accelerate the content sharing and backup for such users, we propose an efficient backup scheme that hinges upon gateway interactions exploiting the users' social networking in- formation. We formulate this problem as a Budgeted Maximum Coverage (BMC) problem and we numerically compute the optimal content backup solution under a synthetic social network scenario. Then, we compare it with two different content placement strategies for gateways with various quota sizes, in a realistic synthetic social network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Trouble shooting interactive web sessions in a home environment Analyzing IPTV set-top box crashes Uplink traffic control in home 802.11 wireless networks Coordinated architecture for wireless home networks Argumentation-based fault diagnosis for home networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1