在WDM环中最小化SONET adm的一种波长分配启发式方法

Xin Yuan, Amit Fulay
{"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}
引用次数: 4

摘要

部署了光波分复用(WDM)环,以支持单个物理光环上的多个SONET/SDH自愈环。在这样的系统中,主要的成本是SONET Add/Drop Multiplexers (adm)。为了使系统成本最小化,必须开发算法来为系统中的光路分配波长,从而使所需的adm数量最小化。然而,最小化SONET adm的最佳波长分配问题是np难题。现有的求解该问题的启发式算法包括先分配法、迭代匹配法和迭代归并法。在本文中,我们提出了一种新的波长分配启发式算法来最小化SONET adm。我们的启发式方法在寻找共享adm的机会(从而减少所需adm的总数)方面比现有最有效的启发式方法(迭代合并算法)平均有效3%到5%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信