Optical Switching for Variable Size Packets: Improved Void Filling through Selective Void Creation

Kurt Van Hautegem, W. Rogiest, H. Bruneel
{"title":"Optical Switching for Variable Size Packets: Improved Void Filling through Selective Void Creation","authors":"Kurt Van Hautegem, W. Rogiest, H. Bruneel","doi":"10.1145/3016032.3016044","DOIUrl":null,"url":null,"abstract":"With ever-increasing demand for bandwidth, both optical packet switching and optical burst switching are proposed as alternatives to increase the capacity of optical networks in the future. In these packet-based switching techniques, Fiber Delay Lines are used to avoid contention between packets on a single wavelength. The involved scheduling algorithms decide on which Fiber Delay Line each packet is scheduled in order to maximize performance. By selectively delaying packets longer than strictly necessary, we proposed a schedule called void-creation that outperforms existing void-filling algorithms by up to 50 % for a specific setting with fixed packet size. This contribution extends the concept of void-creation to the case of variable size packets. By conditioning the theoretical value of the packet size on the scheduling parameters, we are able to extend the applicability of the void-creating algorithm to a plurality of settings. We therefore developed a numerical procedure that assigns a theoretical value (or, equivalently, negative cost) to each void based on how likely the void will eventually be filled and thus proven useful. Results obtained by Monte Carlo simulation show that our void-values provide a solid and consistent basis to decide upon void creation, and this for a variety of packet size distributions.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3016032.3016044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

With ever-increasing demand for bandwidth, both optical packet switching and optical burst switching are proposed as alternatives to increase the capacity of optical networks in the future. In these packet-based switching techniques, Fiber Delay Lines are used to avoid contention between packets on a single wavelength. The involved scheduling algorithms decide on which Fiber Delay Line each packet is scheduled in order to maximize performance. By selectively delaying packets longer than strictly necessary, we proposed a schedule called void-creation that outperforms existing void-filling algorithms by up to 50 % for a specific setting with fixed packet size. This contribution extends the concept of void-creation to the case of variable size packets. By conditioning the theoretical value of the packet size on the scheduling parameters, we are able to extend the applicability of the void-creating algorithm to a plurality of settings. We therefore developed a numerical procedure that assigns a theoretical value (or, equivalently, negative cost) to each void based on how likely the void will eventually be filled and thus proven useful. Results obtained by Monte Carlo simulation show that our void-values provide a solid and consistent basis to decide upon void creation, and this for a variety of packet size distributions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
可变大小数据包的光交换:通过选择性空腔创建改进空腔填充
随着对带宽需求的不断增长,光分组交换和光突发交换被提出作为未来增加光网络容量的备选方案。在这些基于分组的交换技术中,使用光纤延迟线来避免在单个波长上的分组之间的争用。所涉及的调度算法决定在哪个光纤延迟线调度每个数据包,以最大限度地提高性能。通过选择性地延迟数据包超过严格必要的时间,我们提出了一种称为void-creation的计划,对于固定数据包大小的特定设置,该计划比现有的空隙填充算法性能高出50%。这一贡献将void创建的概念扩展到可变大小数据包的情况。通过将数据包大小的理论值限定在调度参数上,我们能够将空生成算法的适用性扩展到多个设置。因此,我们开发了一个数值程序,根据空隙最终被填满的可能性为每个空隙分配一个理论值(或等价的负成本),从而证明空隙是有用的。蒙特卡罗模拟结果表明,我们的空洞值为确定空洞的产生提供了坚实和一致的基础,这适用于各种数据包大小分布。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Online Detection of Behavioral Change Using Unobtrusive Eldercare Monitoring System Light-traffic analysis of queues with limited heterogenous retrials Modeling of Priority-based Request Scheduling Mechanism for Finite Buffer SIP Servers Dynamic Task Scheduling for Energy Harvesting Nodes in Wireless Sensor Networks Variability of output in two-node tandem production line
×
引用
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