An optimal independent sets based greedy spectral defragmentation algorithm in elastic optical network

Jiahui Wu, Min Zhang, F. Wang, Yanan Yue, Shanguo Huang
{"title":"An optimal independent sets based greedy spectral defragmentation algorithm in elastic optical network","authors":"Jiahui Wu, Min Zhang, F. Wang, Yanan Yue, Shanguo Huang","doi":"10.1109/ICOCN.2014.6987056","DOIUrl":null,"url":null,"abstract":"We quantify the fragmentation in elastic optical networks and propose a defragmentation algorithm which takes network's existing condition of spectrum allocation into consideration for the first time, we simulate the blocking probability (BP) together with spectrum continuous degree of networks after using three different algorithms. The results show our defragmentation algorithm has better performance compared to the existing strategies.","PeriodicalId":364683,"journal":{"name":"2014 13th International Conference on Optical Communications and Networks (ICOCN)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 13th International Conference on Optical Communications and Networks (ICOCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOCN.2014.6987056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We quantify the fragmentation in elastic optical networks and propose a defragmentation algorithm which takes network's existing condition of spectrum allocation into consideration for the first time, we simulate the blocking probability (BP) together with spectrum continuous degree of networks after using three different algorithms. The results show our defragmentation algorithm has better performance compared to the existing strategies.
弹性光网络中基于最优独立集的贪婪光谱碎片整理算法
对弹性光网络中的碎片进行了量化,首次提出了一种考虑网络现有频谱分配条件的碎片整理算法,采用三种不同的算法对网络的阻塞概率(BP)和频谱连续度进行了仿真。结果表明,与现有的碎片整理策略相比,我们的碎片整理算法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信