调度流量模式下WDM光网络的最优生存性设计

Tianjian Li, Bin Wang
{"title":"调度流量模式下WDM光网络的最优生存性设计","authors":"Tianjian Li, Bin Wang","doi":"10.1109/DRCN.2005.1563838","DOIUrl":null,"url":null,"abstract":"We study the optimal survivability design problem under a scheduled traffic model in wavelength convertible WDM optical mesh networks. In this model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. We formulate the joint routing and wavelength assignment problems into integer linear programs that maximally exploit network resource reuse in both space and time. To solve large problems, the joint RWA problems are divided to a routing subproblem and wavelength assignment subproblems which are then solved individually. The overall objective is to minimize the total number of wavelength-links used by working paths and protection paths of all traffic demands while 100% restorability is guaranteed against any single failures. Our simulation results indicate that the optimization of resource sharing in space and time enabled by our connection-holding-time-aware protection schemes can achieve significantly better resource utilization than schemes that are holding time unaware.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":"{\"title\":\"On optimal survivability design in WDM optical networks under a scheduled traffic model\",\"authors\":\"Tianjian Li, Bin Wang\",\"doi\":\"10.1109/DRCN.2005.1563838\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the optimal survivability design problem under a scheduled traffic model in wavelength convertible WDM optical mesh networks. In this model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. We formulate the joint routing and wavelength assignment problems into integer linear programs that maximally exploit network resource reuse in both space and time. To solve large problems, the joint RWA problems are divided to a routing subproblem and wavelength assignment subproblems which are then solved individually. The overall objective is to minimize the total number of wavelength-links used by working paths and protection paths of all traffic demands while 100% restorability is guaranteed against any single failures. Our simulation results indicate that the optimization of resource sharing in space and time enabled by our connection-holding-time-aware protection schemes can achieve significantly better resource utilization than schemes that are holding time unaware.\",\"PeriodicalId\":415896,\"journal\":{\"name\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"43\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DRCN.2005.1563838\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2005.1563838","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43

摘要

研究了波长可转换WDM光网状网络在调度业务模型下的最优生存性设计问题。在该模型中,给定一组需求,并预先知道需求的建立时间和拆除时间。我们将联合路由和波长分配问题化为整数线性规划,最大限度地利用网络资源在空间和时间上的重用。为了解决较大的问题,将联合RWA问题分为路由子问题和波长分配子问题,然后分别求解。总体目标是最小化所有流量需求的工作路径和保护路径所使用的波长链路总数,同时保证对任何单个故障的100%恢复能力。仿真结果表明,连接保持时间感知保护方案在空间和时间上实现资源共享的优化,其资源利用率明显优于保持时间不感知的保护方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
On optimal survivability design in WDM optical networks under a scheduled traffic model
We study the optimal survivability design problem under a scheduled traffic model in wavelength convertible WDM optical mesh networks. In this model, a set of demands is given, and the setup time and teardown time of a demand are known in advance. We formulate the joint routing and wavelength assignment problems into integer linear programs that maximally exploit network resource reuse in both space and time. To solve large problems, the joint RWA problems are divided to a routing subproblem and wavelength assignment subproblems which are then solved individually. The overall objective is to minimize the total number of wavelength-links used by working paths and protection paths of all traffic demands while 100% restorability is guaranteed against any single failures. Our simulation results indicate that the optimization of resource sharing in space and time enabled by our connection-holding-time-aware protection schemes can achieve significantly better resource utilization than schemes that are holding time unaware.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信