Kai Wan, Daniela Tuninetti, Mingyue Ji, P. Piantanida
{"title":"最先进的缓存辅助组合网络","authors":"Kai Wan, Daniela Tuninetti, Mingyue Ji, P. Piantanida","doi":"10.1109/ACSSC.2017.8335420","DOIUrl":null,"url":null,"abstract":"Caching is an effective approach to smooth out network traffic by storing some content in users' local memories during off-peak hours, which can be used to reduce the required number of transmissions during peak-traffic hours. This paper reviews recent advances on cache-aided relay networks, in particular for combination networks, which has a specific symmetric network topology. Two approaches exist for relay networks with end-user caches, depending on whether the generation of the multicast messages for the delivery phase is independent of the network topology. We review state-of-the-art schemes by categorizing them according to one of these two approaches. We also discuss their optimality (exact or to within a multiplicative factor).","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"State-of-the-art in cache-aided combination networks\",\"authors\":\"Kai Wan, Daniela Tuninetti, Mingyue Ji, P. Piantanida\",\"doi\":\"10.1109/ACSSC.2017.8335420\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Caching is an effective approach to smooth out network traffic by storing some content in users' local memories during off-peak hours, which can be used to reduce the required number of transmissions during peak-traffic hours. This paper reviews recent advances on cache-aided relay networks, in particular for combination networks, which has a specific symmetric network topology. Two approaches exist for relay networks with end-user caches, depending on whether the generation of the multicast messages for the delivery phase is independent of the network topology. We review state-of-the-art schemes by categorizing them according to one of these two approaches. We also discuss their optimality (exact or to within a multiplicative factor).\",\"PeriodicalId\":296208,\"journal\":{\"name\":\"2017 51st Asilomar Conference on Signals, Systems, and Computers\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 51st Asilomar Conference on Signals, Systems, and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2017.8335420\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 51st Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2017.8335420","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
State-of-the-art in cache-aided combination networks
Caching is an effective approach to smooth out network traffic by storing some content in users' local memories during off-peak hours, which can be used to reduce the required number of transmissions during peak-traffic hours. This paper reviews recent advances on cache-aided relay networks, in particular for combination networks, which has a specific symmetric network topology. Two approaches exist for relay networks with end-user caches, depending on whether the generation of the multicast messages for the delivery phase is independent of the network topology. We review state-of-the-art schemes by categorizing them according to one of these two approaches. We also discuss their optimality (exact or to within a multiplicative factor).