| 1. |
|
|
| 2. |
- Cao, Yuan, et al.
(författare)
-
Hybrid Trusted/Untrusted Relay Based Quantum Key Distribution over Optical Backbone Networks
- 2021
-
Ingår i: IEEE Journal on Selected Areas in Communications. - 0733-8716 .- 1558-0008. ; 39:9, s. 2701-2718
-
Tidskriftsartikel (refereegranskat)abstract
- Quantum key distribution (QKD) has demonstrated a great potential to provide future-proofed security, especially for 5G and beyond communications. As the critical infrastructure for 5G and beyond communications, optical networks can offer a cost-effective solution to QKD deployment utilizing the existing fiber resources. In particular, measurement-device-independent QKD shows its ability to extend the secure distance with the aid of an untrusted relay. Compared to the trusted relay, the untrusted relay has obviously better security, since it does not rely on any assumption on measurement and even allows to be accessed by an eavesdropper. However, it cannot extend QKD to an arbitrary distance like the trusted relay, such that it is expected to be combined with the trusted relay for large-scale QKD deployment. In this work, we study the hybrid trusted/untrusted relay based QKD deployment over optical backbone networks and focus on cost optimization during the deployment phase. A new network architecture of hybrid trusted/untrusted relay based QKD over optical backbone networks is described, where the node structures of the trusted relay and untrusted relay are elaborated. The corresponding network, cost, and security models are formulated. To optimize the deployment cost, an integer linear programming model and a heuristic algorithm are designed. Numerical simulations verify that the cost-optimized design can significantly outperform the benchmark algorithm in terms of deployment cost and security level. Up to 25% cost saving can be achieved by deploying QKD with the hybrid trusted/untrusted relay scheme while keeping much higher security level relative to the conventional point-to-point QKD protocols that are only with the trusted relays.
|
|
| 3. |
|
|
| 4. |
- Cao, Yuan, et al.
(författare)
-
Multi-Tenant Provisioning for Quantum Key Distribution Networks With Heuristics and Reinforcement Learning : A Comparative Study
- 2020
-
Ingår i: IEEE Transactions on Network and Service Management. - : Institute of Electrical and Electronics Engineers (IEEE). - 1932-4537. ; 17:2, s. 946-957
-
Tidskriftsartikel (refereegranskat)abstract
- Quantum key distribution (QKD) networks are potential to be widely deployed in the immediate future to provide long-term security for data communications. Given the high price and complexity, multi-tenancy has become a cost-effective pattern for QKD network operations. In this work, we concentrate on addressing the online multi-tenant provisioning (On-MTP) problem for QKD networks, where multiple tenant requests (TRs) arrive dynamically. On-MTP involves scheduling multiple TRs and assigning non-reusable secret keys derived from a QKD network to multiple TRs, where each TR can be regarded as a high-security-demand organization with the dedicated secret-key demand. The quantum key pools (QKPs) are constructed over QKD network infrastructure to improve management efficiency for secret keys. We model the secret-key resources for QKPs and the secret-key demands of TRs using distinct images. To realize efficient On-MTP, we perform a comparative study of heuristics and reinforcement learning (RL) based On-MTP solutions, where three heuristics (i.e., random, fit, and best-fit based On-MTP algorithms) are presented and a RL framework is introduced to realize automatic training of an On-MTP algorithm. The comparative results indicate that with sufficient training iterations the RL-based On-MTP algorithm significantly outperforms the presented heuristics in terms of tenant-request blocking probability and secret-key resource utilization.
|
|
| 5. |
- Cao, Yuan, et al.
(författare)
-
Multi-tenant secret-key assignment over quantum key distribution networks
- 2019
-
Ingår i: Optics Express. - : OPTICAL SOC AMER. - 1094-4087. ; 27:3, s. 2544-2561
-
Tidskriftsartikel (refereegranskat)abstract
- Quantum key distribution (QKD) networks are promising to progress towards widespread practical deployment over existing fiber infrastructures in the near future. Given the high cost and difficulty of deploying QKD networks, multi-tenancy becomes promising to improve cost efficiency for future QKD networks. In a multi-tenant QKD network, multiple QKD tenants can sham the same QKD network infrastructure to obtain secret keys for securing their data transfer. Since the secret-key resources are finite and precious in QKD networks, how to achieve efficient multi-tenant secret-key assignment (MTKA) to satisfy the secret-key demands of multiple QKD tenants over QKD networks becomes a significant problem. In this regard, this study addresses the MTKA problem over QKD networks. A new multi-tenant QKD network architecture is proposed based on software defined networking (SDN) and quantum key pool (QKP) techniques. A secret-key rate sharing scheme is presented and a heuristic algorithm is designed to implement efficient MTKA over QKD networks. A new performance metric, namely matching degree (MD) that reflects the balance between QKD network secret-key resources and QKD tenant requests, is defined and evaluated. Simulation studies indicate that high QKD tenant requests accommodation and efficient secret-key resource usage can be achieved via maximizing the value of MD.
|
|
| 6. |
- Chao, Lei, et al.
(författare)
-
Integration of Self-Adaptive Physical-Layer Key Distribution and Encryption in Optical Coherent Communication
- 2023
-
Ingår i: Journal of Lightwave Technology. - 0733-8724 .- 1558-2213. ; 41:17, s. 5599-5606
-
Tidskriftsartikel (refereegranskat)abstract
- We propose and experimentally demonstrate a compatible physical-layer secure optical communication (PLSOC) system that integrates self-adaptive physical-layer key distribution (PLKD) and encryption (PLE) in optical coherent communication. Based on bit error rate difference of QAM signals mapped by asymmetric basis state Y-00 protocol, the secret key can be secretly exchanged over public fiber links without the pre-shared keys. Moreover, we perform a parameter self-adaptive strategy for practical and dynamic PLKD. The security of the key is evaluated in the case of a fiber-tapping attack. A secure hash algorithm, SHA3-512, is used to perform privacy amplification to obtain the virtually secure key. An error-free PLKD rate reaches 39.3 Kbits/s over 300km ultra-low loss fiber. We experimentally enable the integration of the proposed PLKD scheme and quantum noise stream cipher (QNSC) with a single wavelength, same system. Q factor penalty of the integration system compared to the QNSC system is 3.7dB (optical back-to-back) and 4.8dB (300km) respectively. By exploiting a common hardware platform, with the same wavelength, the proposed PLSOC system addresses the problem that PLKD and PLE are separately performed through independent optical fiber links or wavelengths. Since only digital signal processing is used, the scheme does not require extra hardware.
|
|
| 7. |
- Chen, Ling, et al.
(författare)
-
Reliable and efficient RAR-based distributed model training in computing power network
- 2024
-
Ingår i: Journal of Optical Communications and Networking. - 1943-0620 .- 1943-0639. ; 16:5, s. 527-540
-
Tidskriftsartikel (refereegranskat)abstract
- The computing power network (CPN) is a novel network technology that integrates computing power from the cloud, edge, and terminals using IP/optical cross-layer networks for distributed computing. CPNs can provide an effective solution for distributed model training (DMT). As a bandwidth optimization architecture based on data parallelism, ring all-reduce (RAR) is widely used in DMT. However, any node or link failure on the ring can interrupt or block the requests deployed on the ring. Meanwhile, due to the resource competition of batch RAR-based DMT requests, inappropriate scheduling strategies will also lead to low training efficiency or congestion. As far as we know, there is currently no research that considers the survivability of rings in scheduling strategies for RAR-based DMT. To fill this gap, we propose a scheduling scheme for RAR-based DMT requests in CPNs to optimize the allocation of computing and wavelength resources considering the time dimension while ensuring reliability. In practical scenarios, service providers may focus on different performance metrics. We formulate an integer linear programming (ILP) model and a RAR-based DMT deployment algorithm (RDDA) to solve this problem considering four optimization objectives under the premise of the minimum blocking rate: minimum computing resource consumption, minimum wavelength resource consumption, minimum training time, and maximum reliability. Simulation results demonstrate that our model satisfies the reliability requirements while achieving corresponding optimal performance for DMT requests under four optimization objectives.
|
|
| 8. |
- Li, Bo, et al.
(författare)
-
Joint IT and Spectrum Resource Load Balancing for VNF Selection in Inter-Datacenter Elastic Optical Networks
- 2017
-
Ingår i: 2017 16TH INTERNATIONAL CONFERENCE ON OPTICAL COMMUNICATIONS & NETWORKS (ICOCN 2017). - : IEEE. - 9781538632734
-
Konferensbidrag (refereegranskat)abstract
- The selection of virtualized network functions (VNFs) in service provisioning is a critical issue in inter-datacenter elastic optical networks. In this paper, considering load balancing of IT and spectrum resources, we propose two joint balancing factors, i.e., Global Balancing factor (GB factor) and Local Balancing factor (LB-factor) for VNFs selection. Then a Joint-Optimization Selection (JOS) algorithm is designed based on the joint balancing factors. Simulation results show that GB-factor based JOS can achieve better performance compared with LB-factor based JOS and benchmark algorithm.
|
|
| 9. |
- Li, Yajie, et al.
(författare)
-
Distributed Model Training based on Data Parallelism in Edge Computing-enabled Elastic Optical Networks
- 2021
-
Ingår i: IEEE Communications Letters. - 1558-2558 .- 1089-7798. ; 25:4, s. 1241-1244
-
Tidskriftsartikel (refereegranskat)abstract
- IEEE The emergence of edge computing provides an effective solution to execute distributed model training (DMT). The deployment of training data among edge nodes affects the training efficiency and network resource usage. This letter aims for the efficient provisioning of DMT services by optimizing the partition and distribution of training data in edge computing-enabled optical networks. An integer linear programming (ILP) model and a data parallelism deployment algorithm (DPDA) are proposed to solve this problem. The performance of the proposed approaches is evaluated through simulation. Simulation results show that the proposed algorithm can deploy more DMT services compared with benchmark.
|
|
| 10. |
- Li, Yajie, et al.
(författare)
-
End-to-end URLLC slicing based on packet duplication in 5G optical transport networks
- 2020
-
Ingår i: Journal of Optical Communications and Networking. - 1943-0620 .- 1943-0639. ; 12:7, s. 192-199
-
Tidskriftsartikel (refereegranskat)abstract
- With the stringent requirements of high reliability and low latency, ultra-reliable low latency communications (URLLCs) are one of three typical services in the fifth generation of mobile network (5G) paradigm. The packet duplication (PD) technique has been proposed as a promising solution to satisfy the extreme requirements of URLLC services. However, the benefit of PD comes at the cost of doubling resource usage. This paper investigates how to efficiently perform end-to-end URLLC slicing based on PD in 5G optical transport networks. Two heuristic algorithms are proposed, including PD-based slicing with wavelength isolation (PDS-WI) and PD-based slicing with link isolation (PDS-LI). The target of this paper is to maximize the number of accommodated URLLC slices by optimizing the allocation of heterogenous resources. The time complexity of these two algorithms is analyzed in detail. With dynamic slice requests, simulations are performed to evaluate and compare their performance in terms of slice blocking probability and resource usage. Meanwhile, two different network scenarios are considered in simulation. Simulation results indicate that PDS-WI outperforms PDS-LI by accommodating more URLLC slices. © 2009-2012 OSA.
|
|
