{"title":"Optimal priority-based lightpath allocation for survivable WDM networks","authors":"Suqin Zhong, A. Jaekel","doi":"10.1109/ICCCN.2004.1401576","DOIUrl":null,"url":null,"abstract":"This paper introduces a new and efficient mixed-integer linear program (MILP) formulation for dynamic lightpath allocation in survivable WDM networks, using both shared and dedicated path protection. The objective is to minimize the amount of additional optical resources (wavelength-links) needed for the new connection. The formulation can handle multiple levels of service and traditional shared and dedicated path protection schemes can be treated simply as a special case of the formulation. Experiments carried out on a number of different networks demonstrate that this approach can improve performance and is feasible for practical sized networks","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2004.1401576","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
This paper introduces a new and efficient mixed-integer linear program (MILP) formulation for dynamic lightpath allocation in survivable WDM networks, using both shared and dedicated path protection. The objective is to minimize the amount of additional optical resources (wavelength-links) needed for the new connection. The formulation can handle multiple levels of service and traditional shared and dedicated path protection schemes can be treated simply as a special case of the formulation. Experiments carried out on a number of different networks demonstrate that this approach can improve performance and is feasible for practical sized networks