Cable physical path target connection method and system based on recursive expansion

By constructing a bidirectional adjacency list and generating the optimal physical path target connection scheme for cables through group traversal, the problem of difficult cable connection in the data center network is solved, improving operation and maintenance efficiency and ease of management.

CN121581349APending Publication Date: 2026-02-27STATE GRID HUNAN ELECTRIC POWER COMPANY LIMITED +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202511758990.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2025-11-27
Publication Date
2026-02-27

AI Technical Summary

Technical Problem

Existing technologies lack effective methods for physical cable path connection in data center networks, resulting in difficulties in manual connection, high time consumption, difficulty in synchronously updating the topology, complex management, and performance bottlenecks of the DFS algorithm.

Method used

The method of cable physical path target connection based on recursion expansion is adopted. By constructing a bidirectional adjacency list, group traversal, path memory and port occupancy weight, the optimal cable physical path target connection scheme is generated, and a graphical selection is provided to simplify manual network planning.

Benefits of technology

It has enabled the digitization and graphical representation of cable connections in the data center network, improving the quality and efficiency of operation and maintenance, and reducing personnel management costs.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121581349A_ABST
    Figure CN121581349A_ABST
Patent Text Reader

Abstract

The invention discloses a cable physical path target connection method and system based on recursive expansion. The method comprises the following steps: initializing data of all equipment and distribution frames and a cable connection relationship between the distribution frames, and constructing a bidirectional adjacency list based on a relationship between specific physical distribution frame ports and ports; performing path search based on the bidirectional adjacency list to obtain a plurality of paths conforming to parameter adjustment, and obtaining a global path group; based on the optimal path length and the distribution frame port occupancy rate weight, selecting an optimal path from the global path group, and generating an optimal cable physical path target connection scheme; and according to the obtained optimal cable physical path target connection scheme, a user selects the optimal cable physical path target connection scheme, and cable physical path target connection is completed. According to the method, bidirectional adjacency list data preprocessing, grouping traversal parallel computing, path dynamic memory, undirected graph loop searching forbidding and distribution frame port occupancy rate weight pre-arranged planning are combined, the performance, usability and practicability of a distribution frame port line searching algorithm are improved, and the problem of line searching and line connecting work efficiency among a large number of distribution frames in a machine room is solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention belongs to the field of data center operation and maintenance management technology, specifically relating to a method and system for connecting cable physical path targets based on recursive expansion. Background Technology

[0002] With the continuous development of new power systems, the demand for information collection, monitoring, control, and intelligent analysis is gradually expanding, leading to the emergence of numerous application systems and platforms. These systems and platforms are increasingly focused on intelligence and digitalization, resulting in significant scale expansion and a surge in cross-system and cross-platform data interaction. This places extremely high demands on the cable maintenance of systems and data centers, currently exhibiting the following main shortcomings: multiple rounds of network changes, varying user habits regarding path labeling (some even lack labels altogether), making subsequent cable tracing extremely difficult; adding or adjusting networks requires multiple jumps, making physical cable path connections challenging and lacking intelligent system support; relying on human subjective experience for cable connection frequently consumes significant time and demands high technical skills from jumper personnel; after network changes, the topology diagram is often difficult to update synchronously, leading to significant discrepancies between the diagram and reality after a period of time; frequent system equipment and network changes, involving multiple people managing simultaneously, make managing new installations and changes very difficult. In addition, current technology mainly uses logical topology connection schemes based on the DFS algorithm, which do not have an effective solution for the physical path connection of patch panel ports, and cannot solve problems such as fixed wire loops between patch panels. The DFS algorithm connection also has problems such as stack overflow, redundant calculation, and performance bottlenecks. Summary of the Invention

[0003] To address the shortcomings of existing technologies, one of the objectives of this invention is to provide a recursive expansion-based method for physical cable path connection. This method digitizes and graphically represents the physical cable connections of complex data center networks and devices, establishes a data resource pool, and analyzes the physical cable path connection algorithm by combining bidirectional adjacency lists, group traversal, path memory, loop rejection, and port occupancy weights. It solves the physical path connection problem between patch panel ports, generating intuitive graphical optimal and suboptimal solutions for users to choose from. This eliminates the tedious work of manual network planning, allowing for patching according to diagrams, saving personnel management costs, and improving operation and maintenance quality and work efficiency.

[0004] The second objective of this invention is to provide a system for implementing the recursive expansion-based cable physical path target connection method.

[0005] This invention provides a method for connecting cable physical paths based on recursive expansion, comprising the following steps:

[0006] S1. Initialize all device and patch panel data and cable connection relationship between patch panels, and construct a bidirectional adjacency list based on specific physical patch panel ports and the relationship between ports;

[0007] S2. Perform path search based on the bidirectional adjacency list to obtain a plurality of paths meeting parameter adjustment, and obtain a global path group;

[0008] S3. Select an optimal path from the global path group based on the optimal path length and the patch panel port occupancy rate weight, and generate an optimal cable physical path target connection scheme;

[0009] S4. According to the obtained optimal cable physical path target connection scheme, the user selects to complete the cable physical path target connection.

[0010] In step S1, after the bidirectional adjacency list is constructed, the unoccupied rate of each physical patch panel port is calculated as a weight for subsequent use.

[0011] In step S2, the path search includes the following steps:

[0012] Obtain the start device number S and the end device number E;

[0013] Obtain the bidirectional adjacency list DL and the weight Q corresponding to each patch panel port;

[0014] According to the patch panel and device list in the cabinet CG where the start device is located, a traversal is performed, and the patch panel EC with the highest current port weight is preferentially selected; grouping is performed according to the port number of the patch panel EC;

[0015] For a certain group, it is judged whether there is a device corresponding to the end device number E in the cabinet where the patch panel EC is located; if there is, the path data is recorded in the path memoization structure HI and the temporary path group, and the cabinet number record currently passed through is also recorded in the cabinet memory group LS; if not, all patch panel lists in the cabinet of the patch panel EC are searched, the patch panel with the lowest current port weight is selected first, and then the cabinet where the opposite patch panel port is found according to the port of the preferred neighbor patch panel; according to the cabinet, the device list and the patch panel list are found, and the cycle is repeated until the device corresponding to the end device parameter number E is found;

[0016] When the device corresponding to the end device parameter number E is found, the temporary path group is added to the global path group, and the current node record recorded in the memoization structure is cleared based on the cabinet memory group LS;

[0017] After traversing all groups, according to the distribution frame and device list in the cabinet CG where the starting device is located, a traversal is performed, a distribution frame ED with the second highest port weight is preferentially selected, the path is generated according to the above steps and is added to the global path group, and the final global path group is obtained.

[0018] In step S3, for the global path group, an optimal cable physical path target connection scheme is generated according to the optimal path length and the distribution frame port occupancy rate weight, and the specific process is as follows:

[0019] For each path in the global path group, the optimal weight QG is calculated, and the following formula is used for calculation: ; wherein L is a path length normalization index of the path; is a normalization index of the average value of the occupancy rate of each distribution frame port in the current path element.

[0020] The second object of the application is to provide a system for implementing the cable physical path target connection method based on recursive expansion, which comprises a device management module, a path analysis module, a scheme generation module and a cable connection module.

[0021] The device management module initializes all device and distribution frame data and cable connection relationship between distribution frames, constructs a bidirectional adjacency list based on specific physical distribution frame ports and the relationship between the ports, and uploads the data to the path analysis module.

[0022] The path analysis module performs path search based on the bidirectional adjacency list according to the received data, obtains a plurality of paths meeting the parameter adjustment, obtains a global path group, and uploads the data to the scheme generation module.

[0023] The scheme generation module selects an optimal path from the global path group based on the optimal path length and the distribution frame port occupancy rate weight according to the received data, generates an optimal cable physical path target connection scheme, and uploads the data to the cable connection module.

[0024] The cable connection module graphically provides the user with a selection according to the optimal cable physical path target connection scheme obtained according to the received data, and completes the cable physical path target connection.

[0025] The application discloses a cable physical path target connection method and system based on recursive expansion, which digitizes and graphically displays the physical connection cable of a complex computer room network and equipment, establishes a data resource pool, solves the physical path connection problem between distribution frame ports through cable physical path target connection algorithm analysis combining a bidirectional adjacency list, grouping traversal, path memory, loop prohibition and port occupancy rate weight, generates intuitive graphical optimal and suboptimal schemes for user selection, saves the complicated work of manual network planning, performs jumper according to the diagram, saves personnel management cost, improves operation and maintenance quality and work efficiency. Attached Figure Description

[0026] Figure 1 This is a schematic flowchart of the method of the present invention;

[0027] Figure 2 This is a schematic diagram of the system of the present invention. Detailed Implementation

[0028] This invention provides a method for connecting cable physical paths based on recursive expansion, the flowchart of which is shown below. Figure 1 As shown, it includes the following steps:

[0029] S1. Initialize all device and patch panel data and the cable connection relationships between patch panels, and build a bidirectional adjacency table based on specific physical patch panel ports and the relationships between ports;

[0030] In step S1, after the bidirectional adjacency table is constructed, the port occupancy rate of each physical patch panel is calculated and used as a weight for subsequent use.

[0031] S2. Perform path search based on the bidirectional adjacency list to obtain several paths that meet the parameter adjustment requirements, thus obtaining a global path group;

[0032] In step S2, the path search includes the following steps:

[0033] Obtain the starting device number S and the ending device number E;

[0034] Obtain the bidirectional adjacency list DL and the weight Q corresponding to each patch panel port;

[0035] Based on the list of patch panels and devices in the cabinet (CG) where the starting device is located, perform a traversal and prioritize selecting the patch panel (EC) with the lowest current port weight; then group the patch panels according to their port numbers.

[0036] For a given group, determine if there is a device corresponding to the endpoint device number E in the cabinet where the patch panel EC is located. If so, record the path data in the path memory structure HI and the temporary path group, and also record the cabinet number currently traversed in the cabinet memory group LS. If not, search the list of all patch panels in the cabinet where the patch panel EC is located, first select the patch panel with the lowest current port weight, then find the cabinet where the port of the opposite patch panel is located based on the port of the preferred neighbor patch panel, find the device list and patch panel list based on the cabinet, and continue to loop until the device corresponding to the endpoint device parameter number E is found.

[0037] Once the device corresponding to the endpoint device parameter number E is found, the temporary path group is added to the global path group, and backtracking is performed based on the cabinet memory group LS to clear the current node record of the memory structure record.

[0038] After traversing all groups, according to the patch panel and device list in the cabinet CG where the starting device is located, a traversal is performed, and a patch panel ED with the second-lowest current port weight is preferentially selected, the path is generated according to the above steps, and is added to the global path group, and the final global path group is obtained.

[0039] S3. Based on the optimal path length and the patch panel port occupancy rate weight, an optimal path is selected from the global path group, and an optimal cable physical path target connection scheme is generated.

[0040] In step S3, for the global path group, the optimal cable physical path target connection scheme is generated based on the optimal path length and the patch panel port occupancy rate weight, and specifically:

[0041] For each path in the global path group, the optimal weight QG is calculated, and the following formula is used for calculation: ; wherein L is the path length normalization index of the path; is the normalization index of the average value of the occupancy rate of each patch panel port in the current path element.

[0042] S4. According to the obtained optimal cable physical path target connection scheme, the user is provided with a selection, and the cable physical path target connection is completed.

[0043] The second object of the present application is to provide a system for realizing the cable physical path target connection method based on recursive expansion, as shown in the structural diagram Figure 2 , comprising a device management module, a path analysis module, a scheme generation module, and a cable connection module.

[0044] The device management module initializes all device and patch panel data and cable connection relationships between patch panels, constructs a bidirectional adjacency list based on specific physical patch panel ports and relationships between ports, and uploads data to the path analysis module.

[0045] The path analysis module performs path search based on the bidirectional adjacency list according to the received data, obtains a plurality of paths that meet the parameter adjustment, obtains a global path group, and uploads data to the scheme generation module.

[0046] The scheme generation module selects an optimal path from the global path group based on the optimal path length and the patch panel port occupancy rate weight according to the received data, generates an optimal cable physical path target connection scheme, and uploads data to the cable connection module.

[0047] The cable connection module provides the user with a graphical selection according to the obtained optimal cable physical path target connection scheme according to the received data, and completes the cable physical path target connection.

[0048] The method of the present application is further described below in connection with one embodiment:

[0049] First, all devices (A01-01U device...D0N-0NU device) and patch panels (A01-01U patch panel...D0N-0NU patch panel) need to be initialized with data, then the cable connection relationship between the patch panels is initialized, and then a bidirectional adjacency list DL based on the specific physical patch panel ports and the relationship between the ports is constructed. After the construction is completed, the unoccupied rate of each physical patch panel port is calculated as the corresponding weight Q.

[0050] Initialize the global path group A, and the path memoization structure HI records each patch panel number searched downward during the execution of the algorithm, and the belonging cabinet memory group LS of each routing of the parameter physical line.

[0051] Get the parameter start device port number A02-34U-1 and the end device network port number C05-34U-1.

[0052] The port under the patch panel A02-02U with a high weight value is preferentially selected, and then the port list of the preferred patch panel A02-02U is traversed to obtain the port numbers A02-02U-1 to A02-02U-24. The connection relationship of the port numbers is retrieved through the bidirectional adjacency list DL, and the end point of the port under A02-02U is found. If the end points of the ports under the patch panel A02-02U are different, the end points are grouped by the different patch panel numbers, and there are two groups, the A02-02U-1~12 port group and the A02-02U-13~24 port group. Then, a thread is allocated for each group using the multi-threading technology. The first port number A02-02U-1 is taken from the first group, and the fixed line pair end patch panel A05-02U-1 port end point is retrieved through the bidirectional adjacency list DL. The path data of the patch panel A02-02U-1 and the patch panel A05-02U-1 is recorded in the path memoization structure HI and the parameter temporary path group A1, and the cabinet numbers A02 and A05 currently passed through are also recorded in the cabinet memory group LS to realize loop forbidden routing. The first port number A02-02U-13 is taken from the second group, and the fixed line pair end patch panel A05-02U-13 port end point is retrieved through the bidirectional adjacency list DL. The path data of the patch panel A02-02U-13 and the patch panel A05-02U-13 is recorded in the path memoization structure HI and the parameter temporary path group A2, and the cabinet numbers A02 and A05 currently passed through are also recorded in the cabinet memory group LS to realize loop forbidden routing.

[0053] Thread 1 judges whether the device in the cabinet A05 where the distribution frame A05-02U is located has the device corresponding to the end device parameter number C05-34U-1, if not found, repeat the operation until the device corresponding to the end device parameter number C05-34U-1 is found, then the temporary path group A1 [A02-34U-1, A02-02U-1, A05-05U-1, C05-05U-1, C05-34U-1] is added to the global path group A; Thread 2 judges whether the device in the cabinet A05 where the distribution frame A05-07U is located has the device corresponding to the end device parameter number C05-34U-1, if not found, repeat the operation until the device corresponding to the end device parameter number C05-34U-1 is found, A2 [A02-34U-1, A02-02U-13, A05-07U-13, C05-07U-13, C05-34U-1] temporary path group is added to the global path group A.

[0054] If the last N node of this search is searched down, because a bidirectional adjacency list is used to construct an undirected graph, a loop problem of the undirected graph will occur, and the cabinet number passed through each time in the downward search is stored in the parameter cabinet memory group [A02, A05, C05], when the neighbor node of the last N distribution frame network port of this grouping search is matched in the cabinet memory group [A02, A05, C05], it represents that this grouping search finds the last backtracking, thereby solving the loop problem of the undirected graph search.

[0055] In the backtracking phase, some parameters with a single search level scope will be emptied or changed, these parameters include temporary path groups, in each backtracking, the last two elements will be deleted, representing the current node and the neighbor node of this search are cleared, for example, temporary path memory, structure [A02-02U-1, A05-05U-1, C05-05U-1, D05-05U-1, D09-05U-1], when backtracking up, D05-05U-1 and D09-05U-1 two elements are cleared.

[0056] The cabinet memory group [A02, A05, C05] of each physical line routing belongs to, in each backtracking, the cabinet number passed through this search is deleted, for example, after backtracking once, the memory group [A02, A05, C05] = [A02, A05].

[0057] Continue to search for the neighbor distribution frame of the sub-priority in the cabinet A02 to generate the path.

[0058] Finally, all the searching is completed, and the global path group A is generated, which specifically includes:

[0059] [[A02-34U-1, A02-02U-1, A05-05U-1, C05-34U-1],

[0060] and [A02-34U-1, A02-02U-13, A05-07U-13, C05-34U-1]].

[0061] Access the distribution frame point table according to the port number to obtain the distribution frame port occupancy rate in the current path group.

[0062] Generate a recursive expansion-based cable physical path target connection scheme according to the shortest path length and the distribution frame port occupancy rate and other conditions to generate an optimal connection scheme for the user to select, and the formula for calculating the weight is QG = current path length * 0.9 + average value of distribution frame port occupancy rate of each in the current path element * 0.1.

[0063] According to the shortest path and the port occupancy rate weighted calculation result, finally output the global path group: A[[A02-34U-1, A02-02U-1, A05-05U-1, C05-34U-1], [A02-34U-1, A02-02U-13, A05-07U-13, C05-34U-1]] is provided for user selection.

Claims

1. A method for cable physical path target connection based on recursive expansion, characterized in that, The method comprises the following steps: S1. Initialize all equipment and patch panel data and cable connection relationship between patch panels, and construct a bidirectional adjacency list based on specific physical patch panel ports and the relationship between the ports; S2. Based on the bidirectional adjacency list, a path search is performed to obtain a plurality of paths that meet the parameter adjustment, and a global path group is obtained; S3. Based on the optimal path length and the patch panel port occupancy rate weight, an optimal path is selected from the global path group, and an optimal cable physical path target connection scheme is generated; S4. According to the optimal cable physical path target connection scheme obtained, the user selects and completes the cable physical path target connection.

2. The recursive expansion based cable physical path target connection method of claim 1, wherein, In step S1, after the bidirectional adjacency list is constructed, the occupancy rate of each physical patch panel port is calculated as a weight for subsequent use.

3. The recursive expansion based cable physical path target connection method of claim 1, wherein, In step S2, the method comprises the following steps: Obtain the start device number S and the end device number E; Obtain the bidirectional adjacency list DL and the weight Q corresponding to each patch panel port; According to the patch panel and device list in the cabinet CG where the start device is located, the patch panel with the highest current port weight is preferentially traversed once; According to the patch panel and device list in the cabinet CG where the start device is located, the patch panel with the second highest current port weight is preferentially traversed once; The paths generated by the two traversals are added to the global path group to obtain the final global path group.

4. The method of claim 3, wherein, Step S2 is specifically: Obtain the start device number S and the end device number E; Obtain the bidirectional adjacency list DL and the weight Q corresponding to each patch panel port; According to the patch panel and device list in the cabinet CG where the start device is located, the patch panel with the lowest current port weight is preferentially selected once; and the patch panel is grouped according to the port number of the patch panel; For a certain group, it is judged whether there is a device corresponding to the end device number E in the cabinet where the patch panel EC is located; if there is, the path data is recorded to the path memorization structure HI and the temporary path group, and the cabinet number currently passed through is also recorded to the cabinet memory group LS; if not, all patch panel lists in the cabinet of the patch panel EC are searched, the patch panel with the lowest current port weight is selected, and then the port of the preferred neighbor patch panel is used to find the cabinet where the opposite patch panel port is located. According to the cabinet, the device list and the patch panel list are found, and the cycle is repeated until the device corresponding to the end device number E is found; After the device corresponding to the end device number E is found, the temporary path group is added to the global path group, and the current node record recorded in the memorization structure is cleared based on the cabinet memory group LS; After traversing all groups, according to the patch panel and device list in the cabinet CG where the start device is located, the patch panel with the second lowest current port weight is preferentially selected once, and the path is generated according to the above steps and added to the global path group to obtain the final global path group.

5. The recursive expansion based cable physical path target connection method of claim 1, wherein, In step S3, the optimal cable physical path target connection scheme is generated based on the optimal path length and the patch panel port occupancy rate weight, and the specific steps are as follows: For each path in the global path set, a most valuable QG is calculated using the following equation: ; where L is a path length normalization factor for the path; is a normalization factor for the average of the occupancy of each patch port in the current path element.

6. A system for implementing the method of claim 1 to 5 for a recursive expansion based cable physical path target connection, characterized by It comprises a device management module, a path analysis module, a scheme generation module, and a cable connection module; The device management module initializes all device and distribution frame data and cable connection relationship between the distribution frames, constructs a bidirectional adjacency table based on specific physical distribution frame ports and relationship between the ports, and uploads the data to the path analysis module; The path analysis module performs path search based on the bidirectional adjacency table according to the received data, obtains a plurality of paths meeting parameter adjustment, obtains a global path group, and uploads the data to the scheme generation module; The scheme generation module selects an optimal path from the global path group based on optimal path length and distribution frame port occupancy rate weight value according to the received data, generates an optimal cable physical path target connection scheme, and uploads the data to the cable connection module; The cable connection module completes cable physical path target connection according to the optimal cable physical path target connection scheme obtained according to the received data and graphical selection by the user.