基于无线多播和协同缓存的VoD服务的最佳缓存布局

Hao Feng, Zhiyong Chen, Hui Liu, Dongwei Wang
{"title":"基于无线多播和协同缓存的VoD服务的最佳缓存布局","authors":"Hao Feng, Zhiyong Chen, Hui Liu, Dongwei Wang","doi":"10.1109/WCNC.2018.8377128","DOIUrl":null,"url":null,"abstract":"Wireless multicast and client caching are two promising approaches to provide scalable video-on-demand (VoD) services. In this paper, we consider VoD services with client pre-caching under asynchronous requests, where a client request watches the desired video from the beginning to the end. A requesting client can retrieve the data of the requested video from its local cache, other clients it meets via device-to-device (D2D) communication, and the BS multicast transmission. Under this model, we optimize the cache placement to minimize the average traffic rate of BS transmission by the optimal exploitation of BS multicast and cooperative caching. Specifically, we first formulate the cache placement problem into a separable concave minimization problem with convex constraints, which can be solved via convex underestimation and branch bound, where the global optimality is achieved at the cost of a very high computational complexity. To reduce the complexity, we further adopt the difference of convex algorithm. Moreover, two special cases are investigated, i.e., without D2D communication and without BS multicast. Simulation results verify the effectiveness of the proposed scheme which combines BS multicast and cooperative caching.","PeriodicalId":360054,"journal":{"name":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal cache placement for VoD services with wireless multicast and cooperative caching\",\"authors\":\"Hao Feng, Zhiyong Chen, Hui Liu, Dongwei Wang\",\"doi\":\"10.1109/WCNC.2018.8377128\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless multicast and client caching are two promising approaches to provide scalable video-on-demand (VoD) services. In this paper, we consider VoD services with client pre-caching under asynchronous requests, where a client request watches the desired video from the beginning to the end. A requesting client can retrieve the data of the requested video from its local cache, other clients it meets via device-to-device (D2D) communication, and the BS multicast transmission. Under this model, we optimize the cache placement to minimize the average traffic rate of BS transmission by the optimal exploitation of BS multicast and cooperative caching. Specifically, we first formulate the cache placement problem into a separable concave minimization problem with convex constraints, which can be solved via convex underestimation and branch bound, where the global optimality is achieved at the cost of a very high computational complexity. To reduce the complexity, we further adopt the difference of convex algorithm. Moreover, two special cases are investigated, i.e., without D2D communication and without BS multicast. Simulation results verify the effectiveness of the proposed scheme which combines BS multicast and cooperative caching.\",\"PeriodicalId\":360054,\"journal\":{\"name\":\"2018 IEEE Wireless Communications and Networking Conference (WCNC)\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Wireless Communications and Networking Conference (WCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2018.8377128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2018.8377128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

无线多播和客户端缓存是提供可扩展视频点播(VoD)服务的两种很有前途的方法。在本文中,我们考虑在异步请求下具有客户端预缓存的视频点播服务,其中客户端请求从头到尾观看所需的视频。请求客户端可以从其本地缓存中检索请求视频的数据,通过设备对设备(D2D)通信和BS多播传输与其他客户端相遇。在该模型下,我们通过优化利用BS组播和协作缓存,优化缓存布局,使BS传输的平均流量最小。具体而言,我们首先将缓存放置问题表述为具有凸约束的可分离凹最小化问题,该问题可以通过凸低估和分支界来解决,其中全局最优性是以非常高的计算复杂度为代价实现的。为了降低复杂度,我们进一步采用了差分凸算法。此外,还研究了无D2D通信和无BS组播两种特殊情况。仿真结果验证了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal cache placement for VoD services with wireless multicast and cooperative caching
Wireless multicast and client caching are two promising approaches to provide scalable video-on-demand (VoD) services. In this paper, we consider VoD services with client pre-caching under asynchronous requests, where a client request watches the desired video from the beginning to the end. A requesting client can retrieve the data of the requested video from its local cache, other clients it meets via device-to-device (D2D) communication, and the BS multicast transmission. Under this model, we optimize the cache placement to minimize the average traffic rate of BS transmission by the optimal exploitation of BS multicast and cooperative caching. Specifically, we first formulate the cache placement problem into a separable concave minimization problem with convex constraints, which can be solved via convex underestimation and branch bound, where the global optimality is achieved at the cost of a very high computational complexity. To reduce the complexity, we further adopt the difference of convex algorithm. Moreover, two special cases are investigated, i.e., without D2D communication and without BS multicast. Simulation results verify the effectiveness of the proposed scheme which combines BS multicast and cooperative caching.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信