A quantum distribution network debugging system based on packet tracking

Abstract

The application discloses a kind of quantum distribution network debugging systems based on message tracking, including QNDCS and multiple quantum equipment network nodes;QNDCS is provided with session establishment module, edge weight calculation module, optimal path module, routing table information sending module, message transmission module, marking module and time difference calculation module;Session establishment module establishes the session connection of quantum equipment network node;Edge weight calculation module calculates the weight of the edge of adjacent network node;Optimal path module calculates the optimal path between network node;Routing table information sending module routing table information;Marking module marks the time of network node session establishment and disconnect;Time difference calculation module calculates the time difference between session establishment and disconnect.The application realizes the transmission of data by establishing the connection topology graph of central server QNDCS and node and calculating optimal path, reduces the throughput of system and realizes the secure communication of quantum network node.

Description

Technical Field

[0001] This invention relates to the field of quantum communication, and more specifically to a quantum distribution network debugging system based on message tracing. Background Technology

[0002] Quantum communication networks have seen rapid development and will benefit countless households. However, in the communication structure of quantum distribution networks, communication between different device nodes requires an operation on the database for each forwarding operation via a central control server. This reduces system efficiency, hindering effective data forwarding and real-time communication.

[0003] The existing solution for integrating quantum communication and classical communication networks uses a pre-configured network debugging approach to achieve fault repair during network debugging. However, the scheduling of the server in this technical solution is proactive, requiring device nodes to initiate debugging requests. This approach cannot monitor sudden faults in real time, thus failing to guarantee real-time network communication.

[0004] Therefore, it is necessary to improve upon the shortcomings of existing technologies and propose a communication debugging system for quantum distribution networks that tracks data between nodes through message tracking. Summary of the Invention

[0005] The purpose of this invention is to overcome the shortcomings of the prior art and to solve the communication efficiency and security problems of quantum distribution networks. A quantum distribution network debugging system based on message tracing is proposed.

[0006] The method of this invention is achieved through the following technical solution:

[0007] A quantum distribution network debugging system based on message tracing, including QNDCS and multiple quantum device network nodes;

[0008] 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.

[0009] 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.

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

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

[0012] The edge weight calculation module is configured to construct a two-dimensional array G according to the connection relationship of each quantum device network node and calculate the weight of the edge between two adjacent quantum device network nodes;

[0013] The optimal path module is configured to calculate, according to the Dijkstra algorithm, the optimal path between quantum device network node K i , K j and form a routing table containing optimal path information, and calculate the total weight of the optimal path at the same time;

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

[0015] The message transmission module is configured to transmit the data message of quantum device network node K i to quantum device network node K according to the routing table information j ;

[0016] The marking module is configured to mark the session establishment and disconnection moments of any two quantum device network nodes K i , K j , mark the connection establishment moment as t0, and mark the connection disconnection moment as t x ;

[0017] The time difference calculation module is configured to calculate an information processing time difference Δt, where Δt=t x -t0.

[0018] Further, the steps for establishing a connection between any two quantum device network nodes through a quantum network are as follows:

[0019] 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;

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

[0021] 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 ;

[0022] If quantum device network nodes K i , K jIf not connected, then connect with K respectively. i K j Establish a connection.

[0023] Specifically, the steps for QNDCS and multiple quantum device network nodes to establish a connection through a classical network are as follows:

[0024] Steps 1-3: Quantum device network node K i Send the session request to quantum device network node K via QNDCS. j ;

[0025] Steps 1-4: Quantum Device Network Node K j Based on the session request, a connection establishment response request is made, and the response request is sent to the quantum device network node K via QNDCS. i ;

[0026] Steps 1-5: Quantum Device Network Node K i Upon receiving the response request, quantum device network node K i K j Establishment of a session connection;

[0027] Steps 1-6: Quantum Device Network Node K i K j The connection relationship information with the adjacent quantum device network nodes is sent to the QNDCS at intervals of 15 to 18 seconds.

[0028] 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.

[0029] Furthermore, 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:

[0030] 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:

[0031] 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.

[0032] 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;

[0033] 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;

[0034] 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.

[0035] 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:

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

[0037] 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.

[0038] Furthermore, the total weight of the optimal path is equal to the sum of the weights of the edges on the optimal path.

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

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

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

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

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

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

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

[0046] 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

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

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

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

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

[0051] 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.

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

[0053] 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.

[0054] 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.

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

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

[0057] The edge weight calculation module is configured to construct a two-dimensional array G according to the connection relationship of each quantum device network node and calculate the weight of the edge between two adjacent quantum device network nodes;

[0058] The optimal path module is configured to calculate, according to the Dijkstra algorithm, the optimal path between quantum device network nodes K i , K j and form a routing table containing optimal path information, and calculate the total weight of the optimal path at the same time;

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

[0060] The packet transmission module is configured to transmit the data packet of the quantum device network node K i to the quantum device network node K according to the routing table information j ;

[0061] The marking module is configured to mark the session establishment and disconnection moments of any two quantum device network nodes K i , K j , mark the connection establishment moment as t0, and mark the connection disconnection moment as t x ;

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

[0063] The steps for establishing a connection between any two quantum device network nodes through the quantum network in the system of this embodiment are as follows:

[0064] 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;

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

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

[0067] If quantum device network node K i K j If not connected, then connect with K respectively. i K j Establish a connection.

[0068] Specifically, the steps for QNDCS and multiple quantum device network nodes to establish a connection through a classical network are as follows:

[0069] Steps 1-3: Quantum device network node K i Send the session request to quantum device network node K via QNDCS. j ;

[0070] Steps 1-4: Quantum Device Network Node K j Based on the session request, a connection establishment response request is made, and the response request is sent to the quantum device network node K via QNDCS. i ;

[0071] Steps 1-5: Quantum Device Network Node K i Upon receiving the response request, quantum device network node K i K j Establishment of a session connection;

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

[0073] 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.

[0074] 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:

[0075] 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:

[0076] 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.

[0077] 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.

[0078] 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;

[0079] 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;

[0080] 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.

[0081] 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.

[0082] 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.

[0083] 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:

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

[0085] 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 ijAll values ​​are calculated based on actual applications, and the initial value of the delay value is 1.

[0086] 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;

[0087] 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.

[0088] The total weight of the optimal path is equal to the sum of the weights of all edges on the optimal path.

[0089] 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;

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

[0091] 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;

[0092] 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.

[0093] 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 ;

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

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

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

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

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

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

[0100] The system of 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.

[0101] 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.

[0102] 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 system for a quantum distribution network based on message tracing, characterized in that, Including QNDCS and multiple quantum device network nodes; 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. 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. The QNDCS is the quantum network control center server; The session establishment module is used to establish network nodes between any two quantum devices. , The session connection; 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. The optimal path module is used to calculate the quantum device network nodes according to Dijkstra's algorithm. , 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. 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; The message transmission module is used to transmit quantum device network nodes Data packets are transmitted to quantum device network nodes according to routing table information. ; The tagging module is used to tag any two quantum device network nodes. , The times of session establishment and termination are marked, and the time of connection establishment is marked as... The time of disconnection is marked as ; The time difference calculation module is used to calculate the time difference value for information processing. The 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 of 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.

2. The quantum distribution network debugging system based on message tracing according to claim 1, characterized in that, The steps for establishing a connection between any two quantum device network nodes via a quantum network 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 already connected, 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.

3. The quantum distribution network debugging system based on message tracing according to claim 2, characterized in that, The steps for establishing a connection between the QNDCS and the multiple quantum device network nodes through a classical network are as follows: 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.

4. The quantum distribution network debugging system based on message tracing according to claim 1, 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, For information to pass through channels Time required Indicates pathway Location on the path, For pathway The delay value at the starting point, For pathway The delay value at the endpoint, Represents a node and nodes The delay value of the composed path, wherein the initial value of the delay value is 1.

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

6. A quantum distribution network debugging system based on message tracing according to claim 1, 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