{"title":"在WDM环中最小化SONET adm的一种波长分配启发式方法","authors":"Xin Yuan, Amit Fulay","doi":"10.1109/ICPPW.2001.951959","DOIUrl":null,"url":null,"abstract":"Optical Wavelength Division Multiplexing (WDM) rings are being deployed to support multiple SONET/SDH self-healing rings over a single physical optical ring. In such systems, the dominating cost is the SONET Add/Drop Multiplexers (ADMs). To minimize the system cost, algorithms must be developed to assign wavelengths to lightpaths in the system so that the number of ADMs required is minimized. However the problem of optimal wavelength assignment to minimize SONET ADMs is NP-hard. Existing heuristic algorithms for this problem include the assign first, the iterative matching and the iterative merging heuristics. In this paper we propose a new wavelength assignment heuristic to minimize SONET ADMs. Our heuristic is on average 3% to 5% more effective in finding the opportunities to share ADMs (and thus to reduce the total number of ADMs required) than the most effective existing heuristic, the iterative merging algorithm.","PeriodicalId":93355,"journal":{"name":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","volume":"62 1","pages":"257-262"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A wavelength assignment heuristic to minimize SONET ADMs in WDM rings\",\"authors\":\"Xin Yuan, Amit Fulay\",\"doi\":\"10.1109/ICPPW.2001.951959\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optical Wavelength Division Multiplexing (WDM) rings are being deployed to support multiple SONET/SDH self-healing rings over a single physical optical ring. In such systems, the dominating cost is the SONET Add/Drop Multiplexers (ADMs). To minimize the system cost, algorithms must be developed to assign wavelengths to lightpaths in the system so that the number of ADMs required is minimized. However the problem of optimal wavelength assignment to minimize SONET ADMs is NP-hard. Existing heuristic algorithms for this problem include the assign first, the iterative matching and the iterative merging heuristics. In this paper we propose a new wavelength assignment heuristic to minimize SONET ADMs. Our heuristic is on average 3% to 5% more effective in finding the opportunities to share ADMs (and thus to reduce the total number of ADMs required) than the most effective existing heuristic, the iterative merging algorithm.\",\"PeriodicalId\":93355,\"journal\":{\"name\":\"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops\",\"volume\":\"62 1\",\"pages\":\"257-262\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPPW.2001.951959\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ... ICPP Workshops on. International Conference on Parallel Processing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2001.951959","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A wavelength assignment heuristic to minimize SONET ADMs in WDM rings
Optical Wavelength Division Multiplexing (WDM) rings are being deployed to support multiple SONET/SDH self-healing rings over a single physical optical ring. In such systems, the dominating cost is the SONET Add/Drop Multiplexers (ADMs). To minimize the system cost, algorithms must be developed to assign wavelengths to lightpaths in the system so that the number of ADMs required is minimized. However the problem of optimal wavelength assignment to minimize SONET ADMs is NP-hard. Existing heuristic algorithms for this problem include the assign first, the iterative matching and the iterative merging heuristics. In this paper we propose a new wavelength assignment heuristic to minimize SONET ADMs. Our heuristic is on average 3% to 5% more effective in finding the opportunities to share ADMs (and thus to reduce the total number of ADMs required) than the most effective existing heuristic, the iterative merging algorithm.