A resource allocation scheme based on path-derived graph in QKD optical network

Abstract

In the field of optical networks where quantum key distribution (QKD) and wavelength division multiplexing (WDM) technologies are deeply integrated, a series of key technologies are reshaping the pattern of information security transmission. Among them, trusted relay technology realizes the relay distribution of quantum keys in long-distance transmission by building trusted intermediate nodes, effectively breaking through the limitation of quantum signal transmission distance; optical bypass technology bypasses any intermediate nodes in the optical domain by allowing quantum channels to be established between non-adjacent nodes; quantum key pool technology can centrally store and dynamically schedule quantum key resources to meet the sudden demand for keys from different services. However, the coordinated application of these technologies has brought about a high degree of complexity in resource management. Faced with the complexity challenges of the above resource allocation, this paper focuses on the new static routing, channel, key rate and time slot allocation (RCKTA) problem in QKD optical networks for in-depth research. To this end, this paper innovatively proposes a path-derived graph model, which is based on graph theory and maps nodes, links, channels and quantum resources in the network to vertices and edges of the graph, and accurately describes the dependency relationship and allocation logic between resources by defining special attributes and constraints. To this end, this paper proposes a resource allocation algorithm based on this model to rationally manage channel, time slot, QKD module and quantum key pool resources to achieve efficient allocation.