A State-Merging Scheduling Method for Bulk Transfers with Store-and-Forward over Inter-DC Optical Networks

Xiao Lin, Jia Zhang, Shengnan Yue, Yuanlong Tan, Xiaoyu Wang, Weiqiang Sun, M. Veeraraghavan, Weisheng Hu
{"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}
引用次数: 1

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
dc间光网络存储转发大容量传输的状态合并调度方法
数据中心间网络(inter-DCNs)中剩余带宽的时变和空变特性使得传统的端到端连接难以充分利用剩余带宽。一个很有前途的解决方案是将数据中心存储引入数据平面路径。可容忍延迟的批量数据可以临时存储在中间站点,并在以后dcn间拥塞程度较低时转发(SnF)。然而,传统的调度方法试图将整个网络的多维状态信息纳入调度中,这导致了较高的计算复杂度。在本文中,我们的研究表明调度中存在冗余状态,这不仅不能提供任何性能效益,而且会带来额外的计算负担。受此启发,我们提出了一种状态合并调度(SMS)方法。SMS方法通过合并预选链路的状态信息,自然地减少了冗余状态,大大提高了SnF调度的效率。仿真结果表明,在一定的计算成本限制下,SMS方法优于传统的调度方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Impact of Large-Scale Correlated Failures on Multilevel Virtualized Networks HPSR 2020 Table of Contents SERENADE: A Parallel Iterative Algorithm for Crossbar Scheduling in Input-Queued Switches Qualitative Communication Via Network Coding and New IP : Invited Paper i-CEON: Information-centric Elastic Optical Transport Network for Efficient Content Delivery
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1