{"title":"Static RWA in All-Optical Network under Multifiber, Multiple Requests Assumption","authors":"Z.M. Wali, K. Elsayed, Aamir Hassan","doi":"10.1109/ICCES.2006.320443","DOIUrl":null,"url":null,"abstract":"This paper introduces a new approach targeting the RWA problem for static traffic and under the general assumptions of multiple requests between the same SD pairs and multifiber links. The case of infeasibility of the problem is also discussed and integrated into our frame work. We first present a categorization of the RWA problems according to the different assumptions involved. In addition, a classification of the available approaches is presented along with a brief comparison and overview of each. The proposed approach is tested by applying it to different network models; results for NSFNET and cost239 networks are presented. Furthermore, the results are also compared with a recent heuristic approach","PeriodicalId":261853,"journal":{"name":"2006 International Conference on Computer Engineering and Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Computer Engineering and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2006.320443","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
This paper introduces a new approach targeting the RWA problem for static traffic and under the general assumptions of multiple requests between the same SD pairs and multifiber links. The case of infeasibility of the problem is also discussed and integrated into our frame work. We first present a categorization of the RWA problems according to the different assumptions involved. In addition, a classification of the available approaches is presented along with a brief comparison and overview of each. The proposed approach is tested by applying it to different network models; results for NSFNET and cost239 networks are presented. Furthermore, the results are also compared with a recent heuristic approach