首页 > 最新文献

Journal of Optical Communications and Networking最新文献

英文 中文
PRODIGY+: a robust progressive upgrade approach for elastic optical networks PRODIGY+:弹性光网络的稳健渐进升级方法 [特邀]
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-16 DOI: 10.1364/JOCN.525392
Shrinivas Petale;Aleksandra Knapinska;Egemen Erbayat;Piotr Lechowicz;Krzysztof Walkowiak;Shih-Chun Lin;Motoharu Matsuura;Hiroshi Hasegawa;Suresh Subramaniam
Elastic optical networks (EONs) operating in the C-band have been widely deployed worldwide. However, two major technologies—multiband elastic optical networks (MB-EONs) and space division multiplexed elastic optical networks (SDM-EONs)—can significantly increase network capacity beyond traditional EONs. A one-time greenfield deployment of these flexible-grid technologies may not be practical, as existing investments in flexible-grid EONs need to be preserved and ongoing services must face minimal disruption. Therefore, we envision the coexistence of flexible-grid, multiband, and multicore technologies during the brownfield migration. Each technology represents a tradeoff between higher capacity and greater deployment overhead, directly impacting network performance. Moreover, as traffic demands continue rising, capacity exhaustion becomes inevitable. Considering the different characteristics of these technologies, we propose a robust network planning solution called Progressive Optics Deployment and Integration for Growing Yields (PRODIGY+) to gradually migrate current C-band EONs. PRODIGY+ employs proactive measures inspired by the Swiss Cheese Model, making the network robust to traffic peaks while meeting service level agreements. The upgrade strategy enables a gradual transition to minimize migration costs while continuously supporting increasing traffic demands. We provide a detailed comparison of our proposed PRODIGY+ strategy against baseline strategies, demonstrating its superior performance.
在 C 波段运行的弹性光网络(EON)已在全球广泛部署。然而,两种主要技术--多频带弹性光网络(MB-EON)和空分复用弹性光网络(SDM-EON)--可以显著提高网络容量,超越传统的 EON。一次性全新部署这些灵活光网络技术可能并不现实,因为需要保留对灵活光网络 EON 的现有投资,而且必须尽量减少对现有服务的干扰。因此,我们设想在棕地迁移过程中,灵活网格、多频段和多核技术将共存。每种技术都要在更高容量和更大部署开销之间进行权衡,从而直接影响网络性能。此外,随着流量需求的不断增长,容量耗尽将不可避免。考虑到这些技术的不同特性,我们提出了一种稳健的网络规划解决方案,称为 "渐进式光学部署和集成,促进产量增长"(PRODIGY+),以逐步迁移当前的 C 波段 EON。PRODIGY+ 采用受瑞士奶酪模型启发的前瞻性措施,使网络在满足服务水平协议的同时,还能应对流量高峰。升级策略可实现逐步过渡,最大限度地降低迁移成本,同时持续支持不断增长的流量需求。我们详细比较了我们提出的 PRODIGY+ 策略和基准策略,证明了其卓越的性能。
{"title":"PRODIGY+: a robust progressive upgrade approach for elastic optical networks","authors":"Shrinivas Petale;Aleksandra Knapinska;Egemen Erbayat;Piotr Lechowicz;Krzysztof Walkowiak;Shih-Chun Lin;Motoharu Matsuura;Hiroshi Hasegawa;Suresh Subramaniam","doi":"10.1364/JOCN.525392","DOIUrl":"10.1364/JOCN.525392","url":null,"abstract":"Elastic optical networks (EONs) operating in the C-band have been widely deployed worldwide. However, two major technologies—multiband elastic optical networks (MB-EONs) and space division multiplexed elastic optical networks (SDM-EONs)—can significantly increase network capacity beyond traditional EONs. A one-time greenfield deployment of these flexible-grid technologies may not be practical, as existing investments in flexible-grid EONs need to be preserved and ongoing services must face minimal disruption. Therefore, we envision the coexistence of flexible-grid, multiband, and multicore technologies during the brownfield migration. Each technology represents a tradeoff between higher capacity and greater deployment overhead, directly impacting network performance. Moreover, as traffic demands continue rising, capacity exhaustion becomes inevitable. Considering the different characteristics of these technologies, we propose a robust network planning solution called Progressive Optics Deployment and Integration for Growing Yields (PRODIGY+) to gradually migrate current C-band EONs. PRODIGY+ employs proactive measures inspired by the Swiss Cheese Model, making the network robust to traffic peaks while meeting service level agreements. The upgrade strategy enables a gradual transition to minimize migration costs while continuously supporting increasing traffic demands. We provide a detailed comparison of our proposed PRODIGY+ strategy against baseline strategies, demonstrating its superior performance.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 9","pages":"E48-E60"},"PeriodicalIF":4.0,"publicationDate":"2024-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141829895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DRL-based progressive recovery for quantum-key-distribution networks 基于 DRL 的量子密钥分发网络渐进恢复技术
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-15 DOI: 10.1364/JOCN.526014
Mengyao Li;Qiaolun Zhang;Alberto Gatto;Stefano Bregni;Giacomo Verticale;Massimo Tornatore
With progressive network recovery, operators restore network connectivity after massive failures along multiple stages, by identifying the optimal sequence of repair actions to maximize carried live traffic. Motivated by the initial deployments of quantum-key-distribution (QKD) over optical networks appearing in several locations worldwide, in this work we model and solve the progressive QKD network recovery (PQNR) problem in QKD networks to accelerate the recovery after failures. We formulate an integer linear programming (ILP) model to optimize the achievable accumulative key rates during recovery for four different QKD network architectures, considering different capabilities of using trusted relay and optical bypass. Due to the computational limitations of the ILP model, we propose a deep reinforcement learning (DRL) algorithm based on a twin delayed deep deterministic policy gradients (TD3) framework to solve the PQNR problem for large-scale topologies. Simulation results show that our proposed algorithm approaches well compared to the optimal solution and outperforms several baseline algorithms. Moreover, using optical bypass jointly with trusted relay can improve the performance in terms of the key rate by 14% and 18% compared to the cases where only optical bypass and only trusted relay are applied, respectively.
通过渐进式网络恢复,运营商可在大规模故障后通过多个阶段恢复网络连接,方法是确定最佳修复行动顺序,以最大限度地提高所承载的实时流量。在这项工作中,我们对 QKD 网络中的渐进式 QKD 网络恢复(PQNR)问题进行了建模和求解,以加快故障后的恢复速度。我们制定了一个整数线性规划(ILP)模型,以优化四种不同 QKD 网络架构在恢复期间可实现的累积密钥率,同时考虑到使用可信中继和光旁路的不同能力。由于 ILP 模型的计算局限性,我们提出了一种基于双延迟深度确定性策略梯度(TD3)框架的深度强化学习(DRL)算法,以解决大规模拓扑的 PQNR 问题。仿真结果表明,与最优解相比,我们提出的算法接近度很高,性能优于几种基准算法。此外,与仅使用光旁路和仅使用可信中继的情况相比,联合使用光旁路和可信中继可将密钥率性能分别提高 14% 和 18%。
{"title":"DRL-based progressive recovery for quantum-key-distribution networks","authors":"Mengyao Li;Qiaolun Zhang;Alberto Gatto;Stefano Bregni;Giacomo Verticale;Massimo Tornatore","doi":"10.1364/JOCN.526014","DOIUrl":"10.1364/JOCN.526014","url":null,"abstract":"With progressive network recovery, operators restore network connectivity after massive failures along multiple stages, by identifying the optimal sequence of repair actions to maximize carried live traffic. Motivated by the initial deployments of quantum-key-distribution (QKD) over optical networks appearing in several locations worldwide, in this work we model and solve the progressive QKD network recovery (PQNR) problem in QKD networks to accelerate the recovery after failures. We formulate an integer linear programming (ILP) model to optimize the achievable accumulative key rates during recovery for four different QKD network architectures, considering different capabilities of using trusted relay and optical bypass. Due to the computational limitations of the ILP model, we propose a deep reinforcement learning (DRL) algorithm based on a twin delayed deep deterministic policy gradients (TD3) framework to solve the PQNR problem for large-scale topologies. Simulation results show that our proposed algorithm approaches well compared to the optimal solution and outperforms several baseline algorithms. Moreover, using optical bypass jointly with trusted relay can improve the performance in terms of the key rate by 14% and 18% compared to the cases where only optical bypass and only trusted relay are applied, respectively.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 9","pages":"E36-E47"},"PeriodicalIF":4.0,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141641668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Extension of the k-SPF algorithm for finding SRLG-disjoint primary and backup route pairs in optical networks 扩展 k-SPF 算法以在光网络中找到 SRLG 不相交的主路由对和备用路由对
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-15 DOI: 10.1364/JOCN.525178
Hiroshi Matsuura;Kohjun Koshiji;Hanami Yokoi;Tatsuya Matsukawa;Takayuki Fujii
There is a strong demand for creating primary/backup optical path pairs between a source and a destination node in order to continue a service when the primary path has some disorder. We also have to consider SRLG (shared risk link group)-disjoint primary/backup path settings for achieving robust path protection against possible network problems on primary paths. To deal with these issues, in this study, we use the $k$-SPF (shortest path first) algorithm to determine primary/backup path routes between a specified source/destination node pair. We demonstrate that the proposed algorithm can find $k$ SRLG-disjoint primary/backup route pairs with much higher probability and with faster speed compared with other algorithms. In addition, the proposed algorithm can find primary/backup routes with nearly minimum route costs.
为了在主路径出现故障时继续提供服务,在源节点和目的节点之间创建主/备用光路对的需求非常强烈。我们还必须考虑 SRLG(共享风险链路组)--主路/备用路的分离设置,以实现对主路可能出现的网络问题的稳健路径保护。为了解决这些问题,我们在本研究中使用了 $k$-SPF(最短路径优先)算法来确定指定源/目的节点对之间的主/备用路径路由。我们证明,与其他算法相比,所提出的算法能以更高的概率和更快的速度找到 $k$ SRLG-互不相交的主/备用路由对。此外,所提算法还能以几乎最低的路由成本找到主/后备路由。
{"title":"Extension of the k-SPF algorithm for finding SRLG-disjoint primary and backup route pairs in optical networks","authors":"Hiroshi Matsuura;Kohjun Koshiji;Hanami Yokoi;Tatsuya Matsukawa;Takayuki Fujii","doi":"10.1364/JOCN.525178","DOIUrl":"10.1364/JOCN.525178","url":null,"abstract":"There is a strong demand for creating primary/backup optical path pairs between a source and a destination node in order to continue a service when the primary path has some disorder. We also have to consider SRLG (shared risk link group)-disjoint primary/backup path settings for achieving robust path protection against possible network problems on primary paths. To deal with these issues, in this study, we use the \u0000<tex>$k$</tex>\u0000-SPF (shortest path first) algorithm to determine primary/backup path routes between a specified source/destination node pair. We demonstrate that the proposed algorithm can find \u0000<tex>$k$</tex>\u0000 SRLG-disjoint primary/backup route pairs with much higher probability and with faster speed compared with other algorithms. In addition, the proposed algorithm can find primary/backup routes with nearly minimum route costs.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 9","pages":"E23-E35"},"PeriodicalIF":4.0,"publicationDate":"2024-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141664995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Routing problem for reducing significant outages in optical networks and its system analysis 减少光网络重大中断的新型路由问题及其系统分析
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-13 DOI: 10.1364/JOCN.520509
Katsuaki Higashimori;Takafumi Tanaka;Takeru Inoue
Optical communication networks are operated with great care to avoid outages. In particular, significant outages having a devastating impact on society must be avoided, and several countries specify “significance standards” for network outages. Although the impact of possible outages strongly depends on routing methods for requested connections, there has been no research specifically on these standards. This paper for the first time, to the best of our knowledge, introduces a routing problem to minimize the impact of outages on a given significance standard. We have shown this problem to be non-deterministic polynomial-time hardness, and an efficient heuristic method is proposed. This method searches for a good solution by reducing the problem to a shortest-path search, where the significance of a link failure is regarded as the link weight, and suppresses outage impact compared with other routing methods. In addition, the analysis of the system dependence among a network model, mean time to repair (MTTR) of failure elements, and significance standards suggests that the total system design considering the MTTR, significance standards, and routing method could dramatically reduce the impact of significant outages on optical networks.
光通信网络的运行需要非常谨慎,以避免中断。特别是必须避免对社会造成破坏性影响的重大中断,一些国家规定了网络中断的 "重要性标准"。尽管可能出现的中断影响在很大程度上取决于请求连接的路由选择方法,但目前还没有专门针对这些标准的研究。据我们所知,本文首次提出了一个路由问题,以最小化中断对给定重要标准的影响。我们证明了这一问题的非确定性多项式时间难度,并提出了一种高效的启发式方法。该方法通过将问题简化为最短路径搜索来寻找好的解决方案,其中链路故障的重要性被视为链路权重,与其他路由方法相比,该方法能抑制中断影响。此外,对网络模型、故障元素平均修复时间(MTTR)和重要性标准之间的系统依赖性分析表明,考虑 MTTR、重要性标准和路由方法的整体系统设计可显著降低重大故障对光网络的影响。
{"title":"Routing problem for reducing significant outages in optical networks and its system analysis","authors":"Katsuaki Higashimori;Takafumi Tanaka;Takeru Inoue","doi":"10.1364/JOCN.520509","DOIUrl":"10.1364/JOCN.520509","url":null,"abstract":"Optical communication networks are operated with great care to avoid outages. In particular, significant outages having a devastating impact on society must be avoided, and several countries specify “significance standards” for network outages. Although the impact of possible outages strongly depends on routing methods for requested connections, there has been no research specifically on these standards. This paper for the first time, to the best of our knowledge, introduces a routing problem to minimize the impact of outages on a given significance standard. We have shown this problem to be non-deterministic polynomial-time hardness, and an efficient heuristic method is proposed. This method searches for a good solution by reducing the problem to a shortest-path search, where the significance of a link failure is regarded as the link weight, and suppresses outage impact compared with other routing methods. In addition, the analysis of the system dependence among a network model, mean time to repair (MTTR) of failure elements, and significance standards suggests that the total system design considering the MTTR, significance standards, and routing method could dramatically reduce the impact of significant outages on optical networks.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 9","pages":"E1-E10"},"PeriodicalIF":4.0,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10634843","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141663860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Symmetry-free routing and spectrum assignment: a universal algorithm based on first-fit 无对称路由和频谱分配:基于首次拟合的通用算法
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-13 DOI: 10.1364/JOCN.521978
George N. Rouskas
First-fit (FF) is a well-known and widely deployed algorithm for spectrum assignment (SA), but until our recent study [J. Opt. Commun. Netw.14, 165 (2022)], investigations of the algorithm had been experimental in nature and no formal properties of the algorithm with respect to SA were known. In this work, we make two contributions. First, we show that FF is a universal algorithm for the SA problem in the sense that, for any variant, 1) it can be used to construct solutions equivalent to, or better than, any solution obtained by any other algorithm, and 2) it can construct an optimal solution. This universality property applies to both the min-max and min-frag objectives and to variants of the SA problem with or without guard band constraints. Consequently, the spectrum symmetry-free model of our recent study [J. Opt. Commun. Netw.14, 165 (2022)] extends to all known SA variants, which therefore reduce to permutation problems. Second, we extend the spectrum symmetry-free model to the routing and spectrum assignment (RSA) problem in general topologies. This model allows for the design of more efficient algorithms as it eliminates from consideration an exponential number of equivalent symmetric solutions. By sidestepping symmetry, the RSA solution space is naturally and optimally decomposed into a routing space and a connection permutation space. Building upon this property, we introduce a two-parameter, symmetry-free universal algorithm that can be used to tackle any RSA variant in a uniform manner. The algorithm is amenable to multi-threaded execution to speed up the search process, and the value of the parameters can be adjusted to strike a balance between running time and solution quality. Our evaluation provides insight into the relative benefits of path diversity (which determines the size of the routing space) and connection diversity (which determines the size of the permutation space).
First-fit (FF) 是一种众所周知并被广泛应用的频谱分配(SA)算法,但在我们最近的研究[J. Opt. Commun. Netw.14, 165 (2022)]之前,对该算法的研究一直是实验性质的,而且不知道该算法在频谱分配方面的正式特性。在这项工作中,我们有两个贡献。首先,我们证明了 FF 是 SA 问题的通用算法,即对于任何变体,1)它都可以用来构建等同于或优于任何其他算法得到的解,2)它可以构建最优解。这一普遍性既适用于最小最大目标和最小碎片目标,也适用于有或无保护带约束的 SA 问题变体。因此,我们最近研究的无频谱对称模型[J. Opt. Commun. Netw.14, 165 (2022)]可扩展到所有已知的 SA 变体,从而简化为置换问题。其次,我们将无频谱对称模型扩展到一般拓扑结构中的路由和频谱分配(RSA)问题。这一模型可以设计出更高效的算法,因为它消除了指数级数量的等效对称解。通过避开对称性,RSA 解决方案空间被自然、优化地分解为路由空间和连接置换空间。基于这一特性,我们引入了一种双参数、无对称的通用算法,可用于以统一的方式处理任何 RSA 变体。该算法适合多线程执行,以加快搜索过程,而且可以调整参数值,在运行时间和解决方案质量之间取得平衡。我们的评估深入分析了路径多样性(决定路由空间的大小)和连接多样性(决定排列空间的大小)的相对优势。
{"title":"Symmetry-free routing and spectrum assignment: a universal algorithm based on first-fit","authors":"George N. Rouskas","doi":"10.1364/JOCN.521978","DOIUrl":"10.1364/JOCN.521978","url":null,"abstract":"First-fit (FF) is a well-known and widely deployed algorithm for spectrum assignment (SA), but until our recent study [J. Opt. Commun. Netw.14, 165 (2022)], investigations of the algorithm had been experimental in nature and no formal properties of the algorithm with respect to SA were known. In this work, we make two contributions. First, we show that FF is a universal algorithm for the SA problem in the sense that, for any variant, 1) it can be used to construct solutions equivalent to, or better than, any solution obtained by any other algorithm, and 2) it can construct an optimal solution. This universality property applies to both the min-max and min-frag objectives and to variants of the SA problem with or without guard band constraints. Consequently, the spectrum symmetry-free model of our recent study [J. Opt. Commun. Netw.14, 165 (2022)] extends to all known SA variants, which therefore reduce to permutation problems. Second, we extend the spectrum symmetry-free model to the routing and spectrum assignment (RSA) problem in general topologies. This model allows for the design of more efficient algorithms as it eliminates from consideration an exponential number of equivalent symmetric solutions. By sidestepping symmetry, the RSA solution space is naturally and optimally decomposed into a routing space and a connection permutation space. Building upon this property, we introduce a two-parameter, symmetry-free universal algorithm that can be used to tackle any RSA variant in a uniform manner. The algorithm is amenable to multi-threaded execution to speed up the search process, and the value of the parameters can be adjusted to strike a balance between running time and solution quality. Our evaluation provides insight into the relative benefits of path diversity (which determines the size of the routing space) and connection diversity (which determines the size of the permutation space).","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 9","pages":"E11-E22"},"PeriodicalIF":4.0,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141663277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DNN distributed inference offloading scheme based on transfer reinforcement learning in metro optical networks 城域光网络中基于转移强化学习的 DNN 分布式推理卸载方案
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-09 DOI: 10.1364/JOCN.533206
Shan Yin;Lihao Liu;Mengru Cai;Yutong Chai;Yurong Jiao;Zheng Duan;Yian Li;Shanguo Huang
With the development of 5G and mobile edge computing, deep neural network (DNN) inference can be distributed at the edge to reduce communication overhead and inference time, namely, DNN distributed inference. DNN distributed inference will pose challenges to the resource allocation problem in metro optical networks (MONs). Efficient cooperative allocation of optical communication and computational resources can facilitate high-bandwidth and low-latency applications. However, it also introduces greater complexity to the resource allocation problem. In this study, we propose a joint resource allocation method using high-performance transfer deep reinforcement learning (T-DRL) to maximize network throughput. When the topologies or characteristics of MONs change, T-DRL requires only a small amount of transfer training to re-converge. Considering that the generalizability of conventional methods is inversely related to optimization performance, we develop two deployment schemes (i.e., single-agent and multi-agent) based on the T-DRL method to explore the performance of T-DRL. Simulation results demonstrate that T-DRL greatly reduces the blocking probability and average inference time of DNN inference requests. Besides, the multi-agent scheme can maintain a lower blocking probability of requests in MONs, while the single-agent has a shorter convergence time after network changes.
随着 5G 和移动边缘计算的发展,深度神经网络(DNN)推理可以分布在边缘,以减少通信开销和推理时间,即 DNN 分布式推理。DNN 分布式推理将对城域光网络(MON)中的资源分配问题提出挑战。光通信和计算资源的高效协同分配可促进高带宽和低延迟应用。然而,这也给资源分配问题带来了更大的复杂性。在本研究中,我们提出了一种使用高性能传输深度强化学习(T-DRL)的联合资源分配方法,以最大限度地提高网络吞吐量。当 MON 的拓扑结构或特征发生变化时,T-DRL 只需少量的迁移训练即可重新收敛。考虑到传统方法的通用性与优化性能成反比,我们开发了两种基于 T-DRL 方法的部署方案(即单代理和多代理),以探索 T-DRL 的性能。仿真结果表明,T-DRL 大大降低了 DNN 推理请求的阻塞概率和平均推理时间。此外,多代理方案能在 MONs 中保持较低的请求阻塞概率,而单代理方案在网络变化后的收敛时间较短。
{"title":"DNN distributed inference offloading scheme based on transfer reinforcement learning in metro optical networks","authors":"Shan Yin;Lihao Liu;Mengru Cai;Yutong Chai;Yurong Jiao;Zheng Duan;Yian Li;Shanguo Huang","doi":"10.1364/JOCN.533206","DOIUrl":"10.1364/JOCN.533206","url":null,"abstract":"With the development of 5G and mobile edge computing, deep neural network (DNN) inference can be distributed at the edge to reduce communication overhead and inference time, namely, DNN distributed inference. DNN distributed inference will pose challenges to the resource allocation problem in metro optical networks (MONs). Efficient cooperative allocation of optical communication and computational resources can facilitate high-bandwidth and low-latency applications. However, it also introduces greater complexity to the resource allocation problem. In this study, we propose a joint resource allocation method using high-performance transfer deep reinforcement learning (T-DRL) to maximize network throughput. When the topologies or characteristics of MONs change, T-DRL requires only a small amount of transfer training to re-converge. Considering that the generalizability of conventional methods is inversely related to optimization performance, we develop two deployment schemes (i.e., single-agent and multi-agent) based on the T-DRL method to explore the performance of T-DRL. Simulation results demonstrate that T-DRL greatly reduces the blocking probability and average inference time of DNN inference requests. Besides, the multi-agent scheme can maintain a lower blocking probability of requests in MONs, while the single-agent has a shorter convergence time after network changes.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 9","pages":"852-867"},"PeriodicalIF":4.0,"publicationDate":"2024-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141668118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Space optical communication system for space optical networks and deep space exploration 用于空间光网络和深空探索的空间光通信系统
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-08 DOI: 10.1364/JOCN.520301
Jianmin Wang;Bin Li;Haochun Gao;Yang Lin;Zhiqian Su
The acquisition time of tens to hundreds of seconds in the optical link between satellites makes it difficult to meet the needs of constructing spatial optical networks. In addition, as a basic requirement for deep space explorers, autonomous attitude determination and autonomous navigation demand the installation of separate, expensive, and complex inertial devices, and the communication data rate is too low to meet the timely transmission of large amounts of data. In this paper, we proposed and developed a multifunctional fusion space optical communication system for space optical networks and deep space exploration, which has the functions of autonomous attitude determination, autonomous navigation, and high-speed optical communication. The sub-second acquisition time can meet the requirements of space optical network construction, and the ability of autonomous attitude determination and autonomous navigation significantly reduce the amount of R&D expenses of the explorer; decrease the volume, weight, and power consumption of the explorer; and improve the reliability and autonomous survival ability of the explorer. The paper provides the structure, working principle, and main algorithm models and conducts a feasibility analysis and field experiments. The experimental results showed that the average open-loop pointing accuracy of the optical terminal is 95.8 µrad (attitude determination accuracy), which can be improved to 39.1 µrad after filtering, and the acquisition time is less than 1 s. For deep space exploration, the navigation accuracy is less than 67.6 km in the cruise phase and 10 km in the acquisition phase, and field experiments have also proven its feasibility. The significance of our research work lies in proposing what we believe to be a new system operation scheme and design method for optical communication systems, and its results can be widely applied in all fields of space optical communication.
卫星间光链路的采集时间长达几十秒到几百秒,难以满足空间光网络建设的需要。此外,作为深空探测者的基本要求,自主姿态确定和自主导航需要安装独立、昂贵、复杂的惯性设备,而通信数据速率太低,无法满足大量数据的及时传输。本文针对空间光网络和深空探测,提出并研制了一种多功能融合空间光通信系统,该系统具有自主姿态确定、自主导航和高速光通信功能。亚秒级的采集时间可以满足空间光网络建设的要求,自主姿态确定和自主导航能力大大降低了探索者的研发费用,减少了探索者的体积、重量和功耗,提高了探索者的可靠性和自主生存能力。本文提供了该系统的结构、工作原理和主要算法模型,并进行了可行性分析和现场实验。实验结果表明,光学终端的平均开环指向精度为 95.8 µrad(姿态确定精度),滤波后可提高到 39.1 µrad,采集时间小于 1 s;对于深空探测,巡航阶段的导航精度小于 67.6 km,采集阶段的导航精度小于 10 km,现场实验也证明了其可行性。我们的研究工作的意义在于提出了我们认为是光通信系统的一种新的系统运行方案和设计方法,其成果可广泛应用于空间光通信的各个领域。
{"title":"Space optical communication system for space optical networks and deep space exploration","authors":"Jianmin Wang;Bin Li;Haochun Gao;Yang Lin;Zhiqian Su","doi":"10.1364/JOCN.520301","DOIUrl":"10.1364/JOCN.520301","url":null,"abstract":"The acquisition time of tens to hundreds of seconds in the optical link between satellites makes it difficult to meet the needs of constructing spatial optical networks. In addition, as a basic requirement for deep space explorers, autonomous attitude determination and autonomous navigation demand the installation of separate, expensive, and complex inertial devices, and the communication data rate is too low to meet the timely transmission of large amounts of data. In this paper, we proposed and developed a multifunctional fusion space optical communication system for space optical networks and deep space exploration, which has the functions of autonomous attitude determination, autonomous navigation, and high-speed optical communication. The sub-second acquisition time can meet the requirements of space optical network construction, and the ability of autonomous attitude determination and autonomous navigation significantly reduce the amount of R&D expenses of the explorer; decrease the volume, weight, and power consumption of the explorer; and improve the reliability and autonomous survival ability of the explorer. The paper provides the structure, working principle, and main algorithm models and conducts a feasibility analysis and field experiments. The experimental results showed that the average open-loop pointing accuracy of the optical terminal is 95.8 µrad (attitude determination accuracy), which can be improved to 39.1 µrad after filtering, and the acquisition time is less than 1 s. For deep space exploration, the navigation accuracy is less than 67.6 km in the cruise phase and 10 km in the acquisition phase, and field experiments have also proven its feasibility. The significance of our research work lies in proposing what we believe to be a new system operation scheme and design method for optical communication systems, and its results can be widely applied in all fields of space optical communication.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 9","pages":"843-851"},"PeriodicalIF":4.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141673905","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Double-link-failure-tolerant shared protection for fully coupled/half-split switchable point-to-multipoint coherent optical systems 全耦合/半分离可切换点对多点相干光系统的双链路容错共享保护
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-07 DOI: 10.1364/JOCN.511029
Takahiro Kodama;Tomoya Nakagawa;Shota Eguchi;Keiji Shimada;Ryosuke Matsumoto
Beyond 5G, the next-generation wireless communication standard requires an optical communication network with a more reliable point-to-multipoint system. A highly reliable, futuristic point-to-multipoint coherent optical system must update wavelength-division-multiplexing-based passive optical networks to a more disaster-resistant architecture that can switch between bypass and backup links. We propose, to our knowledge, a novel link-pair shared protection that can respond locally to double-link failures that result from a significant disaster. We validate the high availability of several network configurations, assuming a double-link disconnection, can be obtained irrespective of the transmission distance of the feeder fiber. We experimentally demonstrate link-pair shared protection with bidirectional wavelength pre-assignment for two of the four feeder fiber failures and validate a penalty of less than 2 dB for double-link failures. Furthermore, we prove that reconnection can be performed with a penalty of at most 2 dB in an experiment with shared protection with a single-link broadcast-and-select function that can manage partial double-link failures using a simple configuration.
在 5G 之后,下一代无线通信标准要求光通信网络具备更可靠的点对多点系统。高可靠性的未来型点对多点相干光系统必须将基于波分复用技术的无源光网络更新为能在旁路和备份链路之间切换的抗灾能力更强的架构。据我们所知,我们提出了一种新型链路对共享保护方式,可在本地响应重大灾难导致的双链路故障。我们验证了几种网络配置的高可用性,假设双链路断开,无论馈线光纤的传输距离有多远,都能获得高可用性。我们在实验中演示了链路对共享保护与双向波长预分配,可应对四种馈线光纤故障中的两种故障,并验证了双链路故障的惩罚小于 2 dB。此外,我们还证明,在具有单链路广播和选择功能的共享保护实验中,使用简单的配置就能管理部分双链路故障,并能以最多 2 dB 的惩罚进行重新连接。
{"title":"Double-link-failure-tolerant shared protection for fully coupled/half-split switchable point-to-multipoint coherent optical systems","authors":"Takahiro Kodama;Tomoya Nakagawa;Shota Eguchi;Keiji Shimada;Ryosuke Matsumoto","doi":"10.1364/JOCN.511029","DOIUrl":"10.1364/JOCN.511029","url":null,"abstract":"Beyond 5G, the next-generation wireless communication standard requires an optical communication network with a more reliable point-to-multipoint system. A highly reliable, futuristic point-to-multipoint coherent optical system must update wavelength-division-multiplexing-based passive optical networks to a more disaster-resistant architecture that can switch between bypass and backup links. We propose, to our knowledge, a novel link-pair shared protection that can respond locally to double-link failures that result from a significant disaster. We validate the high availability of several network configurations, assuming a double-link disconnection, can be obtained irrespective of the transmission distance of the feeder fiber. We experimentally demonstrate link-pair shared protection with bidirectional wavelength pre-assignment for two of the four feeder fiber failures and validate a penalty of less than 2 dB for double-link failures. Furthermore, we prove that reconnection can be performed with a penalty of at most 2 dB in an experiment with shared protection with a single-link broadcast-and-select function that can manage partial double-link failures using a simple configuration.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 9","pages":"832-842"},"PeriodicalIF":4.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141686877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Power over fiber in radio access networks: 5G and beyond 无线接入网络中的光纤供电:5G 及其他
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-02 DOI: 10.1364/JOCN.522900
Carmen Vazquez;Ruben Altuna;Juan Dayron Lopez-Cardona
This paper introduces the concept of power over fiber (PoF) and potential applications envisioned in radio access networks with optical fronthauling using different types of optical fibers. It is an open discussion on exploring PoF technology with current experiments integrating analog radio over fiber using 5G-NR signals in compliance with 3GPP, PoF, and monitoring techniques and general requirements in future deployments along with its potential to be part of the energy efficiency strategy in beyond 5G networks.
本文介绍了光纤功率(PoF)的概念,以及在使用不同类型光纤的光前传(optical frontthauling)无线接入网络中的潜在应用设想。本文公开讨论了如何探索 PoF 技术,当前的实验集成了光纤模拟无线电,使用符合 3GPP 标准的 5G-NR 信号、PoF、监测技术和未来部署的一般要求,以及其成为超越 5G 网络能效战略一部分的潜力。
{"title":"Power over fiber in radio access networks: 5G and beyond","authors":"Carmen Vazquez;Ruben Altuna;Juan Dayron Lopez-Cardona","doi":"10.1364/JOCN.522900","DOIUrl":"10.1364/JOCN.522900","url":null,"abstract":"This paper introduces the concept of power over fiber (PoF) and potential applications envisioned in radio access networks with optical fronthauling using different types of optical fibers. It is an open discussion on exploring PoF technology with current experiments integrating analog radio over fiber using 5G-NR signals in compliance with 3GPP, PoF, and monitoring techniques and general requirements in future deployments along with its potential to be part of the energy efficiency strategy in beyond 5G networks.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 8","pages":"D119-D128"},"PeriodicalIF":4.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141666740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Transceiver impairment robust and joint monitoring of PDL, DGD, and CD using frequency domain pilot tones for digital subcarrier multiplexing systems 利用频域先导音对数字副载波多路复用系统的 PDL、DGD 和 CD 进行收发器损伤稳健和联合监测
IF 4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2024-08-02 DOI: 10.1364/JOCN.525128
Linsheng Fan;Yanfu Yang;Qun Zhang;Siyu Gong;Yuchen Jia;Chen Cheng;Yong Yao
Optical performance monitoring is vital for enabling dynamically reconfigurable optical networks. This paper introduces a monitoring scheme that is robust to transceiver impairments for coherent digital subcarrier multiplexing (DSCM) systems that simultaneously monitors polarization-dependent loss (PDL), differential group delay (DGD), and chromatic dispersion (CD). In the proposed scheme, a pair of frequency domain pilot tones (FPTs) are inserted into the ${X}$ and ${Y}$ polarizations of the transmitted dual-polarization signal. Both the signal and the FPTs endure identical channel impairments during fiber transmission. At the receiver side, the transmitted FPTs are extracted to monitor the channel impairments. We begin by establishing a simplified system model using a single frequency tone to analyze the effects of system impairments on the frequency domain pilots. Based on this model, CD, PDL, and DGD are jointly and accurately estimated. In addition, the influences of temporal, amplitude, and phase mismatches between in-phase (I) and quadrature (Q) components of transceivers on channel impairment monitoring are completely eliminated. This achieves a channel impairment monitoring scheme that is robust to transceiver impairments. Experimental verification shows that the proposed scheme can jointly and accurately estimate a wide range of CD, PDL, and DGD. Additionally, the proposed monitoring scheme demonstrates strong robustness against transceiver impairments, rapid polarization fluctuations, and amplified spontaneous emission (ASE) noise.
光性能监测对于实现动态可重构光网络至关重要。本文介绍了一种对相干数字子载波多路复用(DSCM)系统的收发器损伤具有鲁棒性的监测方案,可同时监测偏振相关损耗(PDL)、差分群延迟(DGD)和色度色散(CD)。在提议的方案中,一对频域先导音(FPT)被插入到传输的双极化信号的 X 极化和 Y 极化中。在光纤传输过程中,信号和 FPT 都会受到相同的信道损伤。在接收端,通过提取传输的 FPT 来监测信道损伤。我们首先使用单个频率音建立一个简化的系统模型,以分析系统损伤对频域飞行员的影响。在此模型的基础上,CD、PDL 和 DGD 被联合准确地估算出来。此外,还完全消除了收发器同相(I)和正交(Q)分量之间的时间、振幅和相位不匹配对信道损伤监测的影响。这就实现了对收发器损伤具有鲁棒性的信道损伤监测方案。实验验证表明,所提出的方案可以联合并准确地估计各种 CD、PDL 和 DGD。此外,所提出的监测方案对收发器损伤、快速极化波动和放大自发辐射(ASE)噪声具有很强的鲁棒性。
{"title":"Transceiver impairment robust and joint monitoring of PDL, DGD, and CD using frequency domain pilot tones for digital subcarrier multiplexing systems","authors":"Linsheng Fan;Yanfu Yang;Qun Zhang;Siyu Gong;Yuchen Jia;Chen Cheng;Yong Yao","doi":"10.1364/JOCN.525128","DOIUrl":"10.1364/JOCN.525128","url":null,"abstract":"Optical performance monitoring is vital for enabling dynamically reconfigurable optical networks. This paper introduces a monitoring scheme that is robust to transceiver impairments for coherent digital subcarrier multiplexing (DSCM) systems that simultaneously monitors polarization-dependent loss (PDL), differential group delay (DGD), and chromatic dispersion (CD). In the proposed scheme, a pair of frequency domain pilot tones (FPTs) are inserted into the \u0000<tex>${X}$</tex>\u0000 and \u0000<tex>${Y}$</tex>\u0000 polarizations of the transmitted dual-polarization signal. Both the signal and the FPTs endure identical channel impairments during fiber transmission. At the receiver side, the transmitted FPTs are extracted to monitor the channel impairments. We begin by establishing a simplified system model using a single frequency tone to analyze the effects of system impairments on the frequency domain pilots. Based on this model, CD, PDL, and DGD are jointly and accurately estimated. In addition, the influences of temporal, amplitude, and phase mismatches between in-phase (I) and quadrature (Q) components of transceivers on channel impairment monitoring are completely eliminated. This achieves a channel impairment monitoring scheme that is robust to transceiver impairments. Experimental verification shows that the proposed scheme can jointly and accurately estimate a wide range of CD, PDL, and DGD. Additionally, the proposed monitoring scheme demonstrates strong robustness against transceiver impairments, rapid polarization fluctuations, and amplified spontaneous emission (ASE) noise.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 8","pages":"822-831"},"PeriodicalIF":4.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141865754","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Optical Communications and Networking
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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