A quantum distribution network debugging method based on packet tracking

Abstract

This invention discloses a debugging method for quantum distribution networks based on message tracing. This method utilizes any two nodes K i K j Establish a session connection with QNDCS; then QNDCS calculates node K according to Dijkstra's algorithm. i K j The optimal path between them; then QNDCS sends the optimal path routing table information to each node on the optimal path; node K i According to the routing table information, to node K j Send data packets, node K j Received from node K i The system sends data packets and searches for the next-hop node based on the routing table information. The next-hop node is network node K of this quantum device. j At that time, the node K i K j The session ends; QNDCS calculates the time difference in information processing. This invention achieves communication monitoring between any two quantum device network nodes by establishing a connection topology graph between the central server QNDCS and the nodes, and realizes data transmission by calculating the optimal path, thereby reducing system throughput and improving communication security between quantum network nodes.

Description

Technical Field

[0001] The present invention relates to the field of quantum communication, and in particular to a quantum distribution network debugging method based on message tracing. Background Art

[0002] With the popularization of the Internet and the continuous iteration of information, people are increasingly inseparable from information networks. In recent years, quantum communication networks have achieved rapid development, and quantum distribution networks have higher security compared with the communication of classical networks. In the communication structure of the quantum distribution network, the communication between different device nodes is carried out for connection and disconnection by connecting to the central control server. The central control server generally stores the message content of the entire communication process in the database unit, and then forwards data messages to realize the communication between the device nodes. However, each forwarding requires an operation on the database, which reduces the operating efficiency of the system, resulting in low communication efficiency, and is not conducive to effective data forwarding and real-time communication.

[0003] In the existing solutions, a pre-configured network debugging scheme is adopted to realize fault repair for network debugging, but the scheduling of the server in this technical solution is active, that is, the device node needs to initiate a debugging request, which cannot monitor sudden fault problems in real time, and thus cannot guarantee real-time network communication.

[0004] Therefore, there is a need to improve the deficiencies of the prior art, and propose a communication debugging method for quantum distribution networks by tracing data between nodes through messages. Summary of the Invention

[0005] The purpose of the present invention is to overcome the defects of the prior art. In order to solve the communication efficiency and security problems of quantum distribution networks, a quantum distribution network debugging method based on message tracing is proposed.

[0006] The method of the present invention is implemented through the following technical solutions:

[0007] A quantum distribution network debugging method based on message tracing, the steps of the method are as follows:

[0008] Step 1: Any two quantum device network nodes K i , K j where i<j, i=1,2……n, j=1,2……n, establish a session connection through QNDCS;

[0009] The QNDCS constructs a two-dimensional array G according to the connection relationship of each quantum device network node and calculates the weight of the edge between two adjacent quantum device network nodes;

[0010] Step 2: The QNDCS calculates the quantum device network node K based on Dijkstra's algorithm. i K j The optimal path and the total weight of the optimal path between them;

[0011] Step 3: The QNDCS generates a routing table information for the optimal path based on the optimal path, and then sets up the quantum device network node K. i As the starting node of routing table information and quantum device network node K j As the termination node of the routing table information;

[0012] Step 4: The QNDCS sends the routing table information of the optimal path to each quantum device network node on the optimal path;

[0013] The routing table information includes the session ID, the ID of each node on the optimal path, and the next-hop node ID corresponding to each node ID;

[0014] Step 5: Quantum device network node K i Based on the routing table information, the sub-device network node K j Send data packets and send a session start request to QNDCS to establish quantum device network node K. i K j The session connection is established, and the moment when the session connection is established is marked as t0.

[0015] Step 6: The quantum device network node K j Received from quantum device network node K i The system sends data packets and searches for the next-hop node based on the routing table information. The next-hop node is network node K of this quantum device. j At that time, the quantum device network node K j Sending a session termination request to QNDCS and disconnecting QNDCS will connect quantum device network node K. i K j The session is established, and the time when the session is disconnected is marked as t. x ;

[0016] Step 7: QNDCS calculates the information processing time difference Δt based on the start marker in Step 5 and the end marker in Step 4, where Δt = t x -t0.

[0017] Furthermore, the specific steps of step 1 are as follows:

[0018] Step 1-1: Any two quantum device network nodes K i K jwhere i<j, i=1,2...n, j=1,2...n, respectively initiate a connection request to the QNDCS;

[0019] Step 1-2: The QNDCS determines whether quantum device network node K i and K j are connected;

[0020] If quantum device network node K i and K j are already connected, the QNDCS returns a connection rejection message to quantum device network node K i and K j ;

[0021] If quantum device network node K i and K j are not connected, respectively establish connections with K i and K j ;

[0022] Step 1-3: Quantum device network node K i sends a session application to quantum device network node K via the QNDCS j ;

[0023] Step 1-4: Quantum device network node K j generates a response application for establishing a connection according to the session application, and sends the response application to quantum device network node K via the QNDCS i ;

[0024] Step 1-5: After quantum device network node K i receives the response application, the session connection between quantum device network node K i and K j is established;

[0025] Step 1-6: Quantum device network node K i and K j send the connection relationship information with adjacent quantum device network nodes to the QNDCS at intervals of 15 to 18 seconds;

[0026] Step 1-7: The QNDCS constructs a two-dimensional array G and calculates the edge weight of any two adjacent quantum device network nodes according to the connection relationship information of each quantum device network node.

[0027] Further, the steps of constructing the two-dimensional array G and calculating the edge weight of any two adjacent quantum device network nodes in Step 1-7 are as follows:

[0028] Step 1-7-1: QNDCS creates a two-dimensional integer array G[m][m] based on the total number of nodes m. The connection relationship between any two quantum device network nodes corresponds to an array element of the two-dimensional array, and each array element corresponds to a value. The rules for the array element values ​​are as follows:

[0029] When adjacent quantum device network nodes are connected, the corresponding array element value is 1; when adjacent quantum device network nodes are disconnected, the corresponding array element value is -1; when adjacent quantum device network nodes are the same node, the corresponding array element value is 0.

[0030] Step 1-7-2: The QNDCS obtains all array element values ​​of the two-dimensional array based on the connection status of any adjacent quantum device network nodes among all nodes;

[0031] Step 1-7-3: All array element values ​​constitute the adjacency matrix of the network topology graph, and the data structure of the adjacency matrix is ​​represented as the network topology graph;

[0032] Step 1-7-4: The QNDCS calculates the weight of the edge when the adjacent quantum device network nodes are in a connected state, and replaces the corresponding array element value with the weight.

[0033] Furthermore, in step 1-7-4, the weight W of the edge when adjacent quantum device network nodes are in a connected state is calculated. i The formula is:

[0034]

[0035] Where t is the time required for information to travel through path i, and r i Indicates the position of path i on the path, t i t is the delay value at the starting point of path i. j t is the delay value at the endpoint of path i. ij This represents the delay value of the path formed by node i and node j, with an initial value of 1.

[0036] Furthermore, in step 2, the total weight of the optimal path is equal to the sum of the weights of the edges on the optimal path.

[0037] Furthermore, the QNDCS also performs anomaly detection on quantum device network nodes, and the anomaly detection steps are as follows:

[0038] Step A: QNDCS sends a heartbeat detection message to all quantum device network nodes within 2-4 seconds;

[0039] Step B: After receiving the heartbeat detection message, any quantum device network node K sends a receive response to QNDCS;

[0040] Step C: If QNDCS receives the received response, it indicates that the quantum device network node K is operating normally;

[0041] If QNDCS does not receive the received response, proceed to step A;

[0042] When the jump count is 4, the QNDCS determines that the quantum device network node K is abnormal.

[0043] The beneficial effects of this invention are as follows:

[0044] This invention establishes a connection topology graph between the quantum network control center server (QNDCS) and the quantum device network nodes, and calculates the K values ​​between any two nodes based on the connection topology graph. i K j The optimal communication path, i.e. the path with the minimum edge weight from the starting point to the ending point, reduces the system throughput for establishing communication between any two nodes and improves communication efficiency. The method disclosed in this invention also sends heartbeat detection messages to all quantum device network nodes through the quantum network control center server QNDCS, which improves the processing speed and efficiency of network quantum device network node anomalies. Attached Figure Description

[0045] Figure 1 This is a schematic diagram of the principle of the present invention;

[0046] Figure 2 This is a flowchart of the method of the present invention;

[0047] Figure 3 This is a flowchart illustrating the connection process of the quantum device network nodes of the present invention.

[0048] Figure 4 This is a flowchart illustrating the anomaly detection process for quantum device network nodes according to the present invention. Detailed Implementation

[0049] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the embodiments. However, the scope of protection of this invention is not limited to the specific embodiments described below.

[0050] A debugging method for quantum distribution networks based on message tracing is disclosed. This method applies a debugging system for quantum distribution networks based on message tracing. This method is then applied on the basis of the system. Specifically, to make the steps of the method more detailed, the modified system is first introduced.

[0051] like Figure 1 As shown, a quantum distribution network debugging system based on message tracing includes QNDCS and multiple quantum device network nodes;

[0052] The QNDCS and the multiple quantum device network nodes are connected through a classical network, and any two quantum device network nodes are connected through a quantum network.

[0053] The QNDCS is equipped with a session establishment module, an edge weight calculation module, an optimal path module, a routing table information sending module, a message transmission module, a marking module, and a time difference calculation module.

[0054] The QNDCS is the quantum network control center server;

[0055] The session establishment module is used to establish network nodes K of any two quantum devices. i K j The session connection;

[0056] The edge weight calculation module is used to construct a two-dimensional array G based on the connection relationship of each quantum device network node and to calculate the edge weight of two adjacent quantum device network nodes.

[0057] The optimal path module is used to calculate the quantum device network node K according to Dijkstra's algorithm. i K j The optimal path between them is determined and a routing table containing the optimal path information is formed. At the same time, the total weight of the optimal path is calculated.

[0058] The routing table information sending module is used to send the routing table information of the optimal path to each quantum device network node on the optimal path;

[0059] The message transmission module is used to transmit the quantum device network node K. i Data packets are transmitted to quantum device network node K according to routing table information. j ;

[0060] The labeling module is used to label any two quantum device network nodes K. i K j The times of session establishment and termination are marked, with the connection establishment time marked as t0 and the connection termination time marked as t. x ;

[0061] The time difference calculation module is used to calculate the information processing time difference value Δt, where Δt = t x -t0.

[0062] The specific implementation methods of each module function in this system are consistent with the corresponding methods in the following message tracing-based quantum distribution network debugging method, and will not be repeated here.

[0063] Specifically, the specific method scheme of this embodiment is as follows:

[0064] A debugging method for quantum distribution network based on message tracing, as Figures 2-4 shown, the method applies the aforementioned debugging system for quantum distribution network based on message tracing, and the steps of the method are as follows:

[0065] Step 1: Any two quantum device network nodes K i , K j establish a session connection through QNDCS;

[0066] The QNDCS constructs a two-dimensional array G according to the connection relationship of each quantum device network node and calculates the weight of the edge between two adjacent quantum device network nodes;

[0067] Wherein, the specific steps of Step 1 are as follows:

[0068] Step 1-1: Any two quantum device network nodes K i , K j , where i<j, i=1,2......n, j=1,2......n, respectively initiate a connection request to the QNDCS;

[0069] Step 1-2: The QNDCS judges whether quantum device network nodes K i , K j are connected;

[0070] If quantum device network nodes K i , K j are already connected, the QNDCS returns a connection rejection message to quantum device network nodes K i , K j ;

[0071] If quantum device network nodes K i , K j are not connected, respectively establish a connection with K i , K j ;

[0072] Step 1-3: Quantum device network node K i sends a session application to quantum device network node K through the QNDCS j ;

[0073] Step 1-4: Quantum device network node K j generates a response application for establishing a connection according to the session application, and sends the response application to quantum device network node K through the QNDCS i ;

[0074] Step 1-5: After quantum device network node K i receives the response application, quantum device network node Ki K j Establishment of a session connection;

[0075] Steps 1-6: Quantum Device Network Node K i K j Every 15 to 18 seconds, it sends connection relationship information with neighboring quantum device network nodes to the QNDCS;

[0076] Steps 1-7: The QNDCS constructs a two-dimensional array G based on the connection relationship information of each quantum device network node and calculates the weight of the edge between any two adjacent quantum device network nodes.

[0077] The steps in steps 1-7 of constructing the two-dimensional array G and calculating the weights of the edges between any two adjacent quantum device network nodes are as follows:

[0078] Step 1-7-1: QNDCS creates a two-dimensional integer array G[m][m] based on the total number of nodes m. The connection relationship between any two quantum device network nodes corresponds to an array element of the two-dimensional array, and each array element corresponds to a value. The rules for the array element values ​​are as follows:

[0079] When adjacent quantum device network nodes are connected, the corresponding array element value is 1; when adjacent quantum device network nodes are disconnected, the corresponding array element value is -1; when adjacent quantum device network nodes are the same node, the corresponding array element value is 0.

[0080] Using array element values ​​to represent the connection state of quantum device network nodes allows for the data-driven representation of the connection state between quantum device network nodes, making it easier to determine the connection state between nodes and facilitating subsequent weight replacement and storage.

[0081] Step 1-7-2: The QNDCS obtains all array element values ​​of the two-dimensional array based on the connection status of any adjacent quantum device network nodes among all nodes;

[0082] Step 1-7-3: All array element values ​​constitute the adjacency matrix of the network topology graph, and the data structure of the adjacency matrix is ​​represented as the network topology graph;

[0083] Using an adjacency matrix to represent the network topology can simplify the network structure and efficiently form network element relationships. Network element relationships refer to the interconnection relationships between nodes in the entire network, which can reduce network construction errors.

[0084] Step 1-7-4: The QNDCS calculates the weight of the edge when the adjacent quantum device network nodes are in a connected state, and replaces the corresponding array element value with the weight.

[0085] When quantum device network node 1 and quantum device network node 6 are connected, the weights of the two nodes are calculated using the following edge weight calculation formula, and the element values ​​of the corresponding array G[1][6] are replaced with the calculated weight values.

[0086] Specifically, in step 1-7-4, the weight W of the edge when adjacent quantum device network nodes are in a connected state is calculated. i The calculation formula is:

[0087] W i =0.253*t+0.242*r i +0.123*t ij +0.191*t i +0.191*t j ;

[0088] Where t is the time required for information to travel through path i, and r i Indicates the position of path i on the path, t i t is the delay value at the starting point of path i. j t is the delay value at the endpoint of path i. ij This represents the delay value of the path formed by nodes i and j, where t and r are constants. i , t i , t j and t ij All values ​​are calculated based on actual applications, and the initial value of the delay value is 1.

[0089] Step 2: The QNDCS calculates the quantum device network node K based on Dijkstra's algorithm. i K j The optimal path and the total weight of the optimal path between them;

[0090] The Dijkstra algorithm is a typical single-source shortest path algorithm used to calculate the shortest path from a node to all other nodes. Its main feature is that it expands outward from the starting point layer by layer until it reaches the destination.

[0091] Wherein, the total weight of the optimal path is equal to the sum of the weights of all edges on the optimal path;

[0092] Step 3: The QNDCS generates a routing table information for the optimal path based on the optimal path, and then sets up the quantum device network node K. i As the starting node of routing table information and quantum device network node K j As the termination node of the routing table information;

[0093] Step 4: The QNDCS sends the routing table information of the optimal path to each quantum device network node on the optimal path;

[0094] The routing table information includes the session ID, the ID of each node on the optimal path, and the next-hop node ID corresponding to each node ID;

[0095] Step 5: Quantum device network node K i Based on the routing table information, the sub-device network node K j Send data packets and send a session start request to QNDCS to establish quantum device network node K. i K j The session connection is established, and the moment when the session connection is established is marked as t0.

[0096] Step 6: The quantum device network node K j Received from quantum device network node K i The system sends data packets and searches for the next-hop node based on the routing table information. The next-hop node is network node K of this quantum device. j At that time, the quantum device network node K j Sending a session termination request to QNDCS and disconnecting QNDCS will connect quantum device network node K. i K j The session is established, and the time when the session is disconnected is marked as t. x ;

[0097] Step 7: QNDCS calculates the information processing time difference based on the start marker in Step 5 and the end marker in Step 6.

[0098] Furthermore, the QNDCS also performs anomaly detection on quantum device network nodes, and the anomaly detection steps are as follows:

[0099] Step A: QNDCS sends a heartbeat detection message to all quantum device network nodes within 2-4 seconds;

[0100] Step B: After receiving the heartbeat detection message, any quantum device network node K sends a receive response to QNDCS;

[0101] Step C: If QNDCS receives the received response, it indicates that the quantum device network node K is operating normally;

[0102] If QNDCS does not receive the received response, it jumps to step A; when the number of jumps reaches the 4th time, QNDCS determines that the quantum device network node K is abnormal.

[0103] The method disclosed in this invention establishes a connection between the quantum network control center server (QNDCS) and the quantum device network nodes to obtain the topological network graph of the nodes and the QNDCS server, and realizes the establishment and monitoring of communication between any two quantum device network nodes, thereby strengthening the connection between nodes and improving the communication efficiency between nodes.

[0104] The method disclosed in this invention also uses the QNDCS server to perform heartbeat detection on the nodes to determine whether the nodes have abnormal faults, which plays a role in ensuring real-time network communication. Compared with traditional network debugging methods, this method does not touch the data content in the process of transmission, thus improving the overall security of network communication.

[0105] Based on the disclosure and teachings of the foregoing specification, those skilled in the art can 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 protection scope of the claims of the present invention. Furthermore, although some specific terms are used in this specification, these terms are only for convenience of explanation and do not constitute any limitation on the invention.

Claims

1. A debugging method for a quantum distribution network based on message tracing, characterized in that, The steps of this method are as follows: Step 1: Any two quantum device network nodes , where i<j, i=1,2……n, j=1,2……n, establish a session connection through QNDCS; The QNDCS constructs a two-dimensional array G based on the connection relationships of each quantum device network node and calculates the weight of the edge between two adjacent quantum device network nodes. The steps for constructing the two-dimensional array G and calculating the weights of the edges between any two adjacent quantum device network nodes are as follows: Step 1-7-1: QNDCS creates a two-dimensional integer array based on the total number of nodes m. G m m The connection between any two quantum device network nodes corresponds to an array element in a two-dimensional array, and each array element corresponds to a value. The rules for the array element values ​​are as follows: When adjacent quantum device network nodes are connected, the corresponding array element value is 1; when adjacent quantum device network nodes are disconnected, the corresponding array element value is -1; when adjacent quantum device network nodes are the same node, the corresponding array element value is 0. Step 1-7-2: The QNDCS obtains all array element values ​​of the two-dimensional array based on the connection status of any adjacent quantum device network nodes among all nodes; Step 1-7-3: All array element values ​​constitute the adjacency matrix of the network topology graph, and the data structure of the adjacency matrix is ​​represented as the network topology graph; Step 1-7-4: The QNDCS calculates the weight of the edge when the adjacent quantum device network nodes are in a connected state, and replaces the corresponding array element value with the weight; Step 2: The QNDCS calculates the quantum device network nodes based on Dijkstra's algorithm. , The optimal path and the total weight of the optimal path between them; Step 3: The QNDCS generates a routing table information for the optimal path based on the optimal path, and then lists the quantum device network nodes. As the starting node of routing table information and a quantum device network node As the termination node of the routing table information; Step 4: The QNDCS sends the routing table information of the optimal path to each quantum device network node on the optimal path; The routing table information includes the session ID, the ID of each node on the optimal path, and the next-hop node ID corresponding to each node ID; Step 5: Quantum Device Network Nodes Based on the routing table information, the sub-device network nodes Send data packets and send a session start request to QNDCS to establish a quantum device network node. , Session connection, and mark the moment the session connection is established as ; Step 6: The quantum device network node Received from quantum device network node The system sends data packets and searches for the next-hop node based on the routing table information. The next-hop node is the network node of this quantum device. At that time, the quantum device network node Sending a session termination request to QNDCS and disconnecting QNDCS will disconnect the quantum device network node. , The session is established, and the moment the session is disconnected is marked as... ; Step 7: QNDCS calculates the information processing time difference based on the start marker in Step 5 and the end marker in Step 6. The .

2. The debugging method for a quantum distribution network based on message tracing according to claim 1, characterized in that, The specific steps of step 1 are as follows: Step 1-1: Any two quantum device network nodes , where i<j, i=1,2……n, j=1,2……n, respectively initiate a connection request to the QNDCS; Step 1-2: The QNDCS determines the quantum device network nodes. , Is it connected? If quantum device network nodes , If connected, then the QNDCS vector sub-device network node , Returns a connection refused message; If quantum device network nodes , If not connected, then respectively with , Establish a connection; Steps 1-3: Quantum Device Network Nodes Send the session request to the quantum device network node via QNDCS. ; Steps 1-4: Quantum Device Network Nodes Based on the session request, a connection establishment response request is made, and the response request is sent to the quantum device network node via QNDCS. ; Steps 1-5: Quantum Device Network Nodes Upon receiving the response request, the quantum device network node , Establishment of a session connection; Steps 1-6: Quantum Device Network Nodes , The connection relationship information with the adjacent quantum device network nodes is sent to the QNDCS at intervals of 15 to 18 seconds; Steps 1-7: The QNDCS constructs a two-dimensional array G based on the connection relationship information of each quantum device network node and calculates the weight of the edge between any two adjacent quantum device network nodes.

3. The debugging method for a quantum distribution network based on message tracing according to claim 2, characterized in that, In step 1-7-4, the weights of edges when adjacent quantum device network nodes are in a connected state are calculated. The formula is: ； in, t For information to pass through channels i Time required Indicates pathway i Location on the path, For pathway i The delay value at the starting point, For pathway i The delay value at the endpoint, Represents a node i and nodes j The delay value of the composed path, wherein the initial value of the delay value is 1.

4. The quantum distribution network debugging method based on message tracing according to claim 2, characterized in that, In step 2, the total weight of the optimal path is equal to the sum of the weights of the edges on the optimal path.

5. A quantum distribution network debugging method based on message tracing according to claim 2, characterized in that, The QNDCS also performs anomaly detection on quantum device network nodes. The anomaly detection steps are as follows: Step A: QNDCS sends a heartbeat detection message to all quantum device network nodes within 2-4 seconds; Step B: After receiving the heartbeat detection message, any quantum device network node K sends a receive response to QNDCS; Step C: If QNDCS receives the received response, it indicates that the quantum device network node K is operating normally; If QNDCS does not receive the received response, proceed to step A; When the jump count is 4, the QNDCS determines that the quantum device network node K is abnormal.

Images