Guolin Sun, Hisham Al-Ward, Gordon Owusu Boateng, W. Jiang
{"title":"支持sdn的虚拟化无线D2D网络中的内容感知缓存以减少访问延迟","authors":"Guolin Sun, Hisham Al-Ward, Gordon Owusu Boateng, W. Jiang","doi":"10.1109/MASS.2018.00032","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a content-aware cache resource slicing framework in software-defined information-centric virtualized wireless device-to-device (D2D) networks. In incorporating D2D communications, we attain the benefits of reuse and proximity gains, and by using the software defined network as a platform, we simplify the computational overhead. In this framework, we devise a cache allocation solution aimed at the latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we evaluate four algorithms until we arrive at the most optimal solution. The heuristic solutions we provide are intuitive, yet efficient, and offer very low computational complexity.","PeriodicalId":146214,"journal":{"name":"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Content-Aware Caching in SDN-Enabled Virtualized Wireless D2D Networks to Reduce Visiting Latency\",\"authors\":\"Guolin Sun, Hisham Al-Ward, Gordon Owusu Boateng, W. Jiang\",\"doi\":\"10.1109/MASS.2018.00032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a content-aware cache resource slicing framework in software-defined information-centric virtualized wireless device-to-device (D2D) networks. In incorporating D2D communications, we attain the benefits of reuse and proximity gains, and by using the software defined network as a platform, we simplify the computational overhead. In this framework, we devise a cache allocation solution aimed at the latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we evaluate four algorithms until we arrive at the most optimal solution. The heuristic solutions we provide are intuitive, yet efficient, and offer very low computational complexity.\",\"PeriodicalId\":146214,\"journal\":{\"name\":\"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASS.2018.00032\",\"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 15th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASS.2018.00032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Content-Aware Caching in SDN-Enabled Virtualized Wireless D2D Networks to Reduce Visiting Latency
In this paper, we propose a content-aware cache resource slicing framework in software-defined information-centric virtualized wireless device-to-device (D2D) networks. In incorporating D2D communications, we attain the benefits of reuse and proximity gains, and by using the software defined network as a platform, we simplify the computational overhead. In this framework, we devise a cache allocation solution aimed at the latency-sensitive applications in the next-generation cellular networks. As the formulated problem is NP-hard, we evaluate four algorithms until we arrive at the most optimal solution. The heuristic solutions we provide are intuitive, yet efficient, and offer very low computational complexity.