Performance of slotted store-and-forward (sSnF) optical circuit-switched networks - a simulation study

Xiao Lin, Weiqiang Sun, Weisheng Hu
{"title":"Performance of slotted store-and-forward (sSnF) optical circuit-switched networks - a simulation study","authors":"Xiao Lin, Weiqiang Sun, Weisheng Hu","doi":"10.1109/HPSR.2017.7968680","DOIUrl":null,"url":null,"abstract":"Increasing bulk data transfers have been overwhelming the Internet. To overcome this, optical circuit-switched (OCS) networks are equipped with assistive storage, so that bulk data that are delay tolerant can be temporarily stored at intermediate nodes and forwarded at later times. But, the use of storage greatly complicates the routing problem, since data storage must be incorporated into routing. This motivates us to simplify this issue by applying slotted operations for the network. Intuitively, the slotted network suffers from degraded network performance due to the inefficient utilization incurred by the slot constraint. However, our simulation shows that when the slot size equals to half the mean duration, the blocking probability is reduced from 0.076 to 8.5×10−5, and the number of network reconfigurations is reduced by a factor of 5, compared to the unslotted case. We reveal that in spite of the inefficient utilization, the slotted operations mitigate bandwidth fragmentation. This suggests in the slotted case, more bandwidth gaps on the links are available for accommodating other requests, and they are aligned with each other in time. Requests hence are delivered with less store-and-forward (SnF) operations being performed. Thus, when the number of SnF allowed for routing each request is limited (in order to reduce the computational complexity of routing), requests are more easily served in the slotted than in the unslotted cases. Our research provides clue for designing scalable slotted OCS networks with assistive storage.","PeriodicalId":169489,"journal":{"name":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 18th International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2017.7968680","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Increasing bulk data transfers have been overwhelming the Internet. To overcome this, optical circuit-switched (OCS) networks are equipped with assistive storage, so that bulk data that are delay tolerant can be temporarily stored at intermediate nodes and forwarded at later times. But, the use of storage greatly complicates the routing problem, since data storage must be incorporated into routing. This motivates us to simplify this issue by applying slotted operations for the network. Intuitively, the slotted network suffers from degraded network performance due to the inefficient utilization incurred by the slot constraint. However, our simulation shows that when the slot size equals to half the mean duration, the blocking probability is reduced from 0.076 to 8.5×10−5, and the number of network reconfigurations is reduced by a factor of 5, compared to the unslotted case. We reveal that in spite of the inefficient utilization, the slotted operations mitigate bandwidth fragmentation. This suggests in the slotted case, more bandwidth gaps on the links are available for accommodating other requests, and they are aligned with each other in time. Requests hence are delivered with less store-and-forward (SnF) operations being performed. Thus, when the number of SnF allowed for routing each request is limited (in order to reduce the computational complexity of routing), requests are more easily served in the slotted than in the unslotted cases. Our research provides clue for designing scalable slotted OCS networks with assistive storage.
开槽存储转发(sSnF)光电路交换网络性能的仿真研究
越来越多的批量数据传输已经使互联网不堪重负。为了克服这个问题,光学电路交换(OCS)网络配备了辅助存储,这样可以容忍延迟的大量数据可以临时存储在中间节点,并在以后转发。但是,存储的使用极大地使路由问题复杂化,因为数据存储必须并入路由。这促使我们通过对网络应用槽操作来简化这个问题。从直观上看,由于槽位约束导致的利用率低下,导致了网络性能的下降。然而,我们的模拟表明,当插槽大小等于平均持续时间的一半时,阻塞概率从0.076降低到8.5×10−5,并且与未插槽的情况相比,网络重新配置的次数减少了5倍。我们发现,尽管利用率低,但开槽操作减轻了带宽碎片。这表明,在开槽情况下,链路上有更多的带宽间隙可以容纳其他请求,并且它们之间及时对齐。因此,在交付请求时,执行的存储转发(SnF)操作更少。因此,当允许路由每个请求的SnF数量有限时(为了减少路由的计算复杂性),在有槽的情况下比在没有槽的情况下更容易处理请求。我们的研究为设计具有辅助存储的可扩展开槽OCS网络提供了线索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信