Xiao Lin, Jia Zhang, Shengnan Yue, Yuanlong Tan, Xiaoyu Wang, Weiqiang Sun, M. Veeraraghavan, Weisheng Hu
{"title":"dc间光网络存储转发大容量传输的状态合并调度方法","authors":"Xiao Lin, Jia Zhang, Shengnan Yue, Yuanlong Tan, Xiaoyu Wang, Weiqiang Sun, M. Veeraraghavan, Weisheng Hu","doi":"10.1109/HPSR48589.2020.9098969","DOIUrl":null,"url":null,"abstract":"The time- and space-varying nature of residual bandwidth in inter-datacenter networks (inter-DCNs) makes conventional end-to-end connections difficult to fully utilize the residual bandwidth. A promising solution is to introduce datacenter storage into data-plane paths. Delay-tolerant bulk data can be temporarily stored at intermediate sites and forwarded (SnF) at a later time when inter-DCN is less congested. However, the conventional methods attempt to involve multi-dimensional state information of the entire network in scheduling, which results in high computational complexity. In this paper, our studies reveal that there exist redundant states in scheduling, which cannot provide any performance benefit while imposing extra computational burden. Inspired by this finding, we propose a state-merging scheduling (SMS) method. By merging the state information of the pre-selected links, the SMS method naturally reduces the redundant states involved, which greatly improves the efficiency of SnF scheduling. Simulations demonstrate that the SMS method can outperform the conventional scheduling method, given a limit of the computational cost.","PeriodicalId":163393,"journal":{"name":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","volume":"219 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A State-Merging Scheduling Method for Bulk Transfers with Store-and-Forward over Inter-DC Optical Networks\",\"authors\":\"Xiao Lin, Jia Zhang, Shengnan Yue, Yuanlong Tan, Xiaoyu Wang, Weiqiang Sun, M. Veeraraghavan, Weisheng Hu\",\"doi\":\"10.1109/HPSR48589.2020.9098969\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The time- and space-varying nature of residual bandwidth in inter-datacenter networks (inter-DCNs) makes conventional end-to-end connections difficult to fully utilize the residual bandwidth. A promising solution is to introduce datacenter storage into data-plane paths. Delay-tolerant bulk data can be temporarily stored at intermediate sites and forwarded (SnF) at a later time when inter-DCN is less congested. However, the conventional methods attempt to involve multi-dimensional state information of the entire network in scheduling, which results in high computational complexity. In this paper, our studies reveal that there exist redundant states in scheduling, which cannot provide any performance benefit while imposing extra computational burden. Inspired by this finding, we propose a state-merging scheduling (SMS) method. By merging the state information of the pre-selected links, the SMS method naturally reduces the redundant states involved, which greatly improves the efficiency of SnF scheduling. Simulations demonstrate that the SMS method can outperform the conventional scheduling method, given a limit of the computational cost.\",\"PeriodicalId\":163393,\"journal\":{\"name\":\"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)\",\"volume\":\"219 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR48589.2020.9098969\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 21st International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR48589.2020.9098969","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A State-Merging Scheduling Method for Bulk Transfers with Store-and-Forward over Inter-DC Optical Networks
The time- and space-varying nature of residual bandwidth in inter-datacenter networks (inter-DCNs) makes conventional end-to-end connections difficult to fully utilize the residual bandwidth. A promising solution is to introduce datacenter storage into data-plane paths. Delay-tolerant bulk data can be temporarily stored at intermediate sites and forwarded (SnF) at a later time when inter-DCN is less congested. However, the conventional methods attempt to involve multi-dimensional state information of the entire network in scheduling, which results in high computational complexity. In this paper, our studies reveal that there exist redundant states in scheduling, which cannot provide any performance benefit while imposing extra computational burden. Inspired by this finding, we propose a state-merging scheduling (SMS) method. By merging the state information of the pre-selected links, the SMS method naturally reduces the redundant states involved, which greatly improves the efficiency of SnF scheduling. Simulations demonstrate that the SMS method can outperform the conventional scheduling method, given a limit of the computational cost.