异构网络上的电路规划工具

Guangzhi Li, Dahai Xu, Dongmei Wang, A. Chiu, R. Doverspike
{"title":"异构网络上的电路规划工具","authors":"Guangzhi Li, Dahai Xu, Dongmei Wang, A. Chiu, R. Doverspike","doi":"10.1109/INFCOMW.2011.5928797","DOIUrl":null,"url":null,"abstract":"currently, there is no existing solution or tool to efficiently route a high-speed circuit over heterogeneous DWDM networks under multi-vendor environment, although each vendor may provide a planning tool to route a circuit within its own sub-network domain. This is mainly due to the lack of common technology for optical reachability calculation across vendor sub-networks. Each sub-network has its own proprietary parameters or formulas to calculate whether an optical path is reachable or not. To route a circuit across heterogeneous networks, we rely on the common function provided by each vendor tool to determine all reachable paths within each sub-network, i.e, the reachability matrix for each sub-network. Here reachability matrix is defined as a list of all reachable paths within the sub-network. Then we build a weighted cost graph based on the reachability matrices and apply the shortest path algorithm to find a cost efficient route. Finally we address the DWDM (Dense Wavelength Division Multiplex) sub-network selection, regenerator placement, and wavelength assignment on the selected route. The systematical methodology has been implemented in a circuit planning tool for high-speed circuits (up to 100Gbps) and used in a real heterogeneous DWDM network since 2009.","PeriodicalId":402219,"journal":{"name":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Circuit planning tool over heterogeneous networks\",\"authors\":\"Guangzhi Li, Dahai Xu, Dongmei Wang, A. Chiu, R. Doverspike\",\"doi\":\"10.1109/INFCOMW.2011.5928797\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"currently, there is no existing solution or tool to efficiently route a high-speed circuit over heterogeneous DWDM networks under multi-vendor environment, although each vendor may provide a planning tool to route a circuit within its own sub-network domain. This is mainly due to the lack of common technology for optical reachability calculation across vendor sub-networks. Each sub-network has its own proprietary parameters or formulas to calculate whether an optical path is reachable or not. To route a circuit across heterogeneous networks, we rely on the common function provided by each vendor tool to determine all reachable paths within each sub-network, i.e, the reachability matrix for each sub-network. Here reachability matrix is defined as a list of all reachable paths within the sub-network. Then we build a weighted cost graph based on the reachability matrices and apply the shortest path algorithm to find a cost efficient route. Finally we address the DWDM (Dense Wavelength Division Multiplex) sub-network selection, regenerator placement, and wavelength assignment on the selected route. The systematical methodology has been implemented in a circuit planning tool for high-speed circuits (up to 100Gbps) and used in a real heterogeneous DWDM network since 2009.\",\"PeriodicalId\":402219,\"journal\":{\"name\":\"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"volume\":\"90 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOMW.2011.5928797\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2011.5928797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

目前,尽管每个供应商都可以提供在自己的子网域中路由电路的规划工具,但没有现有的解决方案或工具来有效地在多供应商环境下在异构DWDM网络上路由高速电路。这主要是由于缺乏跨供应商子网的光可达性计算的通用技术。每个子网都有自己专有的参数或公式来计算光路是否可达。为了跨异构网络路由电路,我们依赖于每个供应商工具提供的公共功能来确定每个子网内的所有可达路径,即每个子网的可达性矩阵。这里可达性矩阵被定义为子网内所有可达路径的列表。然后基于可达性矩阵构建加权代价图,并应用最短路径算法寻找成本最优的路径。最后,我们讨论了DWDM(密集波分复用)子网选择、再生器放置和在所选路由上的波长分配。自2009年以来,系统的方法已在高速电路(高达100Gbps)的电路规划工具中实现,并在实际的异构DWDM网络中使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Circuit planning tool over heterogeneous networks
currently, there is no existing solution or tool to efficiently route a high-speed circuit over heterogeneous DWDM networks under multi-vendor environment, although each vendor may provide a planning tool to route a circuit within its own sub-network domain. This is mainly due to the lack of common technology for optical reachability calculation across vendor sub-networks. Each sub-network has its own proprietary parameters or formulas to calculate whether an optical path is reachable or not. To route a circuit across heterogeneous networks, we rely on the common function provided by each vendor tool to determine all reachable paths within each sub-network, i.e, the reachability matrix for each sub-network. Here reachability matrix is defined as a list of all reachable paths within the sub-network. Then we build a weighted cost graph based on the reachability matrices and apply the shortest path algorithm to find a cost efficient route. Finally we address the DWDM (Dense Wavelength Division Multiplex) sub-network selection, regenerator placement, and wavelength assignment on the selected route. The systematical methodology has been implemented in a circuit planning tool for high-speed circuits (up to 100Gbps) and used in a real heterogeneous DWDM network since 2009.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信