{"title":"基于异构用户配置文件的编码缓存平均速率研究","authors":"Ciyuan Zhang, B. Peleato","doi":"10.1109/ICC40277.2020.9148779","DOIUrl":null,"url":null,"abstract":"Coded caching utilizes pre-fetching during off-peak hours and multi-casting for delivery in order to balance the traffic load in communication networks. Most of the existing research focuses on reducing the peak transmission rates with homogeneous file popularities, despite modern systems are often able to categorize users by their preferences and tend to care more about the average rather than peak rate. This paper considers a scenario with heterogeneous user profiles and analyzes the average transmission rates for three coded caching schemes under the assumption that each user can only request a subset of the total available files. In addition, it evaluates the average rate of the three schemes when the number of files is much larger than the number of users and the amount of cache memory. Furthermore, it proposes methods of cache allocations which minimize the average rate when the users have relatively small storage. Our results demonstrate connections between cache distributions which result in minimal average rate and peak rate.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"On the Average Rate for Coded Caching with Heterogeneous User Profiles\",\"authors\":\"Ciyuan Zhang, B. Peleato\",\"doi\":\"10.1109/ICC40277.2020.9148779\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coded caching utilizes pre-fetching during off-peak hours and multi-casting for delivery in order to balance the traffic load in communication networks. Most of the existing research focuses on reducing the peak transmission rates with homogeneous file popularities, despite modern systems are often able to categorize users by their preferences and tend to care more about the average rather than peak rate. This paper considers a scenario with heterogeneous user profiles and analyzes the average transmission rates for three coded caching schemes under the assumption that each user can only request a subset of the total available files. In addition, it evaluates the average rate of the three schemes when the number of files is much larger than the number of users and the amount of cache memory. Furthermore, it proposes methods of cache allocations which minimize the average rate when the users have relatively small storage. Our results demonstrate connections between cache distributions which result in minimal average rate and peak rate.\",\"PeriodicalId\":106560,\"journal\":{\"name\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"volume\":\"102 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC40277.2020.9148779\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC40277.2020.9148779","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Average Rate for Coded Caching with Heterogeneous User Profiles
Coded caching utilizes pre-fetching during off-peak hours and multi-casting for delivery in order to balance the traffic load in communication networks. Most of the existing research focuses on reducing the peak transmission rates with homogeneous file popularities, despite modern systems are often able to categorize users by their preferences and tend to care more about the average rather than peak rate. This paper considers a scenario with heterogeneous user profiles and analyzes the average transmission rates for three coded caching schemes under the assumption that each user can only request a subset of the total available files. In addition, it evaluates the average rate of the three schemes when the number of files is much larger than the number of users and the amount of cache memory. Furthermore, it proposes methods of cache allocations which minimize the average rate when the users have relatively small storage. Our results demonstrate connections between cache distributions which result in minimal average rate and peak rate.