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}
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.