Parisa Hassanzadeh, A. Tulino, J. Llorca, E. Erkip
{"title":"缓存和传递相关源的内存率权衡","authors":"Parisa Hassanzadeh, A. Tulino, J. Llorca, E. Erkip","doi":"10.1109/SARNOF.2016.7846729","DOIUrl":null,"url":null,"abstract":"In cache-aided networks, due to the multicast nature of wireless signals, coded multicast delivery results in significant load reductions that are proportional to the aggregate cache size. State of the art caching schemes exploit exact content reuse across the network, which, due to the personalized nature of the content consumed by users, can lead to limited efficiency of the scheme. In this work, the cache-aided coded multicast setting is extended to specifically exploit the correlation among the content files. The load over the shared link is notably reduced by jointly compressing the content during the caching and delivery phases. Two classes of correlation-aware achievable schemes are proposed, both of which are shown to significantly outperform existing correlation-unaware solutions, while approaching the limiting rate-memory trade-off.","PeriodicalId":137948,"journal":{"name":"2016 IEEE 37th Sarnoff Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Memory-rate trade-off for caching and delivery of correlated sources\",\"authors\":\"Parisa Hassanzadeh, A. Tulino, J. Llorca, E. Erkip\",\"doi\":\"10.1109/SARNOF.2016.7846729\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In cache-aided networks, due to the multicast nature of wireless signals, coded multicast delivery results in significant load reductions that are proportional to the aggregate cache size. State of the art caching schemes exploit exact content reuse across the network, which, due to the personalized nature of the content consumed by users, can lead to limited efficiency of the scheme. In this work, the cache-aided coded multicast setting is extended to specifically exploit the correlation among the content files. The load over the shared link is notably reduced by jointly compressing the content during the caching and delivery phases. Two classes of correlation-aware achievable schemes are proposed, both of which are shown to significantly outperform existing correlation-unaware solutions, while approaching the limiting rate-memory trade-off.\",\"PeriodicalId\":137948,\"journal\":{\"name\":\"2016 IEEE 37th Sarnoff Symposium\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE 37th Sarnoff Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SARNOF.2016.7846729\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE 37th Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2016.7846729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Memory-rate trade-off for caching and delivery of correlated sources
In cache-aided networks, due to the multicast nature of wireless signals, coded multicast delivery results in significant load reductions that are proportional to the aggregate cache size. State of the art caching schemes exploit exact content reuse across the network, which, due to the personalized nature of the content consumed by users, can lead to limited efficiency of the scheme. In this work, the cache-aided coded multicast setting is extended to specifically exploit the correlation among the content files. The load over the shared link is notably reduced by jointly compressing the content during the caching and delivery phases. Two classes of correlation-aware achievable schemes are proposed, both of which are shown to significantly outperform existing correlation-unaware solutions, while approaching the limiting rate-memory trade-off.