Minimizing Installation Costs of Survivable DWDM-Mesh Networks: A Heuristic Approach

M. Duelli, Christopher Pluntke, Michael Menth
{"title":"Minimizing Installation Costs of Survivable DWDM-Mesh Networks: A Heuristic Approach","authors":"M. Duelli, Christopher Pluntke, Michael Menth","doi":"10.1109/NGI.2008.9","DOIUrl":null,"url":null,"abstract":"The cost function for the capacity of optical links follows a step function. That means, the support of one more lightpath might require a costly upgrade of an optical cross connect (OXC), but then additional lightpaths can be supported at almost no further cost. This should be considered when lightpaths are routed through an optical network. In this paper we optimize the routing of the lightpaths to minimize the costs for the required optical equipment. We consider this problem for the failure-free case only and for survivable networks using dedicated path protection. We formulate the problems by integer linear programs (ILPs). In addition, we propose heuristics to solve the problem since solving ILPs is computationally expensive and not feasible for large problem instances. We show that our heuristics lead to good results within a fraction of time compared to ILP solvers.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Next Generation Internet Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2008.9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The cost function for the capacity of optical links follows a step function. That means, the support of one more lightpath might require a costly upgrade of an optical cross connect (OXC), but then additional lightpaths can be supported at almost no further cost. This should be considered when lightpaths are routed through an optical network. In this paper we optimize the routing of the lightpaths to minimize the costs for the required optical equipment. We consider this problem for the failure-free case only and for survivable networks using dedicated path protection. We formulate the problems by integer linear programs (ILPs). In addition, we propose heuristics to solve the problem since solving ILPs is computationally expensive and not feasible for large problem instances. We show that our heuristics lead to good results within a fraction of time compared to ILP solvers.
最小化可生存DWDM-Mesh网络的安装成本:一种启发式方法
光链路容量的代价函数遵循阶跃函数。这意味着,支持多一条光路可能需要昂贵的光交叉连接(OXC)升级,但随后可以支持额外的光路,几乎没有进一步的成本。当光路通过光网络路由时,应该考虑到这一点。在本文中,我们优化光路的路由,以尽量减少所需的光学设备的成本。我们只考虑无故障情况和使用专用路径保护的可生存网络的问题。我们用整数线性规划(ILPs)来表示问题。此外,我们提出了启发式方法来解决问题,因为解决ilp在计算上是昂贵的,并且对于大型问题实例是不可行的。我们表明,与ILP求解器相比,我们的启发式算法在很短的时间内就能得到很好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信