Fair slot assignment in elastic optical networks under dynamic traffic

N. Ravi, A. Yayimli
{"title":"Fair slot assignment in elastic optical networks under dynamic traffic","authors":"N. Ravi, A. Yayimli","doi":"10.1109/ICOIN.2018.8343146","DOIUrl":null,"url":null,"abstract":"The elastic optical network (EON) is a very promising solution where spectral resources are used in flexible frequency grid. When multi-bandwidth services are blended together without proper bandwidth management, high slot requests are more likely to be blocked compared to low slot requests. To solve this unfairness problem, we proposed two methods: Equal Opportunity Slot Assignment (EOSA), where we determine the start slot based on the number of slots requested, and Nigh-Fairness Slot Assignment (NFSA), where the idea is to divide the whole spectrum into two parts and use different algorithms for each part. Simulation results for different topologies show that, our NFSA method achieves the desired fairness and improves the performance of the entire network in terms of blocking probability.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2018.8343146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The elastic optical network (EON) is a very promising solution where spectral resources are used in flexible frequency grid. When multi-bandwidth services are blended together without proper bandwidth management, high slot requests are more likely to be blocked compared to low slot requests. To solve this unfairness problem, we proposed two methods: Equal Opportunity Slot Assignment (EOSA), where we determine the start slot based on the number of slots requested, and Nigh-Fairness Slot Assignment (NFSA), where the idea is to divide the whole spectrum into two parts and use different algorithms for each part. Simulation results for different topologies show that, our NFSA method achieves the desired fairness and improves the performance of the entire network in terms of blocking probability.
动态流量下弹性光网络的公平槽位分配
弹性光网络是一种很有前途的解决方案,它将频谱资源用于灵活的频率网格。当多带宽业务混在一起时,如果没有适当的带宽管理,高槽位的请求比低槽位的请求更容易被阻塞。为了解决这个不公平问题,我们提出了两种方法:均等机会时隙分配(EOSA),其中我们根据请求的时隙数量确定起始时隙,以及近公平时隙分配(NFSA),其中的思想是将整个频谱分成两个部分,并对每个部分使用不同的算法。对不同拓扑结构的仿真结果表明,NFSA方法达到了期望的公平性,并在阻塞概率方面提高了整个网络的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信