光WDM网络的设计

Amal Benhamiche, A. Mahjoub, N. Perrot
{"title":"光WDM网络的设计","authors":"Amal Benhamiche, A. Mahjoub, N. Perrot","doi":"10.1109/NETWKS.2010.5624956","DOIUrl":null,"url":null,"abstract":"In this paper we consider the traffic Grooming, Routing and Wavelength Assignment problem in optical WDM mesh networks. This is a network design problem which consists in grooming the demands in lightpaths, assigning a wavelength to each lightpath and routing the traffic on these lightpaths so that the total cost is minimum. We first give an Integer Linear Programming formulation for the problem. Then we discuss a preprocessing procedure for efficiently managing the existing resources of the network. We then propose a fast and effective heuristic for solving large and real instances of the problem. We finally provide an illustrative application of the proposed heuristic for a real backhaul network instance.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Design of optical WDM networks\",\"authors\":\"Amal Benhamiche, A. Mahjoub, N. Perrot\",\"doi\":\"10.1109/NETWKS.2010.5624956\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the traffic Grooming, Routing and Wavelength Assignment problem in optical WDM mesh networks. This is a network design problem which consists in grooming the demands in lightpaths, assigning a wavelength to each lightpath and routing the traffic on these lightpaths so that the total cost is minimum. We first give an Integer Linear Programming formulation for the problem. Then we discuss a preprocessing procedure for efficiently managing the existing resources of the network. We then propose a fast and effective heuristic for solving large and real instances of the problem. We finally provide an illustrative application of the proposed heuristic for a real backhaul network instance.\",\"PeriodicalId\":202408,\"journal\":{\"name\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETWKS.2010.5624956\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2010.5624956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了光WDM网状网络中的业务量疏导、路由和波长分配问题。这是一个网络设计问题,包括梳理光路的需求,为每条光路分配波长,并在这些光路上路由流量,以使总成本最小。首先给出了该问题的整数线性规划公式。然后讨论了一种有效管理网络现有资源的预处理程序。然后,我们提出了一种快速有效的启发式方法来解决问题的大型和实际实例。最后,我们以一个实际的回程网络实例为例,说明了所提出的启发式算法的应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design of optical WDM networks
In this paper we consider the traffic Grooming, Routing and Wavelength Assignment problem in optical WDM mesh networks. This is a network design problem which consists in grooming the demands in lightpaths, assigning a wavelength to each lightpath and routing the traffic on these lightpaths so that the total cost is minimum. We first give an Integer Linear Programming formulation for the problem. Then we discuss a preprocessing procedure for efficiently managing the existing resources of the network. We then propose a fast and effective heuristic for solving large and real instances of the problem. We finally provide an illustrative application of the proposed heuristic for a real backhaul network instance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信