Optimal routing rapid convergence method for global quantum security network

Abstract

The invention discloses a global quantum security network optimal routing rapid convergence method. The first forwarding information (direct communication time delay) of the symmetric communication boundary base station is updated in real time through a heartbeat detection mechanism, it is ensured that the information in the routing forwarding table always reflects the actual state of the current network, and a foundation is laid for follow-up learning of the second forwarding information. The second forwarding information is updated by using the forwarding capability information (including the first shortest communication time delay) reported by the first-level neighbor boundary base station, which is helpful to discover and utilize a more efficient routing forwarding path. By selecting the optimal routing forwarding path, the scheme can more effectively utilize network resources, avoid network congestion and unnecessary resource consumption, and can realize rapid convergence routing and convenient routing query in the global quantum security network even if the network structure in the global quantum security network is complex, thereby being beneficial to reducing the operation cost and improving the network performance. And the overall network performance is improved.

Description

Technical Field

[0001] The present application relates to the field of quantum secure communication technology, and in particular to a method for fast convergence of optimal routing in a global quantum secure network. Background Art

[0002] With the rapid development of information technology, network security issues have become increasingly prominent, and traditional encryption technology can no longer meet the growing security needs. Against this background, the global quantum security network has emerged as an emerging communication technology. The global quantum security network is committed to building a seamless and highly flexible communication network. Its core is to use access base stations as communication hubs to achieve key relay between quantum security network terminals. This innovative design ensures that secure and efficient quantum communication can be achieved between quantum security terminals regardless of their geographical location, thereby greatly improving the security and reliability of information transmission.

[0003] In the quantum secure communication scheme based on the global quantum secure network, the key of the encryption end can be relayed in the global quantum secure network through the access base station accessed by the encryption end (referred to as the encryption end access base station), and finally reach the access base station of the decryption end (referred to as the decryption end access base station), and the decryption end access base station forwards the key to the decryption end. Through this key relay process, it can be ensured that a symmetric quantum secure key can be formed between the encryption end and the decryption end, thereby realizing encryption and decryption communication. Among them, in the global quantum secure network, each device terminal will be assigned a unique network access identifier (usually referred to as RID) by the access base station when accessing the network. This RID not only serves as the identity of the terminal device, but also carries a wealth of information, including the country, operator, region, cell, and type of quantum secure network equipment (such as access base station or terminal device, etc.). By parsing this RID, the global quantum secure network can accurately locate any device on the global quantum secure network, thereby providing the possibility for the relay of keys in the subsequent quantum secure communication process.

[0004] However, when the network structure in the global quantum security network is complex, how to efficiently find the shortest and fastest path from the key sender to the receiver becomes an urgent problem to be solved. This is because, in a mesh network, the choice of path directly affects the delay and efficiency of key relay. If the path is not chosen properly, it will not only increase the time of key relay, but also may reduce the communication performance of the entire network.

[0005] Based on this, there is an urgent need for a method to quickly converge on the optimal routing of the global quantum security network, so as to ensure the efficiency of key relay and improve the communication performance of the entire global quantum security network. Summary of the invention

[0006] The present application provides a method for fast convergence of optimal routing in a global quantum security network, which is used to achieve fast convergence of routing in a global quantum security network and facilitate routing query.

[0007] In a first aspect, the present application provides a method for fast convergence of optimal routing in a global quantum security network, the method comprising:

[0008] Phase A: Real-time learning of routing tables:

[0009] For any symmetrically communicable border base station, the first forwarding information of the symmetrically communicable border base station in the routing forwarding table is updated through the heartbeat detection mechanism between the current border base station and the symmetrically communicable border base station; wherein the symmetrically communicable border base station is a border base station that stores a quantum secure symmetric key with the current border base station, and the quantum secure symmetric key is used for quantum secure symmetric communication between the current border base station and the symmetrically communicable border base station, and the first forwarding information represents the direct communication delay between the current border base station and the symmetrically communicable border base station in a direct communication mode in which the source border base station is the current border base station and the destination border base station is the symmetrically communicable border base station;

[0010] For any first-level neighbor boundary base station, the corresponding second forwarding information in the routing forwarding table is updated through the direct communication delay corresponding to the first-level neighbor boundary base station in the routing forwarding table and the forwarding capability information of the first-level neighbor boundary base station itself reported by the first-level neighbor boundary base station; wherein the first-level neighbor boundary base station is a symmetrically communicable boundary base station that successfully establishes a heartbeat connection with the current boundary base station, and the forwarding capability information includes the first shortest communication delay when the first-level neighbor boundary base station communicates with other boundary base stations, and the second forwarding information represents the second shortest communication delay when the current boundary base station communicates with the other boundary base stations through the first-level neighbor boundary base station in an indirect communication mode where the source boundary base station is the current boundary base station and the destination boundary base station is the other boundary base station;

[0011] Phase B: For any destination border base station involved in the updated forwarding information in the routing forwarding table, determine the best routing forwarding path between the current border base station and the destination border base station based on the routing forwarding table, so as to perform key relay based on the best routing forwarding path; wherein the forwarding information includes the first forwarding information and the second forwarding information.

[0012] In one possible implementation, the direct communication delay corresponding to any symmetrically communicable boundary base station is determined by the current boundary base station based on the time difference between a first time and a second time; wherein the first time is the time when the current boundary base station sends a heartbeat detection request to the symmetrically communicable boundary base station, and the second time is the time when the current boundary base station receives a heartbeat detection response sent by the symmetrically communicable boundary base station.

[0013] In a possible implementation, for any first-level neighbor boundary base station, updating the corresponding second forwarding information in the routing forwarding table through the direct communication delay corresponding to the first-level neighbor boundary base station in the routing forwarding table and the forwarding capability information associated with other boundary base stations other than the current boundary base station reported by the first-level neighbor boundary base station, including:

[0014] For each of the other border base stations involved in the forwarding capability information, the direct communication delay is added to the first shortest communication delay when the first-level neighbor border base station communicates with the other border base station to determine the second shortest communication delay; based on the second shortest communication delay, the corresponding second forwarding information in the routing forwarding table is updated.

[0015] In a possible implementation, the other boundary base stations include at least one of the following: a target secondary neighbor boundary base station, a boundary base station with which the first-level neighbor boundary base station indirectly communicates through the target secondary neighbor boundary base station; wherein the target secondary neighbor boundary base station refers to a boundary base station among the neighbor boundary base stations of the first-level neighbor boundary base station, except the current boundary base station.

[0016] In a possible implementation, for any destination border base station involved in the forwarding information updated in the routing forwarding table, determining the best routing forwarding path between the current border base station and the destination border base station based on the routing forwarding table includes:

[0017] For any destination boundary base station involved in the updated forwarding information in the routing forwarding table, determine from the routing forwarding table the various forwarding information associated with the communication between the current boundary base station and the destination boundary base station; determine the target forwarding information corresponding to the shortest communication delay based on the communication delay in each forwarding information; and determine the optimal routing forwarding path between the current boundary base station and the destination boundary base station based on the target forwarding information.

[0018] In a possible implementation, the forwarding information also includes the complete cell SCI codes corresponding to the source boundary base station, the intermediate boundary base station and the destination boundary base station respectively; wherein, any complete cell SCI code includes the following information in the network access identification of the boundary base station: national CC code, network NC code, regional LCI code and cell SCI code, the national CC code indicates the country to which the cell belongs, the network NC code indicates the operator to which the cell belongs, the regional LCI code indicates the area to which the cell belongs, and the cell SCI code indicates the quantum security network represented by the cell; in the case where there is no intermediate boundary base station between the source boundary base station and the destination boundary base station, the complete cell SCI code corresponding to the intermediate boundary base station is empty.

[0019] In a possible implementation, the performing key relay based on the optimal routing forwarding path includes:

[0020] For any received key data packet to be relayed, based on the destination complete cell SCI code in the destination network access identifier carried in the key data packet to be relayed, it is determined that the key data packet to be relayed needs to be routed, then the best routing forwarding path corresponding to the destination complete cell SCI code is searched according to the currently saved best routing forwarding paths, and the key data packet to be relayed is relayed to the next border base station according to the determined best routing forwarding path.

[0021] In a possible implementation, the method further includes:

[0022] For any first-level neighboring border base station, the current border base station reports its own forwarding capability information to the first-level neighboring border base station.

[0023] The beneficial effects of this application are as follows:

[0024] 1. The first forwarding information (direct communication delay) of the symmetrically communicable boundary base station is updated in real time through the heartbeat detection mechanism to ensure that the information in the routing forwarding table always reflects the actual status of the current network and lays the foundation for the subsequent learning of the second forwarding information.

[0025] 2. Using the forwarding capability information (including the first shortest communication delay) reported by the first-level neighboring border base station to update the second forwarding information is helpful to discover and utilize a more efficient routing forwarding path. In this way, even when there is no direct routing forwarding path between the current border base station and the target border base station, one or more feasible indirect routing forwarding paths can be found.

[0026] 3. Based on the real-time updated routing table, the optimal routing forwarding path between the current border base station and the destination border base station can be quickly determined, which reduces the delay in the key relay process and improves communication efficiency.

[0027] 4. By selecting the optimal routing forwarding path, the solution can more effectively utilize network resources, avoid network congestion and unnecessary resource consumption. Even when the network structure in the global quantum security network is complex, it can achieve rapid routing convergence in the global quantum security network and facilitate routing queries, which helps to reduce operating costs and improve overall network performance. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0029] Figure 1 A schematic diagram of the structure of a network access identifier provided in an embodiment of the present application;

[0030] Figure 2 A schematic diagram of a process for rapid convergence of optimal routing in a global quantum security network provided in an embodiment of the present application;

[0031] Figure 3 A schematic diagram of the network topology of a global quantum security network provided in an embodiment of the present application. DETAILED DESCRIPTION

[0032] In order to make the purpose, technical solution and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present application.

[0033] The global quantum security network can support secure and efficient quantum communication between any quantum security terminals connected to the network, regardless of their geographical location. A core of the global quantum security network is to use the access base station as a communication hub to connect quantum security terminals to the global quantum security network, and to achieve key relay between terminals connected to the global quantum security network.

[0034] During the access process, when a quantum security terminal accesses an access base station, the access base station will assign a RID to the terminal device, which is a unique terminal device identifier for the entire global quantum security network to identify the terminal. The RID carries the national CC code, network NC code (operator code), regional LCI code, cell SCI code, and quantum security network equipment (such as access base stations and border base stations) information BID code and equipment information SID code, such as Figure 1 As shown. Among them, the national CC code indicates the country to which the global quantum security network belongs; the network NC code indicates a certain operator under the country to which the global quantum security network belongs; the regional LCI code indicates the area divided by the service provider based on geographical location; the cell SCI code indicates a quantum security network under a certain geographical area of ​​the service provider; the quantum security network device information BID code indicates a quantum security network device under a quantum security network, such as an access base station or a border base station; the device information SID code indicates access to a terminal under a quantum security network device. With this RID, within the time range that this terminal device has this identification, this RID can be used to identify this terminal device in the global quantum security network. Subsequently, the terminal device can apply for services and request resources from the global quantum security network through the access base station.

[0035] The global quantum security network also includes a key center, which mainly distributes keys, i.e., quantum keys, to quantum security terminals connected to the global quantum security network.

[0036] In the key relay process, the encryption end will relay the key through the encryption end access base station through the global quantum security network to the decryption end access base station, and then the decryption end access base station will forward the key to the decryption end, so as to ensure that a symmetric quantum security key is formed between the encryption end and the decryption end, and encryption and decryption communication can be achieved. Among them, the key relay process includes the following situations:

[0037] Case 1: If both parties in the global quantum secure communication are connected to the same access base station, then when the access base station receives the key relay data packet sent by the encryption end, it can determine that the decryption end is also connected to the access base station based on the quantum secure network device information BID code in the destination RID carried in the key relay data packet, and then directly find the link with the decryption end based on the device information SID code in the destination RID, and relay the key relay data packet to the decryption end.

[0038] Case 2: If the two parties of global quantum secure communication access different access base stations in the same cell, then after the encryption end access base station receives the key relay data packet, it can determine that the decryption end is accessed to different access base stations in the same cell based on the quantum secure network device information BID code in the destination RID carried in the key relay data packet. Then, based on the quantum secure network device information BID code, it directly locates the decryption end access base station under the quantum secure network and relays the key relay data packet to the decryption end access base station. After the decryption end access base station receives the key relay data packet, it can directly select the connection with the decryption end based on the quantum secure network device information BID code in the destination RID and relay the key relay data packet to the decryption end.

[0039] Case 3: When the two parties conducting global quantum secure communication are not in the same cell, they need to relay the key between cells through the border base station of the cell, that is, the key relay between cells is forwarded through the border base station. In addition to relaying the key to other border base stations or access base stations in the cell, each border base station is responsible for relaying the key to other border base stations or access base stations in the cell. When the border base station in the cell where the encryption end is located (recorded as the encryption end border base station) does not have the quantum secure symmetric key for key relay with the border base station in the cell where the decryption end is located (recorded as the decryption end border base station), it is also necessary to use the intermediate border base station for transit relay, that is, each border base station also has the function of transit key relay, and relays the relayed key to the border base station of another cell.

[0040] In the above-mentioned global quantum security network, when the network structure in the global quantum security network is complex, how to efficiently find the shortest and fastest path from the key sender to the receiver (it should be noted that the path and the routing forwarding path represent the same concept below) has become an urgent problem to be solved. This is because in a mesh network, the choice of path directly affects the delay and efficiency of key relay. If the path is not selected properly, it will not only increase the time of key relay, but also may reduce the communication performance of the entire network.

[0041] Based on this, the present application provides a method for fast convergence of optimal routing in a global quantum security network, so as to achieve fast convergence of routing in a global quantum security network and facilitate routing query.

[0042] Embodiment 1:

[0043] Figure 2 A schematic diagram of a method for fast convergence of optimal routing in a global quantum secure network provided in an embodiment of the present application is provided. The method is applied to any border base station in the global quantum secure network. The process includes:

[0044] Phase A: Real-time learning of routing tables:

[0045] For any symmetrically communicable border base station, the first forwarding information of the symmetrically communicable border base station in the routing forwarding table is updated through the heartbeat detection mechanism between the current border base station and the symmetrically communicable border base station; wherein the symmetrically communicable border base station is a border base station that stores a quantum secure symmetric key with the current border base station, and the quantum secure symmetric key is used for quantum secure symmetric communication between the current border base station and the symmetrically communicable border base station, and the first forwarding information represents the direct communication delay between the current border base station and the symmetrically communicable border base station in a direct communication mode in which the source border base station is the current border base station and the destination border base station is the symmetrically communicable border base station;

[0046] For any first-level neighbor boundary base station, the corresponding second forwarding information in the routing forwarding table is updated through the direct communication delay corresponding to the first-level neighbor boundary base station in the routing forwarding table and the forwarding capability information of the first-level neighbor boundary base station itself reported by the first-level neighbor boundary base station; wherein the first-level neighbor boundary base station is a symmetrically communicative boundary base station that successfully establishes a heartbeat connection with the current boundary base station, and the forwarding capability information includes the first shortest communication delay when the first-level neighbor boundary base station communicates with other boundary base stations, and the second forwarding information represents the second shortest communication delay when the current boundary base station communicates with the other boundary base stations through the first-level neighbor boundary base station in an indirect communication mode in which the source boundary base station is the current boundary base station and the destination boundary base station is the other boundary base station.

[0047] In this application, the global quantum security network optimal routing fast convergence method is applied to any border base station in the global quantum security network. By applying this method, the border base station can not only grasp the changes in network topology in real time, but also quickly adjust its routing strategy to achieve fast routing convergence. At the same time, efficient key relay is also guaranteed, because accurate routing information ensures the safe and fast transmission of keys in the network.

[0048] In order to achieve the goal of fast routing convergence, the primary task of the border base station is to learn and update its routing forwarding table in real time, so as to provide a basis for subsequent fast routing selection and key relay based on the latest network status through the routing forwarding table. Considering that there are two main communication modes when the border base station communicates with the destination border base station: direct communication and indirect communication. In the direct communication mode, the border base station can directly communicate quantum securely symmetrically with the destination border base station without the forwarding of the intermediate border base station. In the indirect communication mode, the border base station needs to forward through the intermediate border base station to communicate quantum securely with the destination border base station. Therefore, in the process of real-time learning of the routing forwarding table, the border base station can adopt different learning strategies according to different communication methods. Next, we will elaborate on how the border base station learns and updates its routing forwarding table in real time under these two communication modes:

[0049] Communication method 1. Direct communication method.

[0050] Any border base station in the global quantum security network plays an important role as a cross-cell key relay, and its communication capability is strictly limited to direct quantum secure symmetric communication with the border base station holding the quantum secure symmetric key. This feature ensures the privacy and security of quantum secure communication across cells, and is the basis for the safe operation of key relay services. In the initialization phase, the border base stations of the two cells can quickly establish a quantum secure symmetric communication bridge by presetting quantum secure symmetric keys, thereby ensuring that the border base stations of the two cells have a certain degree of communication security at the beginning of startup. In order to ensure that this security can continue, the border base stations of the two cells can also continuously supplement and update quantum secure symmetric keys by automatically supplementing keys online, so that the communication between the two border base stations is always kept in a state of quantum secure encryption, thus providing a solid guarantee for the key relay service.

[0051] Among them, for the current border base station, any border base station with which it stores a quantum secure symmetric key can be regarded as a symmetrically communicable border base station. This means that the current border base station can use the symmetrical quantum secure symmetric key between it and these symmetrically communicable border base stations to conduct direct and secure quantum secure symmetric communication.

[0052] In order to ensure that the communication link between the current boundary base station and its symmetrically communicating boundary base station is always in a healthy and active state, in this application, for any symmetrically communicating boundary base station, the current boundary base station will regularly perform heartbeat detection with it. This detection is not only to confirm whether the communication link between the two parties is unobstructed, but also to verify whether the quantum secure symmetric keys held by both parties are still valid. Through heartbeat detection, potential problems in the communication link can be discovered and resolved in a timely manner, thereby ensuring the stability and reliability of subsequent key relay services.

[0053] In the process of the above-mentioned heartbeat detection, the current boundary base station can also obtain the direct communication delay between the current boundary base station and the symmetrically communicated boundary base station through the heartbeat detection mechanism. The direct communication delay is of great significance for evaluating communication efficiency and optimizing route selection. Based on this, in the present application, for each symmetrically communicated boundary base station, the current boundary base station can rely on the heartbeat detection mechanism to update the corresponding first forwarding information in its routing forwarding table in real time. Among them, the first forwarding information represents the direct communication delay between the current boundary base station and the symmetrically communicated boundary base station in the direct communication mode in which the source boundary base station is the current boundary base station and the destination boundary base station is the symmetrically communicated boundary base station. In this way, it can be achieved that whenever a heartbeat detection is performed with a symmetrically communicated boundary base station, the current boundary base station can quickly learn the latest direct communication delay between the symmetrically communicated boundary base station and the symmetrically communicated boundary base station, and update its routing forwarding table accordingly. This dynamic learning and updating mechanism ensures that the current boundary base station always has the latest and most accurate direct communication delay information with the symmetrically communicated boundary base station, and provides a solid foundation for making the best decision in the subsequent key relay process.

[0054] Assume that there are multiple cells connected to each other through border base stations to form Figure 3A large global quantum security network is shown, in which six border base stations B0, B1, B2, B3, B4, and B6 are connected. The border base station of each cell establishes a quantum security symmetric key with the border base stations of multiple other cells for key relay. When the border base station of any cell is started, a heartbeat detection request will be sent to each symmetrically communicating border base station of the current border base station. For any symmetrically communicating border base station, after receiving the heartbeat detection request, the symmetrically communicating border base station will return a heartbeat detection response along the original path. After the current border base station receives the heartbeat detection response sent by any symmetrically communicating border base station, the direct communication delay between the current border base station and the symmetrically communicating border base station can be determined based on the time difference between the heartbeat detection request and the heartbeat detection response. Exemplarily, the current boundary base station can determine the direct communication delay between the current boundary base station and the symmetrically communicable boundary base station based on the time difference between the time when a heartbeat detection request is sent to the symmetrically communicable boundary base station (recorded as the first time) and the time when the current boundary base station receives the heartbeat detection response sent by the symmetrically communicable boundary base station (recorded as the second time).

[0055] In the above manner, after a heartbeat connection is established between the current border base station and the symmetrically communicating border base station, the first forwarding information corresponding to the symmetrically communicating border base station is saved in the routing forwarding table of the current border base station. Through the first forwarding information, the current border base station can know the symmetrically communicating border base station, and can subsequently relay the key for quantum secure encryption communication belonging to the symmetrically communicating border base station service to the symmetrically communicating border base station. Figure 3 For example, the first forwarding information learned by B6 for B2 is expressed as: {T: B2; G: null; L: t 6,2}; The first forwarding information learned by B6 for B4 is expressed as: {T: B4; G: null; L: t 6,4 Where T represents the destination boundary base station, G represents the intermediate boundary base station to be forwarded, and the value of G is null, which means that there is no intermediate boundary base station to be forwarded, and it is directly from the source boundary base station to the destination boundary base station, that is, the source boundary base station and the destination boundary base station are in direct communication mode, L represents the direct communication delay, t m,n represents the direct communication delay between the current boundary base station m and the symmetrically communicable boundary base station n. Similarly, Figure 3 In the example, B2 can learn the first forwarding information through the mentality detection mechanism, including the following: {T: B1; G: null; L: t 2,1}, {T: B4; G: null; L: t 2,4}, {T: B6; G: null; L: t 2,6}. And so on, Figure 3Each border base station shown learns its own routes to symmetrically communicate with other border base stations.

[0056] Communication method 2: Indirect communication method.

[0057] In the above embodiment, the current border base station can establish a heartbeat connection with the symmetrically communicable border base station through the heartbeat detection mechanism. Once the heartbeat connection is successfully established, the symmetrically communicable border base station can be regarded as a first-level neighboring border base station, because only under this premise can the current border base station perform quantum secure symmetrical communication with them.

[0058] For any first-level neighbor boundary base station, the first-level neighbor boundary base station can report to the current boundary base station the forwarding capability information when communicating with other boundary base stations. The forwarding capability information records the shortest communication delay (recorded as the first shortest communication delay) when the first-level neighbor boundary base station communicates with other boundary base stations. Through the forwarding capability information, not only can the current boundary base station be reported that the first-level neighbor boundary base station can communicate with those boundary base stations, but also the communication rate when the first-level neighbor boundary base station communicates with other boundary base stations.

[0059] In a possible implementation, the "other border base stations" include two categories: one is the target second-level neighbor border base stations other than the current border base station among the neighbor border base stations of the first-level neighbor border base station (for the convenience of distinction, recorded as second-level neighbor border base stations); the other is the border base stations that the first-level neighbor border base station can indirectly communicate with through the target second-level neighbor border base station.

[0060] Once the current border base station receives the forwarding capability information reported by a first-level neighboring border base station, it can update the corresponding second forwarding information in the routing forwarding table based on the direct communication delay corresponding to the first-level neighboring border base station in the routing forwarding table and the forwarding capability information. The second forwarding information represents the shortest communication delay (recorded as the second shortest communication delay) when the current border base station communicates with other border base stations through the first-level neighboring border base station in an indirect communication mode where the source border base station is the current border base station and the destination border base station is another border base station.

[0061] It should be noted that the first-level neighbor boundary base station may report periodically, may report at a preset time point, or may report when the forwarding capability information is updated, which is not specifically limited here.

[0062] In a possible implementation, for any first-level neighbor boundary base station, the current boundary base station can update the corresponding forwarding information (recorded as the second forwarding information) in the routing forwarding table based on the direct communication delay corresponding to the first-level neighbor boundary base station recorded in the current routing forwarding table, and the forwarding capability information related to other boundary base stations (except the current boundary base station) reported by the first-level neighbor boundary base station. Exemplarily, for each other boundary base station involved in the forwarding capability information, the current boundary base station can add the direct communication delay between the current boundary base station and the first-level neighbor boundary base station and the first shortest communication delay when the first-level neighbor base station communicates with the other boundary base station, thereby obtaining the shortest communication delay (recorded as the second shortest communication delay) when the current boundary base station communicates indirectly with the other boundary base station through the first-level neighbor boundary base station. After calculating the second shortest communication delay, the current boundary base station can update the corresponding second forwarding information in the routing forwarding table.

[0063] Similarly, the current border base station will also report its forwarding capability information to each of its first-level neighboring border base stations, so that the first-level neighboring border base station can update the routing forwarding table saved by the first-level neighboring border base station based on the forwarding capability information reported by itself. In this way, the border base stations in the entire global quantum security network can understand each other's communication capabilities and path information, thereby optimizing routing selection and communication efficiency.

[0064] Still with the above Figure 3 For example, after the first round of heartbeat detection mechanism, B6 established heartbeat connections with B4 and B2 respectively. In other words, B6 is the first-level neighbor boundary base station of B2 and B4 respectively. At this time, since only the first round of heartbeat detection mechanism has been passed, B6 temporarily updates the direct communication delay between B6 and its own symmetrically communicated boundary base station in the routing forwarding table through the heartbeat detection mechanism, that is, {T: B2; G: null; L: t 6,2}, {T: B4; G: null; L: t 6,4 Therefore, the forwarding capability information reported by B6 to B2 only records B6—>B2: B4[t 6,4 ]. The forwarding capability information indicates that B2 can access B4 through B6, and the first shortest delay when B6 communicates with B4 is t 6,4 B2 will update its own routing forwarding table based on the forwarding capability information reported by B6. The routing forwarding table includes a first forwarding information learned by B2 through the heartbeat detection mechanism and a second forwarding information learned through the forwarding capability information reported by B6, namely, the first forwarding information: {T: B6, G: null: L: t 2,6}, the second forwarding information: {T: B4; G: B6; L: t6,4 +t 2,6 At the same time, B6 reports its forwarding capability information to B4 and only records B6—>B4: B2[t 6,2 ]. The forwarding capability information indicates that B4 can access B2 through B6, and the first shortest delay when B6 communicates with B2 is t 6,2 B4 updates its own routing table based on the forwarding capability information reported by B6. The routing table includes a first forwarding information learned by B4 through the heartbeat detection mechanism and a second forwarding information learned through the forwarding capability information reported by B6, namely, the first forwarding information: {T: B6, G: null: L: t 4,6}, the second forwarding information: {T: B4; G: B6; L: t 6,2 +t 4,6}.

[0065] Similarly, B2 will also report its forwarding capability information to B1, B4, and B6. The forwarding capability information reported by B2 to B1 only records B2—>B1: B6[t 2,6 ]、B4[t 2,4 ]. The forwarding capability information indicates that B1 can access B6 and B4 through B2, and the first shortest delay when B2 communicates with B6 is t 2,6 , the first shortest delay when B2 and B4 communicate is t 2,4 B1 will update its own routing forwarding table based on the forwarding capability information reported by B2. The routing forwarding table includes one first forwarding information learned by B1 through the heartbeat detection mechanism and two second forwarding information learned through the forwarding capability information reported by B2, namely, the first forwarding information: {T: B2, G: null: L: t 1,2}; Second forwarding information: {T: B6; G: B2; L: t 1,2 +t 2,6}, {T: B4; G: B2; L: t 1,2 +t 2,4}. The forwarding capability information reported by B2 to B4 only records B2—>B4: B6[t 2,6 ]、B1[t 2,1 ]. The forwarding capability information indicates that B4 can access B6 and B1 through B2, and the first shortest delay when B2 communicates with B6 is t 2,6 , the first shortest delay when B2 communicates with B1 is t 2,1B4 updates its own routing table based on the forwarding capability information reported by B2. The routing table includes one first forwarding information learned by B4 through the heartbeat detection mechanism and two second forwarding information learned through the forwarding capability information reported by B2, namely, the first forwarding information: {T: B2, G: null: L: t 4,2}; Second forwarding information: {T: B6; G: B2; L: t 4,2 +t 2,6}, {T: B1; G: B2; L: t 4,2 +t 2,1 The forwarding capability information reported by B2 to B6 only records B2—>B6: B4[t 2,4 ]、B1[t 2,1 ]. The forwarding capability information indicates that B6 can access B4 and B1 through B2, and the first shortest delay when B2 communicates with B4 is t 2,4 , the first shortest delay when B2 communicates with B1 is t 2,1 B6 updates its own routing table based on the forwarding capability information reported by B2. The routing table includes one first forwarding information learned by B6 through the heartbeat detection mechanism and two second forwarding information learned through the forwarding capability information reported by B2, namely, the first forwarding information: {T: B2, G: null: L: t 6,2}; Second forwarding information: {T: B4; G: B2; L: t 6,2 +t 2,4}, {T: B1; G: B2; L: t 6,2 +t 2,1}.

[0066] akin, Figure 3 Each border base station in the network will report its forwarding capability to its neighboring border base stations. In this way, each border base station learns the forwarding capability of its neighbors, which is equivalent to knowing the neighbors of their neighbors.

[0067] In a possible implementation, the first-level neighbor boundary base station reports its forwarding capability information in full to the current boundary base station each time, so as to ensure that the current boundary base station can obtain the complete forwarding capability information of the first-level neighbor boundary base station, so as to make routing decisions and resource allocation more accurately. Of course, the first-level neighbor boundary base station can also only report the updated (such as added, deleted, switched, etc.) forwarding capability information to the current boundary base station to reduce the amount of data transmission and reduce the network burden.

[0068] Phase B: For any destination border base station involved in the updated forwarding information in the routing forwarding table, determine the best routing forwarding path between the current border base station and the destination border base station based on the routing forwarding table, so as to perform key relay based on the best routing forwarding path; wherein the forwarding information includes the first forwarding information and the second forwarding information.

[0069] Based on the above embodiment, after the current border base station has learned the latest routing forwarding table, it can perform a routing merger and select the most efficient routing forwarding path as the optimal routing forwarding path.

[0070] In a possible implementation, the current border base station may relearn the current optimal routing forwarding path based on the forwarding information recorded in the overall routing forwarding table.

[0071] In another possible implementation, the current border base station may also update the corresponding optimal routing forwarding path only based on the forwarding information updated in the routing forwarding table, thereby quickly updating the optimal routing path. Exemplarily, for any destination border base station involved in the forwarding information updated in the routing forwarding table, based on the delay information in the routing forwarding table about the communication between the current border base station and the destination border base station, determine the routing forwarding path corresponding to the shortest communication delay, and determine the routing forwarding path as the optimal routing forwarding path between the current border base station and the destination border base station, so that when a key relay data packet sent to the destination border base station is subsequently received, the key relay data packet can be forwarded to the next border base station according to the optimal routing forwarding path.

[0072] In a possible implementation, for any destination border base station involved in the forwarding information updated in the routing forwarding table, determining the best routing forwarding path between the current border base station and the destination border base station based on the routing forwarding table includes:

[0073] For any destination boundary base station involved in the updated forwarding information in the routing forwarding table, determine from the routing forwarding table the various forwarding information associated with the communication between the current boundary base station and the destination boundary base station; determine the target forwarding information corresponding to the shortest communication delay based on the communication delay in each forwarding information; and determine the optimal routing forwarding path between the current boundary base station and the destination boundary base station based on the target forwarding information.

[0074] For any destination border base station involved in the updated forwarding information in the routing forwarding table, the current border base station can find all forwarding information (including the first forwarding information and the second forwarding information) related to its communication with the destination border base station from the updated routing forwarding table. Among them, these forwarding information may include multiple possible routing forwarding paths, and each routing forwarding path has a corresponding communication delay. The current border base station can compare the communication delays in these forwarding information and find the one with the shortest communication delay. The forwarding information corresponding to this shortest communication delay is what we call the target forwarding information. Based on this target forwarding information, the current border base station can determine the best routing forwarding path between it and the destination border base station. The routing forwarding path is the routing forwarding path that should be followed to forward the data packet when the key relay data packet sent to the destination border base station is received later. For example, the target forwarding information is determined as the best routing forwarding path.

[0075] Still with the above Figure 3 For example, for Figure 3 In the example, B6 can learn that the first forwarding information reaching B4 is: {T: B4; G: null; L: t 6,4 Through the forwarding capability information reported by the first-level neighboring border base station B2, B6 can learn that the second forwarding information reaching B4 is: {T: B4; G: B2; L: t 6,2 +t 2,4 B6 determines the best routing forwarding path to B4 based on the communication delays in the two forwarding messages that can reach B4. For example, B6 determines the best routing forwarding path to B4 by 6,4 and t 6,2 +t 2,4 Compare and determine the shortest communication delay. Assume t 6,2 +t 2,4 <t 6,4 , then B6 will choose the routing forwarding path through B2 to B4 as the optimal routing forwarding path, instead of choosing to directly communicate with B4 for quantum security symmetric communication.

[0076] The same process, Figure 3Each border base station in will also perform similar determination of the best routing forwarding path, and the first shortest communication delay recorded in the subsequent reporting of its own forwarding capability information is determined according to the communication delay corresponding to the best routing forwarding path. For example, when B2 and B4 both broadcast their own forwarding capability information to B1 once, B1 will learn two second forwarding information, and compare the selection of routing forwarding paths in the process of selecting B6, namely B1—>B2—>B6 and B1—>B4—>B6 respectively. These two routing forwarding paths actually imply four routing forwarding paths, namely B1—>B2—>B6, B1—>B2—>B4—>B6, B1—>B4—>B6, and B1—>B4—>B2—>B6. Among the four routing forwarding paths, whether B2 chooses to reach B6 directly or via B4 is the result of B2's selection after receiving the forwarding capability information reported by B4, and B1 does not need to care. Similarly, whether B4 chooses to reach B6 directly or via B2 is determined by B4 after receiving the forwarding capability information reported by B2, and B1 does not need to care about it. Therefore, B1 only cares about the forwarding capability information of its first-level neighboring border base station. 4,6 +t 2,4 <t 2,6 When B2 reports its forwarding capability to B6 to B1, the information is: B2—>B1: B6[t 4,6 +t 2,4 ], but will not report to B1: B2—>B1: B6[t 2,6 ]. That is to say, what B2 reports to B1 is the shortest communication delay to B6, that is, the communication delay corresponding to the best routing forwarding path for B2 to reach B6. Similarly, when B2 receives the key relay from B6, it forwards it to B4, not to its first-level neighbor boundary base station B6. Therefore, B1 only needs to care whether it can reach B6, and whether its first-level neighbor boundary base station can reach B6, and select the best routing forwarding path to reach B6 from all routing forwarding paths that can reach B6. That is, select the best routing forwarding path to reach B6 from B1—>B2—>B6 and B1—>B4—>B6.

[0077] Perhaps, when B2 reported for the first time, it had not learned that the routing forwarding path to reach B6 via B4 is better than the routing forwarding path to reach B6 directly. However, since B2 reports the latest forwarding capability information multiple times, once B2 receives the forwarding capability information from B4, it will update its local routing forwarding table. The next time B2 reports its forwarding capability information to B1, B2 will determine the forwarding capability information based on the best routing forwarding path to reach B6 and report it.

[0078] In this way, the routing forwarding paths from B1 to B6 are B1->B2->B6 and B1->B4->B6 respectively. The communication delay L corresponding to B1->B2->B6 is L=t 1,2 +t min(2,6) , B1—>B4—>B6 corresponding communication delay L=t 1,4 +t min(4,6) Based on L = t 1,2 +t min(2,6) and L = t 1,4 +t min(4,6) Compare and select the best routing forwarding path for B1 to reach B6. The next time B1 reports its forwarding capability information to B0, it will report to B0 based on the selected best routing forwarding path. Of course, in the next round of forwarding capability information reporting, B1 and B3 will also report their forwarding capability information to B0, including the forwarding capabilities of B1 and B3 to B6. B0 will learn two routing forwarding paths to reach B6, namely B0—>B1—>B6 and B0—>B3—>B6. Among them, the communication delay L corresponding to B0—>B1—>B6 is L=t 0,1 +t min(1,6) , B0—>B3—>B6 corresponding communication delay L=t 0,3 +t min(3,6) B0 can be compared with L = t 0,1 +t min(1,6) and L = t 0,3 +t min(3,6) , select the best route from B0 to B6. Assume L = t 0,1 +t min(1,6) >L=t 0,3 +t min(3,6) , B0 chooses B3, which means that there is an optimal routing forwarding path from B0 to B6: {T: B6, G: B3: L: t 0,3 +t min(3,6)}. For any key relay data packets that need to be sent to the destination border base station B6, B0 will first forward the key relay data packets to B3, and then forward them to the next border base station through B3 until they reach B6.

[0079] In a possible implementation, the forwarding information (including the first forwarding information and the second forwarding information) in the above embodiment also includes the complete cell SCI codes corresponding to the source boundary base station, the intermediate boundary base station and the destination boundary base station respectively; wherein any complete cell SCI code includes the following information in the network access identification of the boundary base station: national CC code, network NC code, large-region LCI code and cell SCI code, the national CC code indicates the country to which the cell belongs, the network NC code indicates the operator to which the cell belongs, the large-region LCI code indicates the area to which the cell belongs, and the cell SCI code indicates the quantum security network represented by the cell; in the case where there is no intermediate boundary base station between the source boundary base station and the destination boundary base station, the complete cell SCI code corresponding to the intermediate boundary base station is empty. On this basis, the key relay based on the optimal routing forwarding path includes:

[0080] For any received key data packet to be relayed, based on the destination complete cell SCI code in the destination network access identifier carried in the key data packet to be relayed, it is determined that the key data packet to be relayed needs to be routed, then the best routing forwarding path corresponding to the destination complete cell SCI code is searched according to the currently saved best routing forwarding paths, and the key data packet to be relayed is relayed to the next border base station according to the determined best routing forwarding path.

[0081] When relaying keys based on the best routing forwarding path, the current border base station first parses the destination complete cell SCI code in the destination network access identifier carried by any received key data packet to be relayed. According to the currently saved best routing forwarding paths, the best routing forwarding path matching the destination complete cell SCI code is searched. Once the best routing forwarding path is determined, the key data packet to be relayed is relayed to the next border base station according to the best routing forwarding path.

[0082] In a possible implementation, if multiple optimal routing forwarding paths are found, the current boundary base station may select the optimal routing forwarding path according to additional decision factors (such as path stability, load balancing, etc.).

[0083] The beneficial effects of this application are as follows:

[0084] 1. The first forwarding information (direct communication delay) of the symmetrically communicable boundary base station is updated in real time through the heartbeat detection mechanism to ensure that the information in the routing forwarding table always reflects the actual status of the current network and lays the foundation for the subsequent learning of the second forwarding information.

[0085] 2. Using the forwarding capability information (including the first shortest communication delay) reported by the first-level neighboring border base station to update the second forwarding information is helpful to discover and utilize a more efficient routing forwarding path. In this way, even when there is no direct routing forwarding path between the current border base station and the target border base station, one or more feasible indirect routing forwarding paths can be found.

[0086] 3. Based on the real-time updated routing table, the optimal routing forwarding path between the current border base station and the destination border base station can be quickly determined, which reduces the delay in the key relay process and improves communication efficiency.

[0087] 4. By selecting the optimal routing forwarding path, the solution can more effectively utilize network resources, avoid network congestion and unnecessary resource consumption. Even when the network structure in the global quantum security network is complex, it can achieve rapid routing convergence in the global quantum security network and facilitate routing queries, which helps to reduce operating costs and improve overall network performance.

Claims

1. A method for fast convergence of optimal routing in a global quantum security network, characterized in that: The method is applied to any border base station in the global quantum security network, and the method includes: Phase A: Real-time learning of routing tables: For any symmetrically communicable border base station, the first forwarding information of the symmetrically communicable border base station in the routing forwarding table is updated through the heartbeat detection mechanism between the current border base station and the symmetrically communicable border base station; wherein the symmetrically communicable border base station is a border base station that stores a quantum secure symmetric key with the current border base station, and the quantum secure symmetric key is used for quantum secure symmetric communication between the current border base station and the symmetrically communicable border base station, and the first forwarding information represents the direct communication delay between the current border base station and the symmetrically communicable border base station in a direct communication mode in which the source border base station is the current border base station and the destination border base station is the symmetrically communicable border base station; For any first-level neighbor boundary base station, the corresponding second forwarding information in the routing forwarding table is updated through the direct communication delay corresponding to the first-level neighbor boundary base station in the routing forwarding table and the forwarding capability information of the first-level neighbor boundary base station itself reported by the first-level neighbor boundary base station; wherein the first-level neighbor boundary base station is a symmetrically communicable boundary base station that successfully establishes a heartbeat connection with the current boundary base station, and the forwarding capability information includes the first shortest communication delay when the first-level neighbor boundary base station communicates with other boundary base stations, and the second forwarding information represents the second shortest communication delay when the current boundary base station communicates with the other boundary base stations through the first-level neighbor boundary base station in an indirect communication mode where the source boundary base station is the current boundary base station and the destination boundary base station is the other boundary base station; Phase B: For any destination border base station involved in the updated forwarding information in the routing forwarding table, determine the best routing forwarding path between the current border base station and the destination border base station based on the routing forwarding table, so as to perform key relay based on the best routing forwarding path; wherein the forwarding information includes the first forwarding information and the second forwarding information.

2. The method according to claim 1, characterized in that The direct communication delay corresponding to any symmetrically communicable boundary base station is determined by the current boundary base station based on the time difference between the first time and the second time; wherein the first time is the time when the current boundary base station sends a heartbeat detection request to the symmetrically communicable boundary base station, and the second time is the time when the current boundary base station receives the heartbeat detection response sent by the symmetrically communicable boundary base station.

3. The method according to claim 1, characterized in that For any first-level neighbor boundary base station, updating the corresponding second forwarding information in the routing forwarding table through the direct communication delay corresponding to the first-level neighbor boundary base station in the routing forwarding table and the forwarding capability information associated with other boundary base stations other than the current boundary base station reported by the first-level neighbor boundary base station, including: For each of the other border base stations involved in the forwarding capability information, the direct communication delay is added to the first shortest communication delay when the first-level neighbor border base station communicates with the other border base station to determine the second shortest communication delay; based on the second shortest communication delay, the corresponding second forwarding information in the routing forwarding table is updated.

4. The method according to any one of claims 1 to 3, characterized in that: The other border base stations include at least one of the following: a target secondary neighbor border base station, a border base station with which the first-level neighbor border base station indirectly communicates through the target secondary neighbor border base station; wherein the target secondary neighbor border base station refers to a border base station among the neighboring border base stations of the first-level neighbor border base station, except the current border base station.

5. The method according to claim 1, characterized in that The step of determining, for any destination border base station involved in the updated forwarding information in the routing forwarding table, based on the routing forwarding table, an optimal routing forwarding path between the current border base station and the destination border base station, comprises: For any destination boundary base station involved in the updated forwarding information in the routing forwarding table, determine from the routing forwarding table the various forwarding information associated with the communication between the current boundary base station and the destination boundary base station; determine the target forwarding information corresponding to the shortest communication delay based on the communication delay in each forwarding information; and determine the optimal routing forwarding path between the current boundary base station and the destination boundary base station based on the target forwarding information.

6. The method according to claim 5, characterized in that The forwarding information also includes the complete cell SCI codes corresponding to the source boundary base station, the intermediate boundary base station and the destination boundary base station respectively; wherein, any complete cell SCI code includes the following information in the network access identification of the boundary base station: national CC code, network NC code, regional LCI code and cell SCI code, the national CC code indicates the country to which the cell belongs, the network NC code indicates the operator to which the cell belongs, the regional LCI code indicates the area to which the cell belongs, and the cell SCI code indicates the quantum security network represented by the cell; when there is no intermediate boundary base station between the source boundary base station and the destination boundary base station, the complete cell SCI code corresponding to the intermediate boundary base station is empty.

7. The method according to claim 6, characterized in that The performing key relay based on the optimal routing forwarding path includes: For any received key data packet to be relayed, based on the destination complete cell SCI code in the destination network access identifier carried in the key data packet to be relayed, it is determined that the key data packet to be relayed needs to be routed, then the best routing forwarding path corresponding to the destination complete cell SCI code is searched according to the currently saved best routing forwarding paths, and the key data packet to be relayed is relayed to the next border base station according to the determined best routing forwarding path.

8. The method according to claim 1, characterized in that The method further comprises: For any first-level neighboring border base station, the current border base station reports its own forwarding capability information to the first-level neighboring border base station.

Images