Networking and table building method and system, and storage medium
By assigning a unique communication ID to each network unit through an adjacency detection mechanism, the efficiency and flexibility issues of network unit identifier allocation and topology discovery in existing technologies are resolved. This enables automated and integrated network table creation, improving the intelligence and communication reliability of the network system.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- WUHAN UNIV
- Filing Date
- 2026-04-10
- Publication Date
- 2026-06-05
AI Technical Summary
The current identification allocation and topology discovery of network units rely on fixed preset addresses or manual configuration, resulting in low deployment efficiency, poor flexibility, and difficulty in adapting to dynamic expansion and rapid generation of global topology.
The adjacency detection mechanism determines the physical connection status between network units, assigns a unique communication ID to each network unit based on the detection results, generates a global network topology table, and dynamically adapts to changes in the number of network units and connection relationships.
It improves the flexibility and efficiency of network topology, ensures the uniqueness of identifiers, realizes automated and integrated network table creation, and enhances the reliability and intelligence of communication scheduling.
Smart Images
Figure CN122160266A_ABST
Abstract
Description
Technical Field
[0001] This invention belongs to the field of digital information transmission technology, and more specifically, relates to a network table creation method and system, and a storage medium. Background Technology
[0002] In modular networking, array-type networking units, and distributed electronic unit interconnection systems, multiple networking units are typically deployed adjacently and interconnected via physical lines. To achieve orderly communication, data forwarding, and unified scheduling between units, it is necessary to assign a unique identifier to each networking unit and establish a global networking topology table that reflects the physical connection relationships of each unit.
[0003] Existing network unit identifier allocation and topology discovery largely rely on fixed preset addresses or manual static configuration. This approach is not only inefficient in deployment but also lacks flexibility when nodes fail or physical connections change. Furthermore, traditional centralized topology acquisition methods require polling each unit individually, a cumbersome and time-consuming process that is difficult to adapt to network structures with multiple branches and multi-directional expansion. Therefore, existing networking methods have significant shortcomings in dynamic expansion, adaptive table creation, and rapid global topology generation, making it difficult to meet the automated table creation requirements of modular and scalable networking systems. Summary of the Invention
[0004] This invention provides a network table creation method, system, and storage medium to solve the problems of low deployment efficiency and poor flexibility in existing network technologies.
[0005] In a first aspect, the present invention provides a method for creating a network table, comprising the following steps: The physical connection status between network units is determined through an adjacency detection mechanism. Based on the adjacency detection results, a unique communication ID is assigned to each network unit. Specifically, when an adjacency connection is detected, an ID allocation command is sent to the adjacent network unit. When no adjacency connection is detected, the ID allocation process in that direction is terminated. A global network topology table is generated based on the ID allocation results and adjacency status information.
[0006] Preferably, the sender of the ID allocation instruction is the initiating network unit that acts as the initiating node; The initiating network unit sends an ID allocation command to the adjacent network units; The network unit assigned an ID confirms its subsequent connection status in each direction through adjacency detection and reports its identity information and connection information to the initiating network unit. The initiating network unit sends subsequent direction ID allocation instructions to the network unit with the assigned ID level by level based on the reported identity information and connection information; The network unit assigned an ID sends an ID allocation instruction to the corresponding successor direction according to the instruction of the initiating network unit, and relays the identity information and connection information of the successor network unit to the initiating network unit. The initiating network unit aggregates all information to obtain the topology connections of the entire system and the identity information of each network unit.
[0007] Preferably, the sender of the ID allocation instruction includes the initiating network unit as the initiating node and the network unit to which the ID is allocated; The initiating network unit sends an ID allocation command to the adjacent network units; The network unit assigned an ID autonomously confirms the subsequent connection status in each direction through adjacency detection. The network unit assigned an ID autonomously allocates subsequent communication IDs to the adjacent subsequent directions and collects the identity information and connection information reported by each subsequent network unit. After completing the ID allocation and topology connection relationship collection for itself and all subsequent directions, each network unit summarizes and reports to the network units in the preceding direction. The initiating network unit aggregates all information to obtain the topology connections of the entire system and the identity information of each network unit.
[0008] Preferably, multiple branches perform adjacency detection in parallel, including at least one of the following methods: multiple networking units simultaneously initiate adjacency detection for their respective adjacent successor directions; the same networking unit simultaneously initiates adjacency detection for the successor directions of multiple of its adjacent units.
[0009] Preferably, the adjacency detection mechanism includes: sending a query signal in the adjacency direction, and determining the physical connection status based on the presence or absence of a response signal.
[0010] Preferably, the adjacency detection mechanism includes: detecting the level signal in the adjacency direction and determining the physical connection status based on the level status.
[0011] Preferably, when assigning communication IDs to subsequent directions, continuous numbering or segmented numbering is used.
[0012] Preferably, when a network unit is added or removed, the adjacency detection and ID allocation process is retried to update the global network topology table; after the global network topology table is generated, it is broadcast to each network unit for synchronous update.
[0013] Secondly, the present invention provides a network table building system, comprising: multiple network units, each of which includes an adjacency detection module, a communication module, and a control module; The adjacency detection module is used to determine the physical connection status between networking units through an adjacency detection mechanism. The communication module is used to perform data transmission and reception between networking units under the control of the control module; The control module is used to assign a unique communication ID to each network unit based on the adjacency detection result of the adjacency detection module; wherein, when an adjacency connection is detected, an ID allocation instruction is sent to the adjacent network unit through the communication module; when no adjacency connection is detected, the ID allocation process in that direction is terminated. The control module is also used to generate a global network topology table based on the ID allocation result and adjacency status information; The network table creation system is used to perform the steps in the network table creation method as described in the first aspect of the present invention.
[0014] Thirdly, the present invention provides a storage medium storing a computer program, which, when executed by a processor, implements the network table creation method as described in the first aspect of the present invention.
[0015] One or more technical solutions provided in this invention have at least the following technical effects or advantages: The network topology table construction scheme provided by this invention first determines the physical connection status between network units through an adjacency detection mechanism; then, based on the adjacency detection results, it assigns a unique communication ID to each network unit; specifically, when an adjacency connection is detected, an ID allocation command is sent to the adjacent network unit; when no adjacency connection is detected, the ID allocation process in that direction is terminated; finally, a global network topology table is generated based on the ID allocation results and adjacency status information. This invention adaptively determines the physical connection status through an adjacency detection mechanism, eliminating the need for manual presets or forced configurations. It can adapt to scenarios with dynamic changes in the number, arrangement, and connection relationships of network units, improving network flexibility. This invention directly drives ID allocation based on connection status—allocating IDs when there is a connection and terminating the process in that direction when there is no connection—resulting in simple logic and high execution efficiency. This significantly reduces the time required for topology table construction, improves deployment efficiency, and is also adaptable to multi-branch parallel table construction scenarios. Furthermore, this invention orderly allocates unique communication IDs based on adjacency detection results, avoiding ID duplication and conflicts from the process perspective, ensuring the uniqueness of each network unit's identifier, and providing a foundation for subsequent orderly communication and data forwarding. This invention directly generates a global network topology table from ID allocation results and adjacency status information, without the need for additional collection and integration processing, achieving automated and integrated table creation, which can improve the intelligence level and communication scheduling reliability of the network system. Attached Figure Description
[0016] Figure 1 This is a schematic diagram of the overall process of a network table creation method provided in an embodiment of the present invention; Figure 2 This is a schematic diagram showing the connection of multiple networking units in a networking table creation method provided in an embodiment of the present invention. Detailed Implementation
[0017] To better understand the above technical solutions, the following will provide a detailed explanation of the technical solutions in conjunction with the accompanying drawings and specific implementation methods.
[0018] The first aspect of this invention provides a method for creating a network table, see [link to relevant documentation]. Figure 1 It mainly includes the following steps: S1. Determine the physical connection status between networking units through the adjacency detection mechanism.
[0019] The adjacency detection mechanism can be any one of the following two methods: (1) Send a query signal in the adjacent direction and determine the physical connection status based on the presence or absence of a response signal.
[0020] (2) Detect the level signal in the adjacent direction and determine the physical connection status based on the level status.
[0021] S2. Based on the adjacency detection results, assign a unique communication ID to each network unit.
[0022] Specifically, when an adjacent connection is detected, an ID allocation command is sent to the adjacent networking unit; when no adjacent connection is detected, the ID allocation process in that direction is terminated.
[0023] S3. Generate a global network topology table based on the ID allocation results and adjacency status information.
[0024] This invention can assign communication IDs to subsequent directions using either consecutive or segmented numbering. When a network unit is added or removed, the adjacency detection and ID allocation process is retried, updating the global network topology table. After generating the global network topology table, it is broadcast to all network units for synchronous updates.
[0025] The present invention will be further described below with reference to Examples 1 and 2.
[0026] Example 1: Example 1 provides a method for creating tables in a network. In Example 1, the sender of the ID allocation instruction is the initiating network unit, which acts as the initiating node. That is, Example 1 divides the multiple network units involved in creating tables into two categories: the initiating network unit and other network units. The initiating network unit sends the ID allocation instruction, while other network units do not perform the ID allocation operation. Example 1 is essentially a centralized table creation scheme.
[0027] In Example 1, the initiating network unit sends an ID allocation command to the adjacent network units; the network unit assigned an ID confirms its subsequent connection status in each direction through adjacency detection and reports its identity information and connection information to the initiating network unit; based on the reported identity information and connection information, the initiating network unit sends subsequent direction ID allocation commands to the network units assigned IDs level by level; the network units assigned IDs send ID allocation commands to the corresponding subsequent directions according to the instructions of the initiating network unit, and relay the identity information and connection information of the subsequent network units to the initiating network unit; the initiating network unit summarizes all information to obtain the topology connection relationship of the entire system and the identity information of each network unit.
[0028] The following is combined with Figure 2 Example 1 will be illustrated.
[0029] See Figure 2 The core mechanism of Example 1 is as follows: the entire process is centrally controlled by networking unit 1-1 (the initiating node, i.e., the initiating networking unit), which gradually allocates communication IDs to each subsequent networking unit and collects identity information. Networking unit 1-1 has the right to schedule the global table creation process.
[0030] The network table creation method provided in Example 1 includes the following steps: S11, Networking unit 1-1 sends the message "You are networking unit 2-1" through the adjacent communication line below.
[0031] S12. Network unit 2-1 first confirms the connectivity status of the successor direction through adjacency detection (finding connections on the right and bottom sides), and then replies to network unit 1-1 above: "My identity information is BBBB, and I have connections on the right and bottom sides."
[0032] S13. After receiving the message, networking unit 1-1 actively instructs: "Network unit 2-1, please inform the right side that 'you are networking unit 2-2'".
[0033] S14. Networking unit 2-1 sends to the right: "You are networking unit 2-2".
[0034] S15. Network unit 2-2 performs the same operation and replies to network unit 2-1 on the left: "My identity information is CCCC, I have no connection on the right."
[0035] S16. Network unit 2-1 relays the message to the network unit 1-1 above it: "Forward message 'My identity information is CCCC, I have no connection on the right'".
[0036] S17. Networking unit 1-1 continues to issue instructions to other directions (lower side) of networking unit 2-1 in sequence, repeating the above steps.
[0037] After completing the above steps, the networking unit 1-1 obtains the topology connection relationship of the entire system and the identity information of each unit. Each networking unit learns its own communication ID (such as "2-1", "2-2", "3-1", etc.). Subsequently, the networking unit 1-1 centrally controls the communication and initiates communication through the communication ID. The networking unit in the middle position is responsible for message forwarding (or uses a bus method to connect the electrical connections in all directions).
[0038] That is, in Example 1, the "which direction to send" for each step is driven by the instructions of the networking unit 1-1, and the intermediate nodes passively perform forwarding without making autonomous decisions.
[0039] Example 1 has the following advantages: (1) Higher networking flexibility: The physical connection status is adaptively determined through the adjacency detection mechanism, without the need for manual preset or forced configuration. It can adapt to scenarios where the number, arrangement and connection relationship of networking units change dynamically, thus improving networking flexibility.
[0040] (2) Higher deployment efficiency: ID allocation is driven directly based on connection status. If there is a connection, the ID is allocated; if there is no connection, the process in that direction is terminated. The logic is simple and the execution is efficient, which can significantly shorten the time spent building the topology table and improve deployment efficiency.
[0041] (3) Ensure the uniqueness of the identifier: Based on the adjacency detection results, the unique communication ID is allocated in an orderly manner, which can avoid ID duplication and conflict in the process, ensure the uniqueness of the identifier of each network unit, and provide a foundation for subsequent orderly communication and data forwarding.
[0042] (4) Improve communication reliability: The global network topology table is generated directly from the ID allocation results and adjacency status information without the need for additional collection and integration processing. This achieves automated and integrated table building, which can improve the intelligence level of the network system and the reliability of communication scheduling.
[0043] Example 2: Example 2 provides a network table creation method. In Example 2, the sender of the ID allocation command includes the initiating network unit as the initiating node and the network unit to which the ID is allocated. That is, Example 2 divides the multiple network units involved in network table creation into two categories: the initiating network unit and other network units. Both the initiating network unit and other network units can send ID allocation commands. Example 2 is essentially a decentralized table creation scheme.
[0044] In Example 2, the initiating network unit sends an ID allocation command to the adjacent network units; the network unit assigned an ID autonomously confirms the subsequent connection status in each direction through adjacency detection, and autonomously allocates subsequent communication IDs to the adjacent subsequent directions, and collects the identity information and connection information reported by each subsequent network unit; after completing the ID allocation and topology connection relationship collection for itself and all subsequent directions, each network unit summarizes and reports to the network units in the preceding direction; the initiating network unit summarizes all information to obtain the topology connection relationship of the entire system and the identity information of each network unit.
[0045] Since Example 2 is essentially a decentralized table building scheme, adjacency detection can be performed in parallel by multiple branches, including at least one of the following methods: multiple networking units simultaneously initiate adjacency detection for the successor direction of their respective adjacencies; the same networking unit simultaneously initiates adjacency detection for the successor direction of multiple adjacencies of its own.
[0046] The following is combined with Figure 2 Example 2 will be illustrated.
[0047] See Figure 2 The core mechanism of Example 2 is as follows: Network unit 1-1 only assigns the first-level ID (2-1). Thereafter, each unit autonomously detects the successor direction and assigns the successor ID through adjacency detection, without requiring step-by-step instructions from network unit 1-1. After completing the table construction for all successor directions, each network unit summarizes and reports the results to the preceding direction.
[0048] The network table creation method provided in Example 2 includes the following steps: S21, Networking unit 1-1 sends the message "You are networking unit 2-1" through the adjacent communication line below.
[0049] S22, Networking Unit 2-1 replies: "Received".
[0050] S23. Networking unit 2-1 confirms that there is a connection on the right through adjacency detection and autonomously sends to the right: "You are networking unit 2-2".
[0051] Among them, networking unit 2-1 autonomously determines which directions are connected through adjacency detection.
[0052] For example, using the level detection method, a very weak pull-down is applied to the right successor direction of the networking unit 2-1. If a weak pull-up (such as 10kΩ) is provided in the forward direction of the right networking unit 2-2, the networking unit 2-1 detects a high level and determines that there is a connection on the right; if there is no connection, it is a low level.
[0053] For example, using the command detection method, network unit 2-1 sends a "whether there is a connection" query to the right. If there is a network unit, it replies "connection exists". If there is no reply after a timeout, it is determined that there is no connection.
[0054] S24, Networking Unit 2-2 replies to the left: "Received".
[0055] S25. Network unit 2-2 continues to probe to the right (no connection detected, no response after timeout, indicating no node on the right); at the same time, network unit 2-1 continues to probe downwards (in parallel).
[0056] S26. Networking unit 2-2 has no other successor directions. The table is completed. Report to the preceding direction's networking unit 2-1: "The block list for this direction is: Networking unit 2-2 (identity information CCCC)".
[0057] S27. Networking unit 2-1 collects block lists from all subsequent directions (right and bottom), integrates its own identity information, and reports upwards: "The block list for this direction is: Networking unit 2-1 (identity information BBBB); the right side is networking unit 2-2 (identity information CCCC); the bottom side is networking unit 3-1 (identity information DDDD)."
[0058] After completing the above steps, the networking unit 1-1 obtains the topology connection relationship of the entire system and the identity information of each unit. Each networking unit learns its own communication ID, and subsequently, the networking unit 1-1 initiates communication through the communication ID.
[0059] That is, in Example 2, each intermediate networking unit autonomously detects subsequent directions and autonomously allocates IDs. Multiple branches can build tables in parallel and summarize and report to the predecessor. Networking unit 1-1 only initiates the first step and does not intervene in the intermediate process. The intermediate nodes in Example 2 are both information collectors and ID allocation decision-makers, and have autonomy. Each successor node summarizes the complete subtree list of its own direction to the predecessor level by level, and a single report contains the complete subtree topology.
[0060] Example 2 has the following additional advantages compared to Example 1: (1) Faster table creation speed: In Example 2, each branch creates tables independently and in parallel without waiting for the main control block (i.e., the initiating network unit) to gradually schedule. The overall table creation time increases significantly less with the number of branches than the serial scheme, which is especially obvious for larger topologies.
[0061] (2) Lower communication burden of master control node: In Example 1, the master control block needs to issue instructions to each node in each direction; in Example 2, the master control block only issues the first instruction, and all subsequent intermediate processes do not need to interact with the master control block. Finally, only one summary message is received, which greatly reduces the number of communication times of the master control node.
[0062] (3) The system is more scalable: In Example 2, each node autonomously completes its own level of detection and aggregation. The workload of the master node does not increase linearly with the system size, making it more suitable for scenarios with a large number of nodes.
[0063] (4) Higher integrity of topology information: In Example 2, through the mechanism of summarizing the subtree list level by level, each predecessor node can obtain the complete subtree information of its successor direction. The information structure is clear and hierarchical, which is convenient for subsequent routing and communication management.
[0064] The second aspect of the present invention provides a network table creation system, which will be described below with reference to Embodiment 3.
[0065] Example 3: Example 3 provides a network table creation system, including: multiple network units, each of which includes an adjacency detection module, a communication module, and a control module.
[0066] The adjacency detection module is used to determine the physical connection status between network units through an adjacency detection mechanism. The communication module, under the control of the control module, performs data transmission and reception between network units. The control module assigns a unique communication ID to each network unit based on the adjacency detection results from the adjacency detection module; specifically, when an adjacency connection is detected, an ID allocation command is sent to the adjacent network unit through the communication module; when no adjacency connection is detected, the ID allocation process in that direction is terminated. The control module is also used to generate a global network topology table based on the ID allocation results and adjacency status information.
[0067] The network table creation system provided in Example 3 is used to execute the steps in the network table creation method as described in Example 1 or Example 2.
[0068] Each networking unit in Example 3 may specifically include a controller, a transceiver circuit, and an adjacent communication line. The controller is connected to the transceiver circuit, and the transceiver circuit is connected to other networking units via the adjacent communication line. Each networking unit has one or more adjacent communication lines and correspondingly has one or more transceiver units. After multiple networking units are electrically connected to each other, they can communicate through the adjacent communication lines to ultimately obtain the connection relationship between all networking units and the identity information of each networking unit. The above process is called table building (establishing the topological link relationship of each networking unit, collecting their respective identity information, and storing it in a data structure according to the topological link relationship; this data structure is called a table).
[0069] Since the functions of each module in the network table creation system provided in Embodiment 3 correspond to the steps in the network table creation method provided in Embodiment 1 or Embodiment 2, Embodiment 3 can be understood by referring to Embodiment 1 and Embodiment 2, and will not be repeated here.
[0070] A third aspect of the present invention provides a storage medium, which will be described below with reference to Example 4.
[0071] Example 4: Example 4 provides a storage medium storing a computer program, which, when executed by a processor, implements the network table creation method as described in Example 1 or Example 2.
[0072] Finally, it should be noted that the above specific embodiments are only used to illustrate the technical solutions of the present invention and not to limit it. Although the present invention has been described in detail with reference to examples, those skilled in the art should understand that modifications or equivalent substitutions can be made to the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention, and all such modifications or substitutions should be covered within the scope of the claims of the present invention.
Claims
1. A method for creating tables in a network, characterized in that, Includes the following steps: The physical connection status between network units is determined through an adjacency detection mechanism. Based on the adjacency detection results, a unique communication ID is assigned to each network unit. Specifically, when an adjacency connection is detected, an ID allocation command is sent to the adjacent network unit; when no adjacency connection is detected, the ID allocation process in that direction is terminated. A global network topology table is generated based on the ID allocation results and adjacency status information.
2. The network table creation method according to claim 1, characterized in that, The sender of the ID allocation instruction is the initiating network unit, which acts as the initiating node; The initiating network unit sends an ID allocation command to the adjacent network units; The network unit assigned an ID confirms its subsequent connection status in each direction through adjacency detection and reports its identity information and connection information to the initiating network unit. The initiating network unit sends subsequent direction ID allocation instructions to the network unit with the assigned ID level by level based on the reported identity information and connection information; The network unit assigned an ID sends an ID allocation instruction to the corresponding successor direction according to the instruction of the initiating network unit, and relays the identity information and connection information of the successor network unit to the initiating network unit. The initiating network unit aggregates all information to obtain the topology connections of the entire system and the identity information of each network unit.
3. The network table creation method according to claim 1, characterized in that, The senders of the ID allocation instruction include the initiating network unit as the initiating node and the network unit to which the ID is allocated; The initiating network unit sends an ID allocation command to the adjacent network units; The network unit assigned an ID autonomously confirms the subsequent connection status in each direction through adjacency detection. The network unit assigned an ID autonomously allocates subsequent communication IDs to the adjacent subsequent directions and collects the identity information and connection information reported by each subsequent network unit. After completing the ID allocation and topology connection relationship collection for itself and all subsequent directions, each network unit summarizes and reports to the network units in the preceding direction. The initiating network unit aggregates all information to obtain the topology connections of the entire system and the identity information of each network unit.
4. The network table creation method according to claim 3, characterized in that, Multiple branches perform adjacency detection in parallel, including at least one of the following methods: multiple networking units simultaneously initiate adjacency detection for their respective adjacent successor directions; the same networking unit simultaneously initiates adjacency detection for the successor directions of multiple of its adjacent units.
5. The network table creation method according to claim 1, characterized in that, The adjacency detection mechanism includes: sending a query signal in the adjacency direction, and determining the physical connection status based on the presence or absence of a response signal.
6. The network table creation method according to claim 1, characterized in that, The adjacency detection mechanism includes: detecting the level signal in the adjacency direction and determining the physical connection status based on the level status.
7. The network table creation method according to claim 1, characterized in that, When assigning communication IDs to subsequent directions, either consecutive numbering or segmented numbering methods are used.
8. The network table creation method according to claim 1, characterized in that, When a network unit is added or removed, the adjacency detection and ID allocation process is retried to update the global network topology table. After the global network topology table is generated, it is broadcast to each network unit for synchronous updates.
9. A network table creation system, characterized in that, include: Multiple networking units, each of which includes an adjacency detection module, a communication module, and a control module; The adjacency detection module is used to determine the physical connection status between networking units through an adjacency detection mechanism. The communication module is used to perform data transmission and reception between networking units under the control of the control module; The control module is used to assign a unique communication ID to each network unit based on the adjacency detection result of the adjacency detection module; wherein, when an adjacency connection is detected, an ID allocation instruction is sent to the adjacent network unit through the communication module; when no adjacency connection is detected, the ID allocation process in that direction is terminated. The control module is also used to generate a global network topology table based on the ID allocation result and adjacency status information; The network table creation system is used to perform the steps in the network table creation method as described in any one of claims 1 to 8.
10. A storage medium, characterized in that, The storage medium stores a computer program, which, when executed by a processor, implements the network table creation method as described in any one of claims 1 to 8.