{"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.