Reliable ILP approach of Max-RWA problem for translucent optical network

D. Sah, Hifzan Ahmad, Anchal Uniyal
{"title":"Reliable ILP approach of Max-RWA problem for translucent optical network","authors":"D. Sah, Hifzan Ahmad, Anchal Uniyal","doi":"10.1109/WOCN.2016.7759879","DOIUrl":null,"url":null,"abstract":"In an all-optical WDM network; optical fibers are used to transmit data followed by WDM technology. An optical fiber carries light along its length path at high rates and with little loss. Several wavelengths on a single fiber can be used to transfer data, when using wavelength-division multiplexing. In this way, several data transmissions at very high speed can take place on a single fiber. The routing and wavelength assignment (RWA) problem consists of finding a path and a wavelength for a set of data connections. The objective is typically to maximize the profit of established data by achieving as much as possible lightpath for transmitting optical signal (max-RWA). The RWA is NP-hard, thus much research has been conducted to finding a good way of approaching the RWA. This work mainly focuses on the analyzes work RWA problem based on integer linear programming (ILP) and reliable heuristics for variant topology of WDM networks. For performance analysis heuristics method as well as others variants of solution for RWA problem also had been implemented which results give some interesting observation about resources as well as optimal solution.","PeriodicalId":234041,"journal":{"name":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Thirteenth International Conference on Wireless and Optical Communications Networks (WOCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2016.7759879","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

In an all-optical WDM network; optical fibers are used to transmit data followed by WDM technology. An optical fiber carries light along its length path at high rates and with little loss. Several wavelengths on a single fiber can be used to transfer data, when using wavelength-division multiplexing. In this way, several data transmissions at very high speed can take place on a single fiber. The routing and wavelength assignment (RWA) problem consists of finding a path and a wavelength for a set of data connections. The objective is typically to maximize the profit of established data by achieving as much as possible lightpath for transmitting optical signal (max-RWA). The RWA is NP-hard, thus much research has been conducted to finding a good way of approaching the RWA. This work mainly focuses on the analyzes work RWA problem based on integer linear programming (ILP) and reliable heuristics for variant topology of WDM networks. For performance analysis heuristics method as well as others variants of solution for RWA problem also had been implemented which results give some interesting observation about resources as well as optimal solution.
半透明光网络Max-RWA问题的可靠ILP方法
在全光WDM网络中;采用光纤传输数据,采用波分复用技术。光纤沿其长度路径传输光,速率高,损耗小。当使用波分复用时,单个光纤上的几个波长可用于传输数据。这样,在一根光纤上就可以进行高速的多个数据传输。路由和波长分配(RWA)问题包括为一组数据连接找到路径和波长。目标通常是通过实现尽可能多的光路传输光信号(最大rwa)来最大化已建立的数据的利润。RWA是np困难的,因此已经进行了大量的研究来寻找接近RWA的好方法。本文主要研究了基于整数线性规划(ILP)和可靠启发式方法的WDM网络变拓扑下的工作RWA问题。在性能分析方面,本文还实现了启发式方法以及其他一些RWA问题的求解方法,其结果对资源和最优解进行了一些有趣的观察。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信