Towards deciding the optimum optical reach for GMPLS-based long-haul transport networks

N. Naas, H. Mouftah
{"title":"Towards deciding the optimum optical reach for GMPLS-based long-haul transport networks","authors":"N. Naas, H. Mouftah","doi":"10.1109/ICTON.2008.4598666","DOIUrl":null,"url":null,"abstract":"With the advances in the optical signal processing, extending the optical reach beyond thousands of kilometers becomes a reality, but the debatable question remains: how far the optical reach needs to be extended in order to achieve a minimal transport network cost. In this paper, we investigate the issue of determining the best optical reach in the domain of the GMPLS-based long-haul transport network. To conduct this investigation, we use heuristic approaches which we have previously developed to plan large-scale GMPLS-based transport networks with conversion and regeneration capabilities. Our investigation proceeds into two directions. First is deciding the best optical reach without the consideration of the optical reach customization. The second direction is deciding the best reach with customizing the optical reach of all-optical paths.","PeriodicalId":230802,"journal":{"name":"2008 10th Anniversary International Conference on Transparent Optical Networks","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 10th Anniversary International Conference on Transparent Optical Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTON.2008.4598666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the advances in the optical signal processing, extending the optical reach beyond thousands of kilometers becomes a reality, but the debatable question remains: how far the optical reach needs to be extended in order to achieve a minimal transport network cost. In this paper, we investigate the issue of determining the best optical reach in the domain of the GMPLS-based long-haul transport network. To conduct this investigation, we use heuristic approaches which we have previously developed to plan large-scale GMPLS-based transport networks with conversion and regeneration capabilities. Our investigation proceeds into two directions. First is deciding the best optical reach without the consideration of the optical reach customization. The second direction is deciding the best reach with customizing the optical reach of all-optical paths.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于gmpls的长途传输网络中最佳光到达的确定
随着光信号处理技术的进步,将光覆盖范围扩展到数千公里以上已成为现实,但仍存在一个有争议的问题:为了实现最小的传输网络成本,光覆盖范围需要扩展到多远?本文研究了基于gmpls的长途传输网络中最佳光传输距离的确定问题。为了进行这项调查,我们使用了我们以前开发的启发式方法来规划具有转换和再生能力的大规模基于gmpls的运输网络。我们的调查分为两个方向。首先是在不考虑光到达定制的情况下确定最佳光到达。第二个方向是通过定制全光路的光程来确定最佳光程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multiple pulse amplitude and position modulation for the optical wireless channel All-optical label swapping of 160 Gb/s data packets employing optical processing of scalable in-band address labels An analysis of control plane recovery requirements for GMPLS-enabled meshed transport networks Comparative analysis of thermal properties of various quantum-cascade lasers Dynamic routing based on information summary-LSA in WDM networks with wavelength conversion
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1