Relay node calling method for quantum communication network

Abstract

The invention discloses a relay node calling method for a quantum communication network. The relay node calling method comprises the following steps: S1, determining a sending end node and a receiving end node; s2, judging whether a transmission mode is selected or not; s3, pre-estimating whether a relay node exceeding a preset load exists or not; and S4, calling the relay node according to the transmission path to complete information transmission of the sending end node and the receiving end node. The invention discloses a relay node calling method for a quantum communication network, which flexibly meets the transmission requirement of a sending end node through a rapid transmission mode and a balanced transmission mode, and calls a relay node to form a transmission path according to the balanced transmission mode when the load of the relay node to be called exceeds a preset load. Over-high load of part of relay nodes is prevented, resources are distributed in a balanced mode, and communication efficiency is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of quantum communication and quantum network, and in particular to a method for calling a relay node in a quantum communication network. Background Art

[0002] Quantum communication networks are benefiting all industries. In quantum communication networks, due to the cost of channel deployment and distance limitations, it is impossible to build quantum channels between any nodes in the network and directly distribute quantum keys. Therefore, it is necessary to use key relays between two nodes that are far apart to distribute quantum keys.

[0003] The key relay method was first proposed by Elliott of BBN. ​​The basic idea is to use the quantum key shared between adjacent nodes to encrypt and decrypt the relay key, realize the encrypted transfer of the relay key between one or more relay nodes, and finally reach the destination user.

[0004] However, if it is not handled properly when a large number of users need to transmit data, especially in multi-user quantum network applications, some relay nodes may be called by multiple users and become the main call objects, which may easily lead to excessive load on these relay nodes, while the rest of the relay nodes will be too idle, resulting in a serious imbalance in resource allocation. When the relay node load is too high, it needs to frequently replenish the available quantum keys, or its quantum keys are consumed too quickly, so part of the time has to be spent waiting for key generation, which affects communication efficiency. Summary of the invention

[0005] In order to solve the problem that some relay nodes in the current quantum communication network are easily overloaded, thereby causing serious imbalance in resource allocation, the present invention provides a relay node calling method for a quantum communication network.

[0006] To achieve the above purpose, the technical solution adopted by the present invention is as follows:

[0007] A method for calling a relay node in a quantum communication network, wherein the quantum communication network includes n transmitting end nodes and n receiving end nodes, where n≥1, and the method includes the following steps:

[0008] S1: Determine the sending node and the receiving node;

[0009] S2: Determine whether the transmitting node selects a transmission mode; wherein the transmission mode includes a fast transmission mode and a balanced transmission mode;

[0010] If yes, determine the relay node to be called to form a transmission path according to the selected transmission mode, and execute step S4;

[0011] If not, determine the relay node to be called according to the fast transmission mode to form a transmission path, and execute step S3;

[0012] S3: according to the key consumption of each relay node to be called, estimate whether there is a relay node with a load exceeding a preset value;

[0013] If so, the relay node to be called is determined according to the balanced transmission mode to reform the transmission path;

[0014] If not, directly execute step S4;

[0015] S4: Call the relay node according to the transmission path to complete the information transmission between the sending node and the receiving node.

[0016] In the above scheme, the transmission needs of the sending node are flexibly met through the fast transmission mode and the balanced transmission mode. When the sending node does not select the transmission mode, the relay node is called in the fast transmission mode by default to form a transmission path. When the relay node to be called exceeds the preset load, the relay node is called according to the balanced transmission mode to form a transmission path, so as to prevent the load of some relay nodes from being too high, evenly distribute resources, and improve communication efficiency.

[0017] Preferably, the step of determining the relay node to be called to form a transmission path according to the fast transmission mode is:

[0018] A1: Calculate routing information according to the instructions of the sending node;

[0019] A2: planning multiple first candidate transmission paths from the sending end node to the receiving end node according to the routing information, and saving them in a path planning table;

[0020] A3: taking several first candidate transmission paths with the least number of relay nodes as second candidate transmission paths;

[0021] A4: Calculate the total key consumption of each second candidate path according to the key consumption of each relay node, and select the one with the least total key consumption as the final transmission path.

[0022] Preferably, step A2 specifically comprises:

[0023] A21: Based on the routing information, starting from the first relay node, traverse the adjacent relay nodes in sequence and save them in the path planning table as the first batch of nodes;

[0024] A22: traverse the first batch of nodes in the path planning table, search for similar IP nodes in the routing table of the first batch of nodes according to the IP of the receiving node, and save them as the second batch of nodes in the path planning table;

[0025] A23: Traverse the subsequent relay nodes according to the routing information and add them to the path planning table as a new batch of nodes in turn until the receiving node is found.

[0026] Preferably, the step of determining the relay node to be called to form a transmission path according to the balanced transmission mode is:

[0027] B1: Select the sender node as the path node;

[0028] B2: traverse the relay nodes adjacent to the path nodes;

[0029] B3: Determine whether there is a receiving node among the traversed relay nodes;

[0030] If yes, the receiving node is selected as a new path node and step B4 is executed;

[0031] If not, any relay node that does not exceed the preset load is selected as a new path node, and the process returns to step B2;

[0032] B4: Form a transmission path according to the selected path nodes.

[0033] Preferably, the step of determining the relay node to be called to form a transmission path according to the balanced transmission mode is:

[0034] B1: Select the sender node as the path node;

[0035] B2: traverse the relay nodes adjacent to the path nodes;

[0036] B3: Determine whether there is a receiving node among the traversed relay nodes;

[0037] If yes, the receiving node is selected as a new path node and step B4 is executed;

[0038] If not, select the relay node with the least key consumption as the new path node and return to step B2;

[0039] B4: Form a transmission path according to the selected path nodes.

[0040] Preferably, the following steps are used to determine whether the relay node exceeds a preset load:

[0041] C1: Determine whether Kn / M is greater than A;

[0042] If yes, execute step C2;

[0043] If not, the relay node does not exceed the preset load, and step C3 is executed;

[0044] C2: Determine whether Kn is greater than N;

[0045] If so, the relay node exceeds the preset load;

[0046] If not, the relay node does not exceed the preset load;

[0047] C3: Execution ends;

[0048] Among them, Kn is the key consumption of the relay node within a period of time T; M is the total number of instruction information of the relay node within a period of time T; A is the preset ratio threshold; N is the preset key consumption threshold.

[0049] Preferably, before step S2, the method further includes generating a key consumption table for recording the key consumption of each relay node within a period of time T.

[0050] Preferably, Kn is initially 0, and each time a transmission path is formed, the Kn of each relay node therein is increased by 1.

[0051] Preferably, 0<A<1.

[0052] Preferably, A is 0.5.

[0053] Beneficial technical effects of the present invention:

[0054] The present invention provides a relay node calling method for a quantum communication network, which flexibly meets the transmission requirements of a sending node through a fast transmission mode and a balanced transmission mode. When the sending node does not select a transmission mode, the relay node is called in the fast transmission mode by default to form a transmission path. When the relay node to be called exceeds a preset load, the relay node is called in the balanced transmission mode to form a transmission path, thereby preventing some relay nodes from being overloaded, evenly allocating resources, and improving communication efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0055] Figure 1 It is a structural block diagram of the quantum communication network in the present invention;

[0056] Figure 2 It is a flowchart of the implementation steps of the technical solution of the present invention;

[0057] Figure 3 A flow chart of forming a transmission path according to a fast transmission mode in the present invention;

[0058] Figure 4 A flow chart of forming a transmission path according to a balanced transmission mode according to one embodiment of the present invention;

[0059] Figure 5 This is a flow chart of forming a transmission path according to a balanced transmission mode according to another embodiment of the present invention. DETAILED DESCRIPTION

[0060] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with embodiments, but the scope of protection claimed in the present invention is not limited to the following specific embodiments.

[0061] Example 1

[0062] like Figure 1-2 As shown, a method for calling a relay node in a quantum communication network, wherein the quantum communication network includes n transmitting end nodes (such as Figure 1 Alice1, Alice2, ..., Alicen), n receiving nodes (such as Figure 1 In the embodiment of the present invention, there are n relay nodes (Bob1, Bob2, ..., Bobn) and a key management system KMS, and the method comprises the following steps:

[0063] S1: Determine the sending node and the receiving node;

[0064] S2: Determine whether the transmitting node selects a transmission mode; wherein the transmission mode includes a fast transmission mode and a balanced transmission mode;

[0065] If yes, the KMS determines the relay node to be called according to the selected transmission mode to form a transmission path, and executes step S4;

[0066] If not, the KMS determines the relay node to be called according to the fast transmission mode to form a transmission path, and executes step S3;

[0067] More specifically, if Figure 3 As shown, the steps for KMS to determine the relay node to be called to form a transmission path according to the fast transmission mode are:

[0068] A1: KMS calculates routing information based on the instructions of the sending node;

[0069] A2: KMS plans multiple first candidate transmission paths from the sending end node to the receiving end node according to the routing information and saves them in the path planning table;

[0070] More specifically, step A2 is as follows:

[0071] A21: KMS starts from the first relay node according to the routing information, traverses the adjacent relay nodes in sequence, and saves them in the path planning table as the first batch of nodes;

[0072] A22: KMS traverses the first batch of nodes in the path planning table, searches for similar IP nodes in the routing table of the first batch of nodes based on the IP of the receiving node, and saves them as the second batch of nodes in the path planning table;

[0073] A23: KMS traverses subsequent relay nodes according to the routing information and adds them to the path planning table as a new batch of nodes in turn until the receiving node is found (or the number of jumps reaches the preset jump threshold).

[0074] A3: KMS uses several first candidate transmission paths with the least number of relay nodes as second candidate transmission paths;

[0075] A4: KMS calculates the total key consumption of each second candidate path according to the key consumption of each relay node, and selects the one with the least total key consumption as the final transmission path.

[0076] S3: KMS estimates whether there are relay nodes with a load exceeding the preset value based on the key consumption of each relay node to be called;

[0077] If so, the relay node to be called is determined according to the balanced transmission mode to reform the transmission path;

[0078] If not, directly execute step S4;

[0079] More specifically, if Figure 4 As shown, the steps for KMS to determine the relay node to be called to form a transmission path according to the balanced transmission mode are:

[0080] B1: Select the sender node as the path node;

[0081] B2: KMS traverses the relay nodes adjacent to the path node; the traversed relay nodes do not include the selected path node;

[0082] B3: Determine whether there is a receiving node among the traversed relay nodes;

[0083] If yes, the receiving node is selected as a new path node and step B4 is executed;

[0084] If not, any relay node that does not exceed the preset load is selected as a new path node (if there is no relay node that does not exceed the preset load, the relay node with the least current key consumption is selected), and return to step B2;

[0085] B4: KMS forms a transmission path according to the selected path nodes.

[0086] More specifically, the following steps are used to determine whether the relay node exceeds a preset load:

[0087] C1: Determine whether Kn / M (the default result is 0 if M is 0) is greater than A;

[0088] If yes, execute step C2;

[0089] If not, the relay node does not exceed the preset load, and step C3 is executed;

[0090] C2: Determine whether Kn is greater than N;

[0091] If so, the relay node exceeds the preset load;

[0092] If not, the relay node does not exceed the preset load;

[0093] C3: Execution ends;

[0094] Among them, Kn is the key consumption of the relay node within a period of time T; M is the total number of instruction information of the relay node within a period of time T; A is the preset ratio threshold; N is the preset key consumption threshold.

[0095] In the specific implementation process, because the result of Kn / M showing that the load is too high within a relatively small number of times of use is not of reference value, N is used to specify the number of times a node must be used within the time T.

[0096] More specifically, 0<A<1.

[0097] More specifically, A is 0.5.

[0098] S4: Call the relay node according to the transmission path to complete the information transmission between the sending node and the receiving node.

[0099] In the specific implementation process, the transmission needs of the sending node are flexibly met through the fast transmission mode and the balanced transmission mode. When the sending node does not select the transmission mode, the relay node is called in the fast transmission mode by default to form a transmission path. When the relay node to be called exceeds the preset load, the relay node is called according to the balanced transmission mode to form a transmission path, so as to prevent the load of some relay nodes from being too high, evenly distribute resources, and improve communication efficiency.

[0100] More specifically, before step S2, the KMS generates a key consumption table for recording the key consumption of each relay node within a period of time T.

[0101] More specifically, Kn is initially 0, and each time a transmission path is formed, the Kn of each relay node therein is increased by 1.

[0102] During the specific implementation process, the key consumption table KT1 generated in the current time period and the key consumption table KT2 generated in the previous time period are averaged as the key consumption reference table for the next time period, and KMS obtains Kn from the key consumption reference table; the total number of instruction information in the current time period and the total number of instruction information in the previous time period are averaged as the total number of instruction information in the next time period.

[0103] Example 2

[0104] like Figure 5 As shown, this embodiment is basically the same as the method for calling a relay node for a quantum communication network described in Embodiment 1, except that the steps in which KMS determines the relay node to be called to form a transmission path according to the balanced transmission mode are different:

[0105] More specifically, the steps for KMS to determine the relay node to be called to form a transmission path according to the balanced transmission mode are:

[0106] B1: Select the sender node as the path node;

[0107] B2: KMS traverses the relay nodes adjacent to the path node; the traversed relay nodes do not include the selected path node;

[0108] B3: Determine whether there is a receiving node among the traversed relay nodes;

[0109] If yes, the receiving node is selected as a new path node and step B4 is executed;

[0110] If not, select the relay node with the least key consumption as the new path node and return to step B2;

[0111] B4: KMS forms a transmission path according to the selected path nodes.

[0112] In the specific implementation process, by finding the relay node with the least current consumption to transmit data, balanced distribution of information in the relay nodes is achieved, the load is more evenly distributed, and thus the efficiency is higher.

[0113] According to the disclosure and teaching of the above description, those skilled in the art to which the present invention belongs may also make changes and modifications to the above embodiments. Therefore, the present invention is not limited to the specific embodiments disclosed and described above, and some modifications and changes to the invention should also fall within the scope of protection of the claims of the present invention. In addition, although some specific terms are used in this specification, these terms are only for the convenience of description and do not constitute any limitation to the present invention.

Claims

1. A method for calling a relay node in a quantum communication network, wherein the quantum communication network comprises n transmitting end nodes and n receiving end nodes, n≥1, characterized in that: The method comprises the following steps: S1: Determine the sending node and the receiving node; S2: Determine whether the transmitting node selects a transmission mode; wherein the transmission mode includes a fast transmission mode and a balanced transmission mode; If yes, determine the relay node to be called to form a transmission path according to the selected transmission mode, and execute step S4; If not, determine the relay node to be called according to the fast transmission mode to form a transmission path, and execute step S3; S3: according to the key consumption of each relay node to be called, estimate whether there is a relay node with a load exceeding a preset value; If so, the relay node to be called is determined according to the balanced transmission mode to reform the transmission path; If not, directly execute step S4; S4: Call the relay node according to the transmission path to complete the information transmission between the sending node and the receiving node.

2. A method for calling a relay node in a quantum communication network according to claim 1, characterized in that: The steps for determining the relay nodes to be called to form a transmission path according to the fast transmission mode are: A1: Calculate routing information according to the instructions of the sending node; A2: planning multiple first candidate transmission paths from the sending end node to the receiving end node according to the routing information, and saving them in a path planning table; A3: taking several first candidate transmission paths with the least number of relay nodes as second candidate transmission paths; A4: Calculate the total key consumption of each second candidate path according to the key consumption of each relay node, and select the one with the least total key consumption as the final transmission path.

3. A method for calling a relay node in a quantum communication network according to claim 2, characterized in that: Step A2 is specifically as follows: A21: Based on the routing information, starting from the first relay node, traverse the adjacent relay nodes in sequence and save them in the path planning table as the first batch of nodes; A22: traverse the first batch of nodes in the path planning table, search for similar IP nodes in the routing table of the first batch of nodes according to the IP of the receiving node, and save them as the second batch of nodes in the path planning table; A23: Traverse the subsequent relay nodes according to the routing information and add them to the path planning table as a new batch of nodes in turn until the receiving node is found.

4. A method for calling a relay node in a quantum communication network according to claim 1, characterized in that: The steps of determining the relay node to be called to form a transmission path according to the balanced transmission mode are: B1: Select the sender node as the path node; B2: traverse the relay nodes adjacent to the path nodes; B3: Determine whether there is a receiving node among the traversed relay nodes; If yes, the receiving node is selected as a new path node and step B4 is executed; If not, any relay node that does not exceed the preset load is selected as a new path node, and the process returns to step B2; B4: Form a transmission path according to the selected path nodes.

5. A method for calling a relay node in a quantum communication network according to claim 1, characterized in that: The steps of determining the relay node to be called to form a transmission path according to the balanced transmission mode are: B1: Select the sender node as the path node; B2: traverse the relay nodes adjacent to the path nodes; B3: Determine whether there is a receiving node among the traversed relay nodes; If yes, the receiving node is selected as a new path node and step B4 is executed; If not, select the relay node with the least key consumption as the new path node and return to step B2; B4: Form a transmission path according to the selected path nodes.

6. A method for calling a relay node in a quantum communication network according to claim 1, characterized in that: Use the following steps to determine whether the relay node exceeds the preset load: C1: Determine whether Kn / M is greater than A; If yes, execute step C2; If not, the relay node does not exceed the preset load, and step C3 is executed; C2: Determine whether Kn is greater than N; If so, the relay node exceeds the preset load; If not, the relay node does not exceed the preset load; C3: Execution ends; Among them, Kn is the key consumption of the relay node within a period of time T; M is the total number of instruction information of the relay node within a period of time T; A is the preset ratio threshold; N is the preset key consumption threshold.

7. A method for calling a relay node in a quantum communication network according to claim 6, characterized in that: Before step S2, it also includes generating a key consumption table for recording Kn.

8. A method for calling a relay node in a quantum communication network according to claim 7, characterized in that: Kn is initially 0, and each time a transmission path is formed, the Kn of each relay node therein is increased by 1.

9. A method for calling a relay node in a quantum communication network according to claim 6, characterized in that: 0＜A＜1。 10. A method for calling a relay node in a quantum communication network according to claim 9, characterized in that: A is 0.5.

Images