Efficient online traffic grooming algorithms in WDM mesh networks with drop-and-continue node architecture

F. Farahmand, Xiaodong Huang, J. Jue
{"title":"Efficient online traffic grooming algorithms in WDM mesh networks with drop-and-continue node architecture","authors":"F. Farahmand, Xiaodong Huang, J. Jue","doi":"10.1109/BROADNETS.2004.37","DOIUrl":null,"url":null,"abstract":"As high capacity all-optical networks and WDM technologies advance and merge together, aggregating low-speed traffic streams onto high-speed wavelengths becomes more critical. Efficient aggregation techniques, known as traffic grooming, allow higher bandwidth utilization and can reduce request blocking probability. These algorithms can also result in lower network cost in terms of electronic switching. In this paper we focus on traffic grooming in WDM mesh networks with dynamic traffic patterns. We offer two new grooming concepts called lightpath dropping and lightpath extension. These concepts are based on an alternative node architecture in which incoming optical signals can be dropped at a node, while optically continuing to the next node. Based on these concepts, we develop several grooming algorithms and study them under various network objectives. We also compare their performance with previously proposed lightpath-based grooming algorithms. Through extensive simulation results we show that our proposed approaches lead to lower request blocking probability and lower average number of logical hops when the number of transceivers per node is limited.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Conference on Broadband Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BROADNETS.2004.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43

Abstract

As high capacity all-optical networks and WDM technologies advance and merge together, aggregating low-speed traffic streams onto high-speed wavelengths becomes more critical. Efficient aggregation techniques, known as traffic grooming, allow higher bandwidth utilization and can reduce request blocking probability. These algorithms can also result in lower network cost in terms of electronic switching. In this paper we focus on traffic grooming in WDM mesh networks with dynamic traffic patterns. We offer two new grooming concepts called lightpath dropping and lightpath extension. These concepts are based on an alternative node architecture in which incoming optical signals can be dropped at a node, while optically continuing to the next node. Based on these concepts, we develop several grooming algorithms and study them under various network objectives. We also compare their performance with previously proposed lightpath-based grooming algorithms. Through extensive simulation results we show that our proposed approaches lead to lower request blocking probability and lower average number of logical hops when the number of transceivers per node is limited.
基于丢接节点结构的WDM网状网络中高效的在线流量疏导算法
随着高容量全光网络和波分复用技术的发展和融合,将低速业务流聚合到高速波长上变得更加关键。高效的聚合技术,称为流量疏导,允许更高的带宽利用率,并可以减少请求阻塞概率。这些算法还可以在电子交换方面降低网络成本。本文主要研究具有动态流量模式的WDM网状网络中的流量疏导问题。我们提供两种新的修饰概念,称为光路下降和光路扩展。这些概念是基于另一种节点架构的,在这种架构中,输入的光信号可以在一个节点上丢弃,而光继续到下一个节点。基于这些概念,我们开发了几种梳理算法,并在不同的网络目标下对它们进行了研究。我们还将它们的性能与先前提出的基于光路的梳理算法进行了比较。通过大量的仿真结果表明,当每个节点的收发器数量有限时,我们提出的方法导致较低的请求阻塞概率和较低的平均逻辑跳数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信