{"title":"Adaptive weight functions for wavelength-continuous WDM multi-fiber networks","authors":"K. Miliotis, G. Papadimitriou, A. Pomportsis","doi":"10.1109/ICON.2003.1266226","DOIUrl":null,"url":null,"abstract":"AbsmctIn this paper we address the problem of efficient Routing and Wavelength Assignment (RWA) in multi-fiber WDM networks without wavelength translation, under dynamic traffic. We couple Dijkstra’s shortest path algorithm with a suitable weight function which chooses optical paths based both on wavelength availability and multi-fiber segments. We compare our approach with other RWA schemes both for ’ even and uneven WDM multi-fiber networks in terms of blocking probability and overall link utilization.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"250 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2003.1266226","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
AbsmctIn this paper we address the problem of efficient Routing and Wavelength Assignment (RWA) in multi-fiber WDM networks without wavelength translation, under dynamic traffic. We couple Dijkstra’s shortest path algorithm with a suitable weight function which chooses optical paths based both on wavelength availability and multi-fiber segments. We compare our approach with other RWA schemes both for ’ even and uneven WDM multi-fiber networks in terms of blocking probability and overall link utilization.