High Degree ROADM Cluster Node

H. Mehrvar, Xiang Hui, S. Jun, E. Bernier
{"title":"High Degree ROADM Cluster Node","authors":"H. Mehrvar, Xiang Hui, S. Jun, E. Bernier","doi":"10.1364/ofc.2022.th2a.21","DOIUrl":null,"url":null,"abstract":"A low-cost ROADM cluster node with flexible add/drop and scalable to 100s of degree is proposed for next generation optical networks. It disaggregate line and add/drop functions of the cluster into different chassis. A proposed order-based connection management algorithm achieves better than 10−4 blocking despite less than 30% dilation in cluster design. © 2021 The Author(s)","PeriodicalId":112434,"journal":{"name":"2022 Optical Fiber Communications Conference and Exhibition (OFC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 Optical Fiber Communications Conference and Exhibition (OFC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1364/ofc.2022.th2a.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

A low-cost ROADM cluster node with flexible add/drop and scalable to 100s of degree is proposed for next generation optical networks. It disaggregate line and add/drop functions of the cluster into different chassis. A proposed order-based connection management algorithm achieves better than 10−4 blocking despite less than 30% dilation in cluster design. © 2021 The Author(s)
高程度ROADM集群节点
针对下一代光网络,提出了一种低成本的ROADM集群节点,具有灵活的添加/删除功能,可扩展到100度。它将集群的线路和添加/删除功能分解到不同的机箱中。提出了一种基于顺序的连接管理算法,在集群设计的扩展小于30%的情况下,实现了优于10−4的阻塞。©2021作者
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信