{"title":"设计可靠的WDM网络-一种全局方法","authors":"S. Chamberland, A. Bahri","doi":"10.1109/NETWKS.2008.4763726","DOIUrl":null,"url":null,"abstract":"In this paper, we address the global problem of designing reliable wavelength division multiplexing (WDM) networks including the traffic grooming. This global problem consists in finding the number of optical fibers between each pair of optical nodes, finding the configuration of each node with respect to transponders, finding the virtual topology (i.e., the set of lightpaths), routing the lightpaths, grooming the traffic (i.e, grouping the connections and routing them over the lightpaths) and, finally, assigning wavelengths to the lightpaths. Instead of partitioning the problem into subproblems and solving them successively, we propose a mathematical programming model that addresses it as a whole. This approach has the advantage of providing better results since, in general, optimal solutions to all subproblems do not provide an optimal solution to the global problem. Numerical results show the relevance of designing the physical layer and finding the traffic grooming simultaneously.","PeriodicalId":442274,"journal":{"name":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Designing reliable WDM networks — A global approach\",\"authors\":\"S. Chamberland, A. Bahri\",\"doi\":\"10.1109/NETWKS.2008.4763726\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we address the global problem of designing reliable wavelength division multiplexing (WDM) networks including the traffic grooming. This global problem consists in finding the number of optical fibers between each pair of optical nodes, finding the configuration of each node with respect to transponders, finding the virtual topology (i.e., the set of lightpaths), routing the lightpaths, grooming the traffic (i.e, grouping the connections and routing them over the lightpaths) and, finally, assigning wavelengths to the lightpaths. Instead of partitioning the problem into subproblems and solving them successively, we propose a mathematical programming model that addresses it as a whole. This approach has the advantage of providing better results since, in general, optimal solutions to all subproblems do not provide an optimal solution to the global problem. Numerical results show the relevance of designing the physical layer and finding the traffic grooming simultaneously.\",\"PeriodicalId\":442274,\"journal\":{\"name\":\"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETWKS.2008.4763726\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2008.4763726","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Designing reliable WDM networks — A global approach
In this paper, we address the global problem of designing reliable wavelength division multiplexing (WDM) networks including the traffic grooming. This global problem consists in finding the number of optical fibers between each pair of optical nodes, finding the configuration of each node with respect to transponders, finding the virtual topology (i.e., the set of lightpaths), routing the lightpaths, grooming the traffic (i.e, grouping the connections and routing them over the lightpaths) and, finally, assigning wavelengths to the lightpaths. Instead of partitioning the problem into subproblems and solving them successively, we propose a mathematical programming model that addresses it as a whole. This approach has the advantage of providing better results since, in general, optimal solutions to all subproblems do not provide an optimal solution to the global problem. Numerical results show the relevance of designing the physical layer and finding the traffic grooming simultaneously.