Dynamic reconfiguration for optical network

Saurabh Bhandari, E. Park
{"title":"Dynamic reconfiguration for optical network","authors":"Saurabh Bhandari, E. Park","doi":"10.1109/ICCCN.2005.1523859","DOIUrl":null,"url":null,"abstract":"Our work looks into the reconfiguration of virtual topology for wavelength-routed mesh optical network under dynamic traffic demand. When reconfiguring the optical network, it is important to minimize the number of receivers that need to be retuned. It is also important to minimize the average weighted hop count as it is directly proportional to the throughput of the network. The tradeoff here is between the optimality of the network and the network disruption. In our work we first model this tradeoff as mixed integer linear problem and then present a heuristic algorithm for dynamic reconfiguration of optical network. Our algorithm minimizes the physical resources used, physical hops encountered, and the necessary number of retuning of receivers. It tries to satisfy the traffic demand with minimal network disruption.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523859","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Our work looks into the reconfiguration of virtual topology for wavelength-routed mesh optical network under dynamic traffic demand. When reconfiguring the optical network, it is important to minimize the number of receivers that need to be retuned. It is also important to minimize the average weighted hop count as it is directly proportional to the throughput of the network. The tradeoff here is between the optimality of the network and the network disruption. In our work we first model this tradeoff as mixed integer linear problem and then present a heuristic algorithm for dynamic reconfiguration of optical network. Our algorithm minimizes the physical resources used, physical hops encountered, and the necessary number of retuning of receivers. It tries to satisfy the traffic demand with minimal network disruption.
光网络的动态重构
本文研究了动态流量需求下波长路由网状光网络的虚拟拓扑重构问题。在重新配置光网络时,重要的是尽量减少需要返回的接收器的数量。最小化平均加权跳数也很重要,因为它与网络的吞吐量成正比。这里的权衡是在网络的最优性和网络中断之间。在我们的工作中,我们首先将这种权衡建模为混合整数线性问题,然后提出了一种启发式算法用于光网络的动态重构。我们的算法最大限度地减少了使用的物理资源、遇到的物理跳数和接收器返回的必要数量。它试图以最小的网络中断来满足流量需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信