A 10/7 + /spl epsi/ approximation for minimizing the number of ADMs in SONET rings

M. Shalom, S. Zaks
{"title":"A 10/7 + /spl epsi/ approximation for minimizing the number of ADMs in SONET rings","authors":"M. Shalom, S. Zaks","doi":"10.1109/BROADNETS.2004.1","DOIUrl":null,"url":null,"abstract":"SONET ADMs are dominant cost factors in WDM/SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation in G. Calinescu and P.J. Wan (2001). Through the study of the relation between this problem and the problem of finding maximum disjoint rings in a given set of lightpaths we manage to shed more light onto this problem and to develop a 10/7 + /spl epsi/ approximation for it.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Conference on Broadband Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BROADNETS.2004.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

Abstract

SONET ADMs are dominant cost factors in WDM/SONET rings. Whereas most previous papers on the topic concentrated on the number of wavelengths assigned to a given set of lightpaths, more recent papers argue that the number of ADMs is a more realistic cost measure. Some of these works discuss various heuristic algorithms for this problem, and the best known result is a 3/2 approximation in G. Calinescu and P.J. Wan (2001). Through the study of the relation between this problem and the problem of finding maximum disjoint rings in a given set of lightpaths we manage to shed more light onto this problem and to develop a 10/7 + /spl epsi/ approximation for it.
用于最小化SONET环中adm数量的10/7 + /spl epsi/近似值
在WDM/SONET环中,SONET adm是主要的成本因素。先前关于该主题的大多数论文都集中在分配给给定光路的波长数量上,而最近的论文则认为,adm的数量是一个更现实的成本衡量标准。其中一些作品讨论了这个问题的各种启发式算法,最著名的结果是G. Calinescu和P.J. Wan(2001)的3/2近似。通过研究这一问题与在给定光路集合中寻找最大不相交环的问题之间的关系,我们设法对这一问题提供了更多的了解,并对其提出了10/7 + /spl epsi/近似。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信