Asma Ghorbel, Apostolos Destounis, M. Kobayashi, G. Paschos
{"title":"An Efficient Fair Content Delivery Scheme for Coded Caching","authors":"Asma Ghorbel, Apostolos Destounis, M. Kobayashi, G. Paschos","doi":"10.1109/ISWCS.2018.8491050","DOIUrl":null,"url":null,"abstract":"Coded caching has emerged as one of the promising solutions to deal with an exponentially increasing video traffic. This breakthrough builds on a careful design of file placement such that the total transmission time is minimized by multicasting sub-files simultaneously useful to many users. A number of follow-up works recently studied the extension of coded caching, initially assuming a perfect bottleneck link, to practical wireless channels. However, most of existing works address either the scalability of the cached wireless networks by assuming that each user requests a single file or the dynamic arrival of user requests by ignoring the scalability. In this work, we propose a low-complexity gradient- based scheduling that exploits multicast opportunities offered by coded caching, while keeping a number of multicast groups linear in the number of users. Simulation results illustrate that the proposed algorithm outperforms both coded caching and opportunistic scheduling over time-varying fading channels.","PeriodicalId":272951,"journal":{"name":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 15th International Symposium on Wireless Communication Systems (ISWCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2018.8491050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Coded caching has emerged as one of the promising solutions to deal with an exponentially increasing video traffic. This breakthrough builds on a careful design of file placement such that the total transmission time is minimized by multicasting sub-files simultaneously useful to many users. A number of follow-up works recently studied the extension of coded caching, initially assuming a perfect bottleneck link, to practical wireless channels. However, most of existing works address either the scalability of the cached wireless networks by assuming that each user requests a single file or the dynamic arrival of user requests by ignoring the scalability. In this work, we propose a low-complexity gradient- based scheduling that exploits multicast opportunities offered by coded caching, while keeping a number of multicast groups linear in the number of users. Simulation results illustrate that the proposed algorithm outperforms both coded caching and opportunistic scheduling over time-varying fading channels.