A management method and system of a railway dispatch centralized system node network

Abstract

A management method for a node network in a centralized railway dispatching system includes: initializing network nodes: initializing management nodes, central nodes, station nodes, and dynamic relay nodes in the system network according to the functions and business logic of the centralized dispatching system; setting a network node grouping mechanism: the management node calculates the importance of each node and the set of subordinate nodes of the relay node through a combination of periodic polling and event triggering, controls the dynamic grouping of station nodes and central nodes, and forms a dynamic grouping mechanism; and setting a dynamic information routing mechanism for network nodes: the central node and station nodes calculate their optimal information route through event triggering and form a dynamic routing mechanism under the coordination of the management node.

Description

Technical Field

[0001] This invention relates to a management method and system, and more particularly to a management method and system for a node network of a centralized railway dispatching system. Background Technology

[0002] my country's railway dispatching centralized system adopts a two-layer command architecture of center and station. The center layer divides the terminals into multiple central nodes according to business methods. The station layer forms multiple station nodes based on the station. There are various information interaction needs between central nodes, between station nodes, and between the center and station nodes. It is a typical distributed network system. The traditional dispatching centralized system network structure is constrained by the railway communication network networking mode and channel capacity. It forces the fixed communication link between nodes to realize the collection of a large number of scattered node information and the forwarding of information between nodes, forming a multi-level network node structure such as station node set - server node set - central node set. It mainly has the following three problems: (1) Some nodes have multiple sub-nodes. The failure of the master node will lead to the failure of the entire network including its sub-nodes; (2) The increase in network communication layers increases the risk of failure of the overall network; (3) The fixed link mode between nodes makes it impossible for normal nodes affected by the faulty node to dynamically drift and establish normal link relationships with other related nodes. Therefore, it is urgent to carry out research on the node network management method of dispatching centralized system with high fault tolerance to improve the reliability of information interaction in railway dispatching centralized system. Summary of the Invention

[0003] This invention addresses the problem of insufficient fault tolerance in the network structure of centralized railway dispatching systems by proposing a management method and apparatus for the node network of such systems. By adding management nodes and implementing dynamic node grouping and dynamic information routing settings, the fault tolerance and reliability of information interaction in the centralized railway dispatching system are improved. The technical solution is as follows:

[0004] A management method for a node network in a centralized railway dispatching system, characterized by:

[0005] Step S1 Initialize network nodes: Initialize the management nodes, central nodes, station nodes, and dynamic relay nodes in the system network according to the functions and business logic of the dispatching centralized system;

[0006] Step S2 sets up a network node grouping mechanism: The management node calculates the importance of each node and the set of subordinate nodes of the relay node through a combination of periodic polling and event triggering, controls the dynamic grouping of station nodes and central nodes, and forms a dynamic grouping mechanism.

[0007] Step S3 sets up a dynamic information routing mechanism for network nodes: The central node and station nodes calculate their optimal information routes through event triggering, and form a dynamic routing mechanism under the coordination of the management node.

[0008] The present invention also discloses a management device for a node network of a centralized railway dispatching system.

[0009] The present invention also discloses a non-volatile storage medium, characterized in that the non-volatile storage medium includes a stored program, wherein the program, when running, controls the device where the non-volatile storage medium is located to execute the above-described method.

[0010] The present invention also discloses an electronic device, characterized in that it comprises a processor and a memory; the memory stores computer-readable instructions, and the processor is used to execute the computer-readable instructions, wherein the computer-readable instructions execute the method described above.

[0011] Beneficial effects

[0012] (1) Improve the system's fault tolerance capability under partial node failure;

[0013] (2) A management node was added to the actual centralized scheduling network system, and the problem of information transmission failure of related nodes caused by the failure of a single node was solved by dynamically calculating the grouping and information routing of each node in the network. Attached Figure Description

[0014] Figure 1 This is a schematic diagram of the management method for the node network of the railway dispatching centralized system of the present invention;

[0015] Figure 2 This is a schematic diagram illustrating a distributed node network.

[0016] Figure 3 A diagram illustrating the routing attribute settings for node information;

[0017] Figure 4 This is a diagram illustrating a link communication failure between nodes. Detailed Implementation

[0018] This invention proposes a management method for a node network in a centralized railway dispatching system. A flowchart of this method is shown below. Figure 1 As shown.

[0019] In step S1, the network structure and information transmission business logic of the railway dispatching centralized system are first dissected. The network structure of the dispatching centralized system is divided into a central node layer (including business platform nodes such as dispatch consoles, control consoles, display consoles, and query consoles), a station node layer (including platform nodes such as station communication services, train operation terminals, and signalman terminals), and relay nodes (including nodes such as front-end communication devices and servers) with information collection, preliminary processing, and forwarding functions. Various types of information in the dispatching centralized system flow through various network nodes. Platform functional nodes selectively receive and process information according to their own business needs. Secondly, to achieve flexible management of the information transmission needs of each business node within the network, the traditional method of determining node link objects and information transmission directions based on the static configuration of each node is abandoned. Instead, a management node is added to perform dynamic management of the node network at a global level. Finally, based on the business characteristics of each node, the initialization of each node is achieved through interaction with the management node.

[0020] Let a certain type of central node be Where x represents the type of the central node, x∈{1,2,...,W}, W represents the total number of central node types, and M represents the total number of central nodes of that type (e.g., the dispatching station); the station nodes are s1,s2,...,s N-1 ,s N Where N represents the total number of station sub-nodes; the various information types in the centralized scheduling system are i1, i2, ..., i P-1 i P , where P represents the total number of information types. For example... Figure 2 As shown, station nodes s can be constructed. i For the information demand matrix L of the station nodes, i.e.

[0021]

[0022] Among them, l i,j Represents node s i With node s n The generated information i p Does an information demand relationship exist between them (where i∈{1,2,…,N}, j∈{1,2,…,P})? If so, then l i,j =1, otherwise l i,j =0. Similarly, we can construct the central node c respectively. i The demand matrix between central nodes and the demand matrix between central and station nodes are generated. Based on this, the management node is initialized to set the information requirements of each service node. The management of relay nodes is implemented in step S2.

[0023] In step S2, with Figure 2Taking the centralized distributed node network shown as an example, the management node calculates a set of node groups including relay nodes based on the initial node information requirements. This set is used to determine the default information flow between network nodes, thus solving the problem of reliable information exchange between nodes. The specific implementation method of step S2 is as follows.

[0024] Step S2-1: Set up the relay node set.

[0025] Because railway dispatching and command adopts a system where designated dispatching stations manage all stations within designated dispatching sections, the grouping of station nodes is constrained to some extent by their respective dispatching sections. Furthermore, the central node requires information from the entire railway network. If point-to-point communication between station nodes and the central node were used, it would require establishing numerous stable, 24 / 7 communication links between nodes, consuming significant link resources and generating a large amount of redundant information. This could easily cause congestion of the limited bandwidth of the centralized railway dispatching system. Therefore, relay nodes are introduced to manage a certain number of service nodes, enabling the overall collection and forwarding of data from subordinate service nodes. The specific method is as follows:

[0026] (1) Determine the number of scheduling sections SEC_N, the number of stations STA_N, and set the threshold for the number of subordinate nodes of each relay node to RLY_MAX;

[0027] (2) Define the hierarchical relationship between the dispatching section and each station, and construct the relationship matrix A between the dispatching section and the station, i.e.

[0028]

[0029] Among them, a i,j Represents node c i With node s j The membership relation (where i∈{1,2,…,M}, j∈{1,2,…,N}). If a membership relation exists, then a i,j =1, otherwise a i,j =0. Due to the special nature of railway hub stations, station nodes and dispatching nodes are not in a one-to-one correspondence; some stations have subordinate relationships with multiple dispatching stations. Since dispatching stations frequently exchange information with stations within their jurisdiction, stations within the same dispatching station's jurisdiction are preferentially grouped into the same set. However, because the number of station nodes within different dispatching stations is not balanced, and different dispatching stations also have information exchange needs with boundary stations, the jurisdiction of a dispatching station and the station nodes within its dispatching section may not completely overlap.

[0030] (3) Calculate the number of relay nodes Y① First, based on the relationship matrix, calculate the number of single-subordinate station nodes within each scheduling section; ② If a non-single-subordinate station node exists within a certain section, and the node is located at the boundary between two scheduling sections, then assign it to the scheduling section with fewer single-subordinate station nodes; otherwise, assign it to the current scheduling section; ③ Let And assign node weights to station nodes based on their positions within the dispatching section; ④ Transform the grouping into a knapsack problem and calculate the grouping results; ⑤ Set grouping evaluation conditions (station nodes in the same dispatching section should be grouped in the same group as much as possible, the same group should not span 3 dispatching sections, and the number of station nodes in each group should be as consistent as possible), and evaluate the grouping results; ⑥ If the evaluation result is low, then let Y =Y+1, repeat ④⑤ until the evaluation result is acceptable, and determine the number of relay nodes;

[0031] Step S2-2: Set up a node grouping mechanism, such as... Figure 3 As shown.

[0032] (1) The management node constructs the information route for each node based on the relay node and its subordinate nodes calculated in step S2-1, combined with the node information demand matrix constructed in step S1, and determines the link relationship matrix between the station node, the central node and the relay node.

[0033] (2) After each node starts up, it registers with the management node using a combination of node ID and password;

[0034] (3) The management node verifies the legitimacy of the node according to its internal verification mechanism;

[0035] (4) If it is valid, establish a link with the node and synchronize the link relationship matrix and information demand matrix to the node; otherwise, ignore the node's application and issue an alarm.

[0036] (5) The node establishes a link with the relevant node according to the synchronized link relationship matrix, and encapsulates and sends the various types of information data generated internally according to the information demand matrix.

[0037] (6) The node processes the various types of information data it receives according to the information demand matrix. If the received data does not match the information demand matrix, the node discards the data and sends an alarm message to the management node.

[0038] Step S3 includes the following steps.

[0039] Step S3-1: Node fault determination.

[0040] (1) Each node adopts an event-driven approach combined with the link relationship matrix to monitor its own link status with related nodes. Once the link with a certain node is interrupted, it sends the corresponding alarm information to the management node.

[0041] (2) If in the period T If a normal connection cannot be established with the node, report the node failure to the management node.

[0042] (3) The management node, based on the link relationship matrix, such as Figure 4 As shown, communication between nodes s2 and s3 is interrupted, and random calculation is performed to generate... K A completely different path (usually set to 2 or 3, such as r1→s3 or s4→s3, etc., to avoid excessive calculation affecting timeliness) is sent to the node, and a test information packet (the header of the information packet contains the destination code with the node as the destination, and also contains the IDs of each node on the path, so as to realize the information transmission of the specified path) is encapsulated and sent to the node.

[0043] (4) If a node returns an acknowledgment packet along the original path after receiving the test packet, it can be confirmed that the node is not faulty, but there is a communication failure between specific nodes.

[0044] (5) If the management node does not receive an acknowledgment packet, the node is considered to be faulty;

[0045] Step S3-2: Dynamic information routing update.

[0046] (1) If it is only a communication failure between nodes, the management node will synchronize the new routing method between the two nodes to the corresponding nodes, such as... Figure 4 In the process, the information exchange route between s2 and s3 is updated by the management node to s2→r1→s3 and synchronized to s2 and s3. Then, the message transmission path ID is synchronously updated in the header of the information packets sent by s2 and s3.

[0047] (2) If it is a node failure, after identifying the faulty node, first calculate the set of nodes affected by the node failure based on the link relationship matrix, and then reset the link information routing; Figure 4 For example, if relay node r1 fails, then boundary node s n Establish a link with the next relay node r2, and transition the information paths of other nodes in the packet set of this node to s. n Then message passing is achieved via r2, such as s2→s3→…→s n →r2;

[0048] (3) When the faulty node recovers, the management node will synchronize the original link relationship to each relevant node again.

[0049] This invention proposes a management method for a node network in a centralized railway dispatching system, comprising: initializing network nodes: initializing management nodes, central nodes, station nodes, and dynamic relay nodes in the system network according to the functions and business logic of the centralized dispatching system; setting a network node grouping mechanism: the management node calculates the importance of each node and the set of subordinate nodes of the relay node through a combination of periodic polling and event triggering, controls the dynamic grouping of station nodes and central nodes, and forms a dynamic grouping mechanism; and setting a network node dynamic information routing mechanism: the central node and station nodes calculate their optimal information route through event triggering, and form a dynamic routing mechanism under the coordination of the management node.

[0050] The foregoing has shown and described the basic principles, main features, and advantages of the present invention. Those skilled in the art should understand that the present invention is not limited to the above embodiments. The embodiments and descriptions in the specification are merely principles of the invention. Various changes and modifications can be made to the invention without departing from its spirit and scope, and all such changes and modifications fall within the scope of the claimed invention. The scope of protection claimed by the appended claims and their equivalents is defined.

Claims

1. A management method for a node network in a centralized railway dispatching system, characterized by: Step S1 Initialize network nodes: Initialize the management nodes, central nodes, station nodes, and dynamic relay nodes in the system network according to the functions and business logic of the dispatching centralized system; Step S2 sets up a network node grouping mechanism: The management node calculates the importance of each node and the set of subordinate nodes of the relay node through a combination of periodic polling and event triggering, controls the dynamic grouping of station nodes and central nodes, and forms a dynamic grouping mechanism. Step S3 sets up a dynamic information routing mechanism for network nodes: The central node and station nodes calculate their optimal information routes through event triggering, and form a dynamic routing mechanism under the coordination of the management node; Step S1 includes the following: First, we dissect the network structure and information transmission business logic of the centralized railway dispatching system; Secondly, add management nodes to perform dynamic management of the node network at the global level; Finally, based on the business characteristics of each node, the initialization of each node is achieved through interaction with the management node; Let a certain type of central node be Where x represents the type of the central node, x∈{1,2,...,W}, W represents the total number of central node types, and M represents the total number of central nodes of that type; the station nodes are s1,s2,...,s N-1 ,s N Where N represents the total number of station sub-nodes; the various information types in the centralized scheduling system are i1, i2, ..., i P-1 i P Where P represents the total number of information types; construct station nodes s i For the information demand matrix L of the station nodes, i.e. ； Among them, l i,j Represents node s i With node s n The generated information i p Does an information demand relationship exist between them, where i∈{1,2,…,N}, j∈{1,2,…,P}? If so, then l i,j =1, otherwise l i,j =0; Similarly, we can construct the central node c respectively. i For the demand matrix between central nodes, and the demand matrix between central and station nodes; Step S2 includes the following: Step S2-1: Set up the relay node set: (1) Determine the number of scheduling sections SEC_N, the number of stations STA_N, and set the threshold for the number of subordinate nodes of each relay node to RLY_MAX; (2) Define the hierarchical relationship between the dispatching section and each station, and construct the relationship matrix A between the dispatching section and the station: ； Among them, a i,j Represents node c i With node s j The membership relation (where i∈{1,2,…,M}, j∈{1,2,…,N}); if a membership relation exists, then a i,j =1, otherwise a i,j =0; (3) Calculate the number of relay nodes Y ① First, based on the relationship matrix, calculate the number of single-subordinate station nodes within each scheduling section; ② If a non-single-subordinate station node exists within a certain section, and the node is located at the boundary between two scheduling sections, then assign it to the scheduling section with fewer single-subordinate station nodes; otherwise, assign it to the current scheduling section; ③ Let And assign node weights to station nodes based on their positions within the scheduling section; ④ Transform the grouping into a knapsack problem and calculate the grouping results; ⑤ Set grouping evaluation conditions and evaluate the grouping results; ⑥ If the evaluation result is low, then let Y =Y+1, repeat ④⑤ until the evaluation result is acceptable, and determine the number of relay nodes; Step S2-2: Set up the node grouping mechanism: (1) The management node constructs the information route for each node based on the relay node and its subordinate nodes calculated in step S2-1, combined with the node information demand matrix constructed in step S1, and determines the link relationship matrix between the station node, the central node and the relay node. (2) After each node starts up, it registers with the management node using a combination of node ID and password; (3) The management node verifies the legitimacy of the management node according to its internal verification mechanism; (4) If it is valid, establish a link with the node and synchronize the link relationship matrix and information demand matrix to the node; otherwise, ignore the node's application and issue an alarm. (5) The node establishes a link with the relevant node according to the synchronized link relationship matrix, and encapsulates and sends the various types of information data generated internally according to the information demand matrix. (6) The node processes the various types of information data it receives according to the information demand matrix. If the received data does not match the information demand matrix, the data is discarded and an alarm message is sent to the management node. Step S3 includes the following: Step S3-1: Node Fault Determination: (1) Each node adopts an event-driven approach combined with the link relationship matrix to monitor its own link status with related nodes. Once the link with a certain node is interrupted, it sends the corresponding alarm information to the management node. (2) If in the period T If a normal connection cannot be established with the node, report the node failure to the management node. (3) Based on the link relationship matrix, the management node assumes that the communication between station nodes s2 and s3 is interrupted, randomly calculates and generates K completely different paths to the node, where K is 2 or 3, and encapsulates test information packets and sends them to the node. (4) If a node receives a test packet and then returns an acknowledgment packet along the original path, it can be confirmed that the node is not faulty, but that there is a communication failure between specific nodes. (5) If the management node does not receive an acknowledgment packet, the node is considered to be faulty; Step S3-2: Dynamic Information Routing Update: (1) If it is only a communication failure between nodes, the management node will synchronize the new routing method between the two nodes to the corresponding nodes. The information exchange route between station node s2 and station node s3 will be updated by the management node to station node s2→r1→s3 and synchronized to station node s2 and station node s3. Then the message transmission path ID will be updated in the packet header of the information sent by station node s2 and station node s3, and r1 is the relay node. (2) If it is a node failure, after the failure node is determined, first calculate the set of nodes affected by the failure of the node according to the link relationship matrix, and reset the link information routing. (3) When the faulty node recovers, the management node will synchronize the original link relationship to each relevant node again.

2. A management system for a node network of a centralized railway dispatching system, the system comprising the management method for the node network of a centralized railway dispatching system as described in claim 1, characterized in that, The management system includes the following functional modules: Initialize network node module: Initialize the management node, central node, station node and dynamic relay node in the system network according to the functions and business logic of the centralized scheduling system; The network node grouping mechanism module is configured as follows: The management node calculates the importance of each node and the set of subordinate nodes of the relay node through a combination of periodic polling and event triggering, controls the dynamic grouping of station nodes and central nodes, and forms a dynamic grouping mechanism. The module for setting up a dynamic information routing mechanism for network nodes: The central node and station nodes calculate their optimal information routes through event triggering, and form a dynamic routing mechanism under the coordination of the management node.

3. A non-volatile storage medium, characterized in that, The non-volatile storage medium includes a stored program, wherein the program, when running, controls the device where the non-volatile storage medium is located to execute the method of claim 1.

4. An electronic device, characterized in that, It includes a processor and a memory; the memory stores computer-readable instructions, and the processor is used to execute the computer-readable instructions, wherein the computer-readable instructions, when executed, perform the method of claim 1.

Images