基于现有光路感知区域的大型WDM网状光网络中高效、可扩展的动态业务疏导方法

Quang-Dung Ho, T. Le-Ngoc, M. Lee
{"title":"基于现有光路感知区域的大型WDM网状光网络中高效、可扩展的动态业务疏导方法","authors":"Quang-Dung Ho, T. Le-Ngoc, M. Lee","doi":"10.1109/ACCESSNETS.2007.4447144","DOIUrl":null,"url":null,"abstract":"This paper proposes an efficient and scalable dynamic traffic grooming algorithm suitable for large WDM mesh networks by limiting the zone where lightpaths for new connection requests are searched. Besides, in order to maintain the multi-hop grooming flexibility, the searching zone can be dynamically enlarged according to the availability of groomable existing or new lightpaths and the physical connectivity between network nodes. We develop a mathematical model to estimate the possibility that a node connects the source and destination when included to enlarge the searching zone, and to ensure that the selected lightpath is resource-efficient. Simulation results demonstrate that the proposed algorithm can significantly reduce the computations and improve the blocking performance.","PeriodicalId":393914,"journal":{"name":"2007 Second International Conference on Access Networks & Workshops","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Existing-lightpath-aware zone-based approach for efficient and scalable dynamic traffic grooming in large optical WDM mesh networks\",\"authors\":\"Quang-Dung Ho, T. Le-Ngoc, M. Lee\",\"doi\":\"10.1109/ACCESSNETS.2007.4447144\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes an efficient and scalable dynamic traffic grooming algorithm suitable for large WDM mesh networks by limiting the zone where lightpaths for new connection requests are searched. Besides, in order to maintain the multi-hop grooming flexibility, the searching zone can be dynamically enlarged according to the availability of groomable existing or new lightpaths and the physical connectivity between network nodes. We develop a mathematical model to estimate the possibility that a node connects the source and destination when included to enlarge the searching zone, and to ensure that the selected lightpath is resource-efficient. Simulation results demonstrate that the proposed algorithm can significantly reduce the computations and improve the blocking performance.\",\"PeriodicalId\":393914,\"journal\":{\"name\":\"2007 Second International Conference on Access Networks & Workshops\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 Second International Conference on Access Networks & Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACCESSNETS.2007.4447144\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Second International Conference on Access Networks & Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACCESSNETS.2007.4447144","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种适用于大型WDM网状网络的高效、可扩展的动态流量疏导算法,该算法通过限制搜索新连接请求光路的区域来实现。此外,为了保持多跳梳理的灵活性,可以根据可梳理的现有光路或新光路的可用性以及网络节点之间的物理连通性来动态扩大搜索区域。我们建立了一个数学模型来估计一个节点在包含时连接源和目标的可能性,以扩大搜索区域,并确保所选择的光路是资源高效的。仿真结果表明,该算法可以显著减少计算量,提高阻塞性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Existing-lightpath-aware zone-based approach for efficient and scalable dynamic traffic grooming in large optical WDM mesh networks
This paper proposes an efficient and scalable dynamic traffic grooming algorithm suitable for large WDM mesh networks by limiting the zone where lightpaths for new connection requests are searched. Besides, in order to maintain the multi-hop grooming flexibility, the searching zone can be dynamically enlarged according to the availability of groomable existing or new lightpaths and the physical connectivity between network nodes. We develop a mathematical model to estimate the possibility that a node connects the source and destination when included to enlarge the searching zone, and to ensure that the selected lightpath is resource-efficient. Simulation results demonstrate that the proposed algorithm can significantly reduce the computations and improve the blocking performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信