Considering the scattering feature in the ultraviolet (UV) spectrum that can support communication for mobile unmanned aerial vehicles (UAVs), we deploy UAVs equipped with UV communication. Specifically, we focus on ground-to-air UV networks where the UAV collects data from the ground nodes. Assuming that the ground nodes are distributed in two dimensions, we analyze the air-ground connectivity probability. The influence of the transmitter divergence angle on the connectivity probability is investigated. Then, we analyze the probability that there exists interference from multiple nodes. To guarantee reliable communication under such interference, we further propose a handshaking-based UAV access protocol. By solving the coloring problem, we determine the time slot allocation for handshaking and propose a greedy channel allocation method to maximize the average system throughput. Numerical results show the performance gain of the proposed protocol over existing works.
{"title":"Connectivity analysis and user access design of ground-to-air ultraviolet communication networks","authors":"Lei Sun;Chen Gong;Zhengyuan Xu","doi":"10.1364/JOCN.527611","DOIUrl":"https://doi.org/10.1364/JOCN.527611","url":null,"abstract":"Considering the scattering feature in the ultraviolet (UV) spectrum that can support communication for mobile unmanned aerial vehicles (UAVs), we deploy UAVs equipped with UV communication. Specifically, we focus on ground-to-air UV networks where the UAV collects data from the ground nodes. Assuming that the ground nodes are distributed in two dimensions, we analyze the air-ground connectivity probability. The influence of the transmitter divergence angle on the connectivity probability is investigated. Then, we analyze the probability that there exists interference from multiple nodes. To guarantee reliable communication under such interference, we further propose a handshaking-based UAV access protocol. By solving the coloring problem, we determine the time slot allocation for handshaking and propose a greedy channel allocation method to maximize the average system throughput. Numerical results show the performance gain of the proposed protocol over existing works.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"1006-1017"},"PeriodicalIF":4.0,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142316347","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}
In datacenters, bursty and unevenly distributed traffic may lead to serious network performance degradation. Various methods, including reconfigurable optical circuit switching (OCS), traffic control techniques, valiant load balancing (VLB), and so on, have been proposed to solve this problem. Based on these solutions, our method makes a trade-off between cost and performance. In this paper, we propose to use multi-wavelength tunable transmitters in our previously proposed modular arrayed waveguide grating (AWG)-based interconnection network. We discuss how the multiple wavelengths can be shared in the network and then propose a computational model to study its blocking probability. Closed-form equations for low network load cases are also derived to provide the analytical expression for the blocking probability. We verify the accuracy of our computational model through simulations. Comparing the blocking probability of networks with and without multi-wavelength integrated transmitters, we show that network performance can be considerably improved after replacement. When traffic burstiness is 1.25 and traffic skewness is 0.08, the blocking probability is reduced from 0.14 to $3.60 times {10^{- 3}}$ after replacing in each sending module one fixed laser with multi-wavelength tunable transmitters with four wavelengths. Furthermore, we also discuss how different factors influence the blocking probability and the maximum load with the given network performance requirement.
{"title":"Dynamic capacity sharing with multi-wavelength integrated transmitters in hybrid datacenter networks","authors":"Jiawen Zhu;Weiqiang Sun;Tong Ye;Weisheng Hu","doi":"10.1364/JOCN.528443","DOIUrl":"https://doi.org/10.1364/JOCN.528443","url":null,"abstract":"In datacenters, bursty and unevenly distributed traffic may lead to serious network performance degradation. Various methods, including reconfigurable optical circuit switching (OCS), traffic control techniques, valiant load balancing (VLB), and so on, have been proposed to solve this problem. Based on these solutions, our method makes a trade-off between cost and performance. In this paper, we propose to use multi-wavelength tunable transmitters in our previously proposed modular arrayed waveguide grating (AWG)-based interconnection network. We discuss how the multiple wavelengths can be shared in the network and then propose a computational model to study its blocking probability. Closed-form equations for low network load cases are also derived to provide the analytical expression for the blocking probability. We verify the accuracy of our computational model through simulations. Comparing the blocking probability of networks with and without multi-wavelength integrated transmitters, we show that network performance can be considerably improved after replacement. When traffic burstiness is 1.25 and traffic skewness is 0.08, the blocking probability is reduced from 0.14 to \u0000<tex>$3.60 times {10^{- 3}}$</tex>\u0000 after replacing in each sending module one fixed laser with multi-wavelength tunable transmitters with four wavelengths. Furthermore, we also discuss how different factors influence the blocking probability and the maximum load with the given network performance requirement.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"990-1005"},"PeriodicalIF":4.0,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142274969","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}
Hirotaka Ujikawa;Yuka Okamoto;Takumi Harada;Tatsuya Shimada;Tomoaki Yoshida
This paper proposes an optical-wireless cooperative control method to guarantee end-to-end delays in the case of radio quality degradation in wireless networks by switching optical paths. The method leverages the control information from mobile systems to dynamically switch the optical path between the distributed unit (DU) and the far aggregated central unit (CU) to another path forward to the nearest virtualized central unit (vCU) at the edge sight, on the basis of the radio quality. This enables demanding applications that require a combination of high bandwidth and low latency, such as remote operation using drones. Preliminary simulations were conducted to investigate the effect of quality degradation in the wireless domain and the potential effectiveness of the proposed delay compensation method. In the experiments conducted to verify the feasibility of the proposed method, the results demonstrated that the optical path switching was successfully performed without packet loss and within 4 ms from the transmission of the control frame. The proposed method was also able to correctly switch back when the processing rate of mobile edge computing (MEC) was exceeded after the radio quality recovered. This study demonstrates the effectiveness of further coordination between wired and wireless control for a wider range of real-time applications using video.
{"title":"Real-time optical-wireless cooperative switching on wireless quality degradation for end-to-end video delay guarantee","authors":"Hirotaka Ujikawa;Yuka Okamoto;Takumi Harada;Tatsuya Shimada;Tomoaki Yoshida","doi":"10.1364/JOCN.522729","DOIUrl":"https://doi.org/10.1364/JOCN.522729","url":null,"abstract":"This paper proposes an optical-wireless cooperative control method to guarantee end-to-end delays in the case of radio quality degradation in wireless networks by switching optical paths. The method leverages the control information from mobile systems to dynamically switch the optical path between the distributed unit (DU) and the far aggregated central unit (CU) to another path forward to the nearest virtualized central unit (vCU) at the edge sight, on the basis of the radio quality. This enables demanding applications that require a combination of high bandwidth and low latency, such as remote operation using drones. Preliminary simulations were conducted to investigate the effect of quality degradation in the wireless domain and the potential effectiveness of the proposed delay compensation method. In the experiments conducted to verify the feasibility of the proposed method, the results demonstrated that the optical path switching was successfully performed without packet loss and within 4 ms from the transmission of the control frame. The proposed method was also able to correctly switch back when the processing rate of mobile edge computing (MEC) was exceeded after the radio quality recovered. This study demonstrates the effectiveness of further coordination between wired and wireless control for a wider range of real-time applications using video.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"981-989"},"PeriodicalIF":4.0,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142246370","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}
Mohammad M. Hosseini;Joao Pedro;Nelson Costa;Carlos Castro;Antonio Napoli
Cutting-edge network architectures and solutions are needed to empower operators to address capacity demands in metro and access networks efficiently. The horseshoe topology, along with similar topologies, is commonly employed in metro-aggregation segments due to its compatibility with the hub-and-spoke traffic pattern present in these networks and the survivability that they can provide. A filterless architecture can enhance cost-effectiveness by replacing active elements with passive components. Moreover, supporting coherent-based point-to-multipoint transceivers—enabled by digital subcarrier multiplexing (DSCM)—can yield additional cost savings. It is noteworthy that telecommunication network topologies often evolve to accommodate more end (leaf) nodes, extending the original horseshoe with spurs or small and short trees. This paper targets these types of networks and proposes combining the utilization of coherent pluggable transceivers leveraging DSCM to guarantee transparent communication between the hub and leaf nodes while adopting different filterless node architectures with selective amplifier deployment. Moreover, it discusses the potential advantages of the architecture using an exact optimization framework tailored to various network sizes and scenarios, which accounts for the amplifiers’ placement and the available types of power splitters/combiners/couplers. The results demonstrate that strategically deploying add/drop and express amplifiers, along with optimizing coupler ratios, can effectively meet design requirements while minimizing the number of optical amplifiers required.
{"title":"Optimized design of horseshoe-and-spur filterless networks leveraging point-to-multipoint coherent pluggable transceivers","authors":"Mohammad M. Hosseini;Joao Pedro;Nelson Costa;Carlos Castro;Antonio Napoli","doi":"10.1364/JOCN.529546","DOIUrl":"https://doi.org/10.1364/JOCN.529546","url":null,"abstract":"Cutting-edge network architectures and solutions are needed to empower operators to address capacity demands in metro and access networks efficiently. The horseshoe topology, along with similar topologies, is commonly employed in metro-aggregation segments due to its compatibility with the hub-and-spoke traffic pattern present in these networks and the survivability that they can provide. A filterless architecture can enhance cost-effectiveness by replacing active elements with passive components. Moreover, supporting coherent-based point-to-multipoint transceivers—enabled by digital subcarrier multiplexing (DSCM)—can yield additional cost savings. It is noteworthy that telecommunication network topologies often evolve to accommodate more end (leaf) nodes, extending the original horseshoe with spurs or small and short trees. This paper targets these types of networks and proposes combining the utilization of coherent pluggable transceivers leveraging DSCM to guarantee transparent communication between the hub and leaf nodes while adopting different filterless node architectures with selective amplifier deployment. Moreover, it discusses the potential advantages of the architecture using an exact optimization framework tailored to various network sizes and scenarios, which accounts for the amplifiers’ placement and the available types of power splitters/combiners/couplers. The results demonstrate that strategically deploying add/drop and express amplifiers, along with optimizing coupler ratios, can effectively meet design requirements while minimizing the number of optical amplifiers required.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"969-980"},"PeriodicalIF":4.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142246417","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}
Quantum key distribution (QKD) networks are expected to enable information-theoretical secure (ITS) communication over a large-scale network. Most research on relay-based QKD networks assumes all relays or nodes are completely trustworthy. However, this assumption is unreasonable because the malicious behavior of even a single node can undermine the security of the entire network. Currently, there is no method to directly distinguish between honest nodes and malicious nodes. Moreover, the status of nodes as honest or malicious can be dynamic. Therefore, a solution is needed that can withstand a certain proportion of malicious nodes in QKD networks. We propose a novel paradigm, inspired by distributed systems, to address the active and passive attacks by collaborating with malicious nodes in QKD networks. First, regarding security, we propose the ITS distributed authentication scheme, which additionally ensures two crucial security properties to QKD networks: identity unforgeability and non-repudiation. Second, concerning correctness, we propose an ITS fault-tolerant consensus scheme based on our ITS distributed authentication to ensure global consistency. This enables participating nodes to collaborate correctly and complete end-to-end key distribution within a constant number of communication rounds. Through our simulation, we have shown that our scheme exhibits a significantly lower growth trend in key consumption compared to the original end-to-end pre-shared keys scheme. For instance, in larger networks, such as when the number of nodes is 80, our scheme’s key consumption is only 13.1% of the pre-shared keys scheme.
量子密钥分发（QKD）网络有望在大规模网络上实现信息理论安全（ITS）通信。关于基于中继的 QKD 网络的大多数研究都假设所有中继或节点都是完全可信的。然而，这种假设是不合理的，因为即使是单个节点的恶意行为也会破坏整个网络的安全性。目前，还没有直接区分诚实节点和恶意节点的方法。此外，节点的诚实或恶意状态可能是动态的。因此，我们需要一种能承受 QKD 网络中一定比例恶意节点的解决方案。受分布式系统的启发，我们提出了一种新的范例，通过与 QKD 网络中的恶意节点合作来解决主动和被动攻击问题。首先，在安全性方面，我们提出了 ITS 分布式验证方案，该方案还能确保 QKD 网络的两个关键安全属性：身份不可伪造性和不可抵赖性。其次，在正确性方面，我们提出了基于 ITS 分布式验证的 ITS 容错共识方案，以确保全局一致性。这使得参与节点能够正确协作，并在一定的通信轮数内完成端到端的密钥分发。通过仿真，我们发现与原始的端到端预共享密钥方案相比，我们的方案在密钥消耗方面的增长趋势要低得多。例如，在节点数为 80 个的大型网络中，我们方案的密钥消耗量仅为预共享密钥方案的 13.1%。
{"title":"Distributed information-theoretical secure protocols for quantum key distribution networks against malicious nodes","authors":"Yi Luo;Qiong Li;Hao-Kun Mao","doi":"10.1364/JOCN.530575","DOIUrl":"https://doi.org/10.1364/JOCN.530575","url":null,"abstract":"Quantum key distribution (QKD) networks are expected to enable information-theoretical secure (ITS) communication over a large-scale network. Most research on relay-based QKD networks assumes all relays or nodes are completely trustworthy. However, this assumption is unreasonable because the malicious behavior of even a single node can undermine the security of the entire network. Currently, there is no method to directly distinguish between honest nodes and malicious nodes. Moreover, the status of nodes as honest or malicious can be dynamic. Therefore, a solution is needed that can withstand a certain proportion of malicious nodes in QKD networks. We propose a novel paradigm, inspired by distributed systems, to address the active and passive attacks by collaborating with malicious nodes in QKD networks. First, regarding security, we propose the ITS distributed authentication scheme, which additionally ensures two crucial security properties to QKD networks: identity unforgeability and non-repudiation. Second, concerning correctness, we propose an ITS fault-tolerant consensus scheme based on our ITS distributed authentication to ensure global consistency. This enables participating nodes to collaborate correctly and complete end-to-end key distribution within a constant number of communication rounds. Through our simulation, we have shown that our scheme exhibits a significantly lower growth trend in key consumption compared to the original end-to-end pre-shared keys scheme. For instance, in larger networks, such as when the number of nodes is 80, our scheme’s key consumption is only 13.1% of the pre-shared keys scheme.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"956-968"},"PeriodicalIF":4.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142235829","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}
This Special Issue on Intelligent Networks at the Edge contains a collection of invitation-only extensions based on papers presented at the Future Optical Networks and Communications (FONC) Symposium in the IEEE Future Network World Forum (FNWF), 13–15 November 2023, Baltimore, Maryland, USA. We present a brief introduction followed by an overview of the topics covered in the papers.
{"title":"Introduction to the JOCN Special Issue on Intelligent Networks at the Edge","authors":"Daniel Kilper;Lena Wosinska;Zuqing Zhu","doi":"10.1364/JOCN.541552","DOIUrl":"https://doi.org/10.1364/JOCN.541552","url":null,"abstract":"This Special Issue on Intelligent Networks at the Edge contains a collection of invitation-only extensions based on papers presented at the Future Optical Networks and Communications (FONC) Symposium in the IEEE Future Network World Forum (FNWF), 13–15 November 2023, Baltimore, Maryland, USA. We present a brief introduction followed by an overview of the topics covered in the papers.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"INE1-INE1"},"PeriodicalIF":4.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10680855","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142235830","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}
Ensuring the secure and reliable operation of optical networks is crucial for various societal functions. However, optical network infrastructures are susceptible to unauthorized interception, posing a significant security risk at the physical layer. This necessitates the development of effective detection and localization methods of eavesdropping events. To address this challenge, we present a clustering-based method and a comprehensive eavesdropping diagnosis framework tailored for wavelength division multiplexing (WDM) systems. The framework is designed to handle diverse eavesdropping scenarios, including dynamic detection, classification, and localization of eavesdropping events. To mitigate the data dependency issue while detecting and localizing eavesdropping events, we propose a clustering algorithm utilizing basic optical performance monitoring (OPM) data, thus eliminating the need for sophisticated measurement equipment. A coarse localization requires only the OPM data from the receiver, while a finer localization requires the power monitoring data at all nodes as the input. The feasibility of the proposed scheme is validated using simulation-generated data, in which single and multiple eavesdropping can be detected and localized with a 100% label matching rate. Single-point eavesdropping detection and localization are experimentally validated with data collected from a fiber transmission system comprising three spans of 40 km each. Coarse localization with a 99.79% label matching rate and fine localization with 100% accuracy is achieved. As expected, experimental data shows a less concentrated distribution than the simulated data, which leads to inferior clustering results.
{"title":"Cluster-based unsupervised method for eavesdropping detection and localization in WDM systems","authors":"Haokun Song;Rui Lin;Lena Wosinska;Paolo Monti;Mingrui Zhang;Yuyuan Liang;Yajie Li;Jie Zhang","doi":"10.1364/JOCN.531696","DOIUrl":"10.1364/JOCN.531696","url":null,"abstract":"Ensuring the secure and reliable operation of optical networks is crucial for various societal functions. However, optical network infrastructures are susceptible to unauthorized interception, posing a significant security risk at the physical layer. This necessitates the development of effective detection and localization methods of eavesdropping events. To address this challenge, we present a clustering-based method and a comprehensive eavesdropping diagnosis framework tailored for wavelength division multiplexing (WDM) systems. The framework is designed to handle diverse eavesdropping scenarios, including dynamic detection, classification, and localization of eavesdropping events. To mitigate the data dependency issue while detecting and localizing eavesdropping events, we propose a clustering algorithm utilizing basic optical performance monitoring (OPM) data, thus eliminating the need for sophisticated measurement equipment. A coarse localization requires only the OPM data from the receiver, while a finer localization requires the power monitoring data at all nodes as the input. The feasibility of the proposed scheme is validated using simulation-generated data, in which single and multiple eavesdropping can be detected and localized with a 100% label matching rate. Single-point eavesdropping detection and localization are experimentally validated with data collected from a fiber transmission system comprising three spans of 40 km each. Coarse localization with a 99.79% label matching rate and fine localization with 100% accuracy is achieved. As expected, experimental data shows a less concentrated distribution than the simulated data, which leads to inferior clustering results.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"F52-F61"},"PeriodicalIF":4.0,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141929432","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}
Higher-speed passive optical networks (i.e., ITU-T 50G PONs) are envisioned to support various time-sensitive services with diverse quality of service (QoS) requirements (e.g., latency and jitter). To achieve this goal, higher-speed PON introduces multiple queues in each transmission container (T-CONT) so that each queue can carry a type of time-sensitive traffic. However, in the existing dynamic bandwidth allocation (DBA) schemes, the DBA engine in the optical line terminal (OLT) allocates bandwidth to four types of T-CONTs based on their buffer occupancies and priorities without considering queue status (e.g., the amount of data frames in queues) and services’ QoS requirements. To support multiple services belonging to the same T-CONT, the traffic scheduler in each optical network unit (ONU) further assigns the bandwidth of T-CONTs to their associated queues by using priority-based scheduling strategies. In this way, the bandwidth is allocated to queues by the DBA engine and traffic scheduler independently, which cannot guarantee network performance and meet the stringent QoS requirements of time-sensitive services. To solve this problem, we propose a DBA mechanism based on flexible queue management (FQM) to enable direct allocation of bandwidth to the queues under their QoS requirements. The proposed FQM mechanism enables the DBA engine to obtain the arrival time and QoS requirements of data frames in different queues as well as queue status based on the existing report/grant mechanism. By using these parameters, the required bandwidth for each queue in the next polling cycle can be calculated. Then, the DBA engine allocates bandwidth to these queues according to their bandwidth requests and priorities periodically. Simulation results show that the proposed scheme outperforms two benchmarks in the aspects of meeting time-sensitive services’ diverse QoS requirements, even when the traffic load is high.
{"title":"Flexible-queue-management-based bandwidth allocation in higher-speed PONs","authors":"Jun Li;Guanlun Sun;Xiang Lu;Rui Lin;Lena Wosinska","doi":"10.1364/JOCN.525843","DOIUrl":"10.1364/JOCN.525843","url":null,"abstract":"Higher-speed passive optical networks (i.e., ITU-T 50G PONs) are envisioned to support various time-sensitive services with diverse quality of service (QoS) requirements (e.g., latency and jitter). To achieve this goal, higher-speed PON introduces multiple queues in each transmission container (T-CONT) so that each queue can carry a type of time-sensitive traffic. However, in the existing dynamic bandwidth allocation (DBA) schemes, the DBA engine in the optical line terminal (OLT) allocates bandwidth to four types of T-CONTs based on their buffer occupancies and priorities without considering queue status (e.g., the amount of data frames in queues) and services’ QoS requirements. To support multiple services belonging to the same T-CONT, the traffic scheduler in each optical network unit (ONU) further assigns the bandwidth of T-CONTs to their associated queues by using priority-based scheduling strategies. In this way, the bandwidth is allocated to queues by the DBA engine and traffic scheduler independently, which cannot guarantee network performance and meet the stringent QoS requirements of time-sensitive services. To solve this problem, we propose a DBA mechanism based on flexible queue management (FQM) to enable direct allocation of bandwidth to the queues under their QoS requirements. The proposed FQM mechanism enables the DBA engine to obtain the arrival time and QoS requirements of data frames in different queues as well as queue status based on the existing report/grant mechanism. By using these parameters, the required bandwidth for each queue in the next polling cycle can be calculated. Then, the DBA engine allocates bandwidth to these queues according to their bandwidth requests and priorities periodically. Simulation results show that the proposed scheme outperforms two benchmarks in the aspects of meeting time-sensitive services’ diverse QoS requirements, even when the traffic load is high.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"F40-F51"},"PeriodicalIF":4.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141928478","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}
Leitao Wang;Zhiyong Xu;Jingyuan Wang;Jiyong Zhao;Yimin Wang;Jianhua Li
Ultraviolet (UV) optical communication can eliminate aiming, tracking, and pointing systems in conventional free-space optical (FSO) communications, rendering it more suitable for small and micro platforms. Currently, efficient medium access control (MAC) layer protocols for UV optical communication are lacking. To further improve the channel utilization of UV networks, an ultraviolet lossless contention MAC protocol with dynamic bandwidth allocation (UVLLC-DBA) based on optical power superposition was proposed. Simultaneously, the protocol employed token buckets to allocate bandwidth for different services, thereby enabling differentiated services. The simulation results show that the proposed protocol can achieve dynamic bandwidth allocation and has nearly 100% channel utilization and acceptable delay, providing a reference for the development of a UV MAC protocol.
紫外（UV）光通信可以消除传统自由空间光通信（FSO）中的瞄准、跟踪和指向系统，因此更适用于小型和微型平台。目前，紫外光通信还缺乏高效的介质访问控制（MAC）层协议。为进一步提高紫外网络的信道利用率，提出了一种基于光功率叠加的动态带宽分配紫外无损争用 MAC 协议（UVLLC-DBA）。同时，该协议采用令牌桶为不同服务分配带宽，从而实现了差异化服务。仿真结果表明，所提出的协议可实现动态带宽分配，信道利用率接近 100%，延迟可接受，为开发 UV MAC 协议提供了参考。
{"title":"Lossless contention ultraviolet MAC protocol based on dynamic bandwidth allocation","authors":"Leitao Wang;Zhiyong Xu;Jingyuan Wang;Jiyong Zhao;Yimin Wang;Jianhua Li","doi":"10.1364/JOCN.523536","DOIUrl":"https://doi.org/10.1364/JOCN.523536","url":null,"abstract":"Ultraviolet (UV) optical communication can eliminate aiming, tracking, and pointing systems in conventional free-space optical (FSO) communications, rendering it more suitable for small and micro platforms. Currently, efficient medium access control (MAC) layer protocols for UV optical communication are lacking. To further improve the channel utilization of UV networks, an ultraviolet lossless contention MAC protocol with dynamic bandwidth allocation (UVLLC-DBA) based on optical power superposition was proposed. Simultaneously, the protocol employed token buckets to allocate bandwidth for different services, thereby enabling differentiated services. The simulation results show that the proposed protocol can achieve dynamic bandwidth allocation and has nearly 100% channel utilization and acceptable delay, providing a reference for the development of a UV MAC protocol.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"941-955"},"PeriodicalIF":4.0,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142173937","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}
This paper presents a routing, modulation, spectrum, and core assignment (RMSCA) algorithm for space-division-multiplexing-based elastic optical networks (SDM-EONs) comprising multi-core links. A network state-dependent route and core selection method is proposed using a deep neural network (DNN) classifier. The DNN is trained using a metaheuristic optimization algorithm to predict lightpath suitability, considering the quality of transmission and resource availability. Physical layer impairments, including inter-core crosstalk, amplified spontaneous emission, and Kerr fiber nonlinearities, are considered, and a random forest (RF)-based link noise estimator is proposed. A feature importance selection analysis is provided for all the features considered for the DNN classifier and the RF link noise estimator. The proposed machine-learning-enabled RMSCA approach is evaluated on three network topologies, USNET, NSFNET, and COST-239 with 7-core and 12-core fiber links. It is shown to be superior in terms of blocking probability, bandwidth blocking probability, and acceptable computational speed compared to the standard and published benchmarks at different traffic loads.
{"title":"Machine-learning-based impairment-aware dynamic RMSCA in multi-core elastic optical networks","authors":"Jaya Lakshmi Ravipudi;Maite Brandt-Pearce","doi":"10.1364/JOCN.530035","DOIUrl":"https://doi.org/10.1364/JOCN.530035","url":null,"abstract":"This paper presents a routing, modulation, spectrum, and core assignment (RMSCA) algorithm for space-division-multiplexing-based elastic optical networks (SDM-EONs) comprising multi-core links. A network state-dependent route and core selection method is proposed using a deep neural network (DNN) classifier. The DNN is trained using a metaheuristic optimization algorithm to predict lightpath suitability, considering the quality of transmission and resource availability. Physical layer impairments, including inter-core crosstalk, amplified spontaneous emission, and Kerr fiber nonlinearities, are considered, and a random forest (RF)-based link noise estimator is proposed. A feature importance selection analysis is provided for all the features considered for the DNN classifier and the RF link noise estimator. The proposed machine-learning-enabled RMSCA approach is evaluated on three network topologies, USNET, NSFNET, and COST-239 with 7-core and 12-core fiber links. It is shown to be superior in terms of blocking probability, bandwidth blocking probability, and acceptable computational speed compared to the standard and published benchmarks at different traffic loads.","PeriodicalId":50103,"journal":{"name":"Journal of Optical Communications and Networking","volume":"16 10","pages":"F26-F39"},"PeriodicalIF":4.0,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10675734","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142169704","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：