A dynamic routing, wavelength and time-slot allocation algorithm based on soft-reservation is proposed to construct different channels in optical networks secured by QKD. Simulation shows the proposed algorithm can achieve high adaptability to security requirements.
Optical network security has attracted extensive attentions recently, data encryption is an effective way to enhance the security. Unlike conventional key distribution methods, Quantum key distribution (QKD) is provably-secure. Integrating QKD into optical networks can provide a new paradigm for secure communications. In a QKD integrated optical network, besides the traditional data channels, two additional channels, called quantum-signal channels and public interaction channels, are required to support secure key. Crucially, how to optimally allocate limited wavelength resources to the three channels is emerging as a novel problem. By introducing wavelength division multiplexing (WDM) network and defining the wavelength occupancy factor, this paper designs a dynamic routing, wavelength and time-slot allocation (DRWTA) algorithm for the wavelength allocation in QKD integrated optical network. The simulation results show wavelength scale factor has an adverse effect on the resource utilization rate and the blocking probability. Furthermore, the DRWTA algorithm provides a strategy to allocate wavelength for three types of channels in QKD-WDM networks. The success probability can be improved by exploiting the DRWTA algorithm.
Abstract Quantum key distribution (QKD) optical networks can provide more secure communications. However, with the increase of the QKD path requests and key updates, network blocking problems will become severe. The blocking problems in the network can become more severe because each fiber link has limited resources (such as wavelengths and time slots). In addition, QKD optical networks are also affected by external disturbances such as data interception and eavesdropping, resulting in inefficient network communication. In this paper, we exploit the idea of protection path to enhance the anti-interference ability of QKD optical network. By introducing the concept of security metric, we propose a routing wavelength and time slot allocation algorithm (RWTA) based on protection path, which can lessen the blocking problem of QKD optical network. According to simulation analysis, the security-metric-based RWTA algorithm (SM-RWTA) proposed in this paper can substantially improve the success rate of security key (SK) update and significantly reduce the blocking rate of the network. It can also improve the utilization rate of resources such as wavelengths and time slots. Compared with the non-security-metric-based RWTA algorithm (NSM-RWTA), our algorithm is robust and can enhance the anti-interference ability and security of QKD optical networks.
Quantum key distribution (QKD) has potential of providing long-term security as it is based on the fundamental principles of quantum mechanics. Security of information transmitted through optical networks has attracted attention recently due to its vulnerability to attacks post quantum computers. Hence, the integration of QKD into optical networks can significantly improve the security of existing and future optical networks. In QKD-secured optical networks, the quantum channel and the classical channel are integrated into a single optical fiber to reduce the deployment cost of the network infrastructure. However, due to limited network resources in a single optical fiber, the efficient provisioning of network resources (wavelengths and time slots) and blocking are two major issues in such networks. In this work, a resource assignment strategy with scheduling, namely, resource assignment with scheduling (RA-WS) has been proposed for utilization of network resources efficiently. In the RA-WS strategy, the QKD lightpath requests (QLPRs) have been served according to the proposed scheduling criterion. Moreover, the proposed scheduling criterion for routing, wavelength and time-slot assignment (RWTA) can reduce the effect of QLPRs blocking because of the limited network resources. The performance of the proposed RA-WS strategy has been analyzed in terms of blocking probability (BP), success probability of update secret key (SPUSK), and time-slot utilization ratio (TSUR) with different reserved wavelengths for quantum signal channel (QSCh), i.e.,WQand different time slots (ntr). Simulations performed on NSFNET network topology indicate that the RA-WS strategy performs better than the baseline strategy, i.e., resource assignment without scheduling (RA-WOS) in terms of all the considered metrics.
Currently, with the continuous advancement of network and communication technology, the amount of data carried by the optical network is very huge. The security of high-speed and large-capacity information in optical networks has attracted more and more attention. Quantum key distribution (QKD) provides information-theoretic security based on the laws of quantum mechanics. Introducing QKD into an optical network can greatly improve the security of the optical network. In order to reduce the cost of deployment on QKD infrastructure, quantum signals in QKD and classical signals in optical networks are multiplexed in the same fiber by wavelength-division manner. Moreover, due to the limited wavelength resources in an optical fiber, time-division technology is adopted to construct different kinds of channels in QKD system for efficient utilization of wavelength resources. Under such situation, how to satisfy the security requirements of service requests and complete the efficient scheduling of multi-dimensional resources, i.e., wavelengths and timeslots, is a challenging problem. This paper addresses this problem by considering multi-dimensional routing, wavelength, and timeslot allocation (RWTA) in short-distance quantum key distribution optical networks (QKD-ON), in which any two nodes can directly establish a quantum channel, and the maximum distance between any two nodes is less than the distance that can carry out point-to-point quantum key distribution process. While accommodating services with security requirements in QKD optical networks, to avoid the wavelength time-slot fragmentation caused by the constraints of wavelength consistency and time-slot continuity, we propose a time-window-based security orchestration strategy as well as relative-loss of time continuous compactness based RWTA strategy. We conducted the simulations under various scenarios, e.g., different key updating periods and different distributions on wavelength resources, etc., and the results show that the proposed strategy can achieve better performance compared with the baselines in terms of key success rate, key-updating delay, and blocking probability.
Optical network security is attracting increasing research attention, as loss of confidentiality of data transferred through an optical network could impact a huge number of users and services. Data encryption is an effective way to enhance optical network security. In particular, QKD is being investigated as a secure mechanism to provide keys for data encryption at the endpoints of an optical network. In a QKD-enabled optical network, apart from TDChs, two additional channels, called QSChs and PIChs, are required to support secure key synchronization. How to allocate network resources to QSChs, PIChs, and TDChs is emerging as a novel problem for the design of a security-guaranteed optical network. This article addresses the resource allocation problem in optical networks secured by QKD. We first discuss a possible architecture for a QKD-enabled optical network, where an SDN controller is in charge of allocating the three types of channels (TDCh, QSCh, and PICh) over different wavelengths exploiting WDM. To save wavelength resources, we propose to adopt OTDM to allocate multiple QSChs and PIChs over the same wavelength. An RWTA algorithm is designed to allocate wavelength and time slot resources for the three types of channels. Different security levels are included in the RWTA algorithm by considering different key updating periods (i.e., the period after which the secure key between two endpoints has to be updated). Illustrative simulation results show the effects of different security-level configuration schemes on resource allocation.