Data center optical fiber path planning method and system, storage medium and program product

Through the three-dimensional structure evaluation of the data center and the alternative path comparison strategy, the impact of fiber optic wiring planning on the upgrade and transformation of the data center is solved, the optimal path planning and communication quality are achieved, and the difficulty of upgrading and transformation is reduced.

CN119004713AInactive Publication Date: 2024-11-22SHKE COMM TECH
View PDF 0 Cites 1 Cited by

Patent Information

Application Number
CN202411005922.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-25
Publication Date
2024-11-22
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

The existing fiber cabling plan is difficult to meet the needs of data center upgrade and transformation, resulting in difficulty in upgrading and transformation. The initial plan may occupy unused areas, affecting subsequent capacity expansion and adjustments.

Method used

By evaluating the three-dimensional structure of the data center, dividing the device area and non-device area, using alternative path comparison strategy, generating candidate paths based on global information, and dynamically filtering through length and area constraints, ultimately locking the optimal path to ensure communication Quality and minimize cabling costs.

Benefits of technology

It realizes that while reducing the difficulty of upgrading and transformation of data centers, it plans the optimal fiber wiring path, improves computing efficiency and path reliability, avoids repeated calculations, ensures the selection of global optimal solutions, and provides subsequent operation and maintenance convenient.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119004713A_ABST
    Figure CN119004713A_ABST
Patent Text Reader

Abstract

The invention discloses a data center optical fiber path planning method and system, a storage medium and a program product, and the method comprises the steps: determining an equipment placement position and a wiring channel; dividing the data center into a first area and a second area; determining a plurality of alternative wiring paths; determining a first wiring channel and a second wiring channel according to the wiring channel; judging whether the alternative wiring path with the minimum wiring path length and the active state contains a second wiring channel or not; if yes, setting the state of the alternative wiring path with the smallest current wiring path length to be inactive, and executing the step of determining the alternative optimal wiring path with the shortest wiring path according to the equipment placement position and the wiring channel; and if not, determining the alternative wiring path with the minimum current wiring path length as the optimal wiring path. By evaluating the three-dimensional structure of the data center, the optical fiber wiring optimal path of the current data center is planned while the upgrading and reconstruction difficulty of the data center in the future is reduced.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application belongs to the field of path planning, and in particular, relates to a method, system, storage medium and program product for optical fiber path planning in a data center. Background Art

[0002] Data centers are an important part of modern information technology infrastructure, carrying the storage, processing and transmission of massive amounts of data. With the rapid development of technologies such as big data, cloud computing, and artificial intelligence, the scale and complexity of data centers are increasing. As their core transmission medium, optical fiber networks are facing increasing demands and challenges.

[0003] Optical fiber cabling planning is an essential part. In related technologies, high-precision measuring instruments or data import methods are usually used to collect spatial data of data centers or computer rooms to ensure the accuracy of the data. Then, the powerful 3D modeling function of the GIS system is used to build a detailed 3D model based on the collected spatial data. Based on the created 3D model, the optical fiber path planning algorithm is introduced. The optimal optical fiber cabling path is determined through algorithm calculation and displayed with eye-catching lines in the 3D model. Planners can adjust the color, thickness and other attributes of the lines according to actual needs to more clearly view the routing and connection of different optical fibers.

[0004] However, when planning the initial fiber optic cabling, people often only consider the layout of the data center at the current moment. However, with the development of technology and changes in demand, the initial fiber optic cabling plan may be difficult to meet new needs. The initial data center layout may only plan part of it, and the other part is not used. The initial fiber optic cabling plan may occupy unused areas in order to obtain the shortest cabling path. As a result, when upgrading and renovating the data center, the current upgrade and renovation work may be affected by the initial fiber optic cabling plan, making the upgrade and renovation task more difficult. Summary of the invention

[0005] The present application provides a data center optical fiber path planning method, system, storage medium and program product, which are used to evaluate the three-dimensional structure of the data center, reduce the difficulty of future data center upgrades and renovations, and plan the optimal path for optical fiber wiring in the current data center.

[0006] In a first aspect, the present application provides a data center optical fiber path planning method, which determines the equipment placement and wiring channels based on a three-dimensional model of the data center; Divide the data center into a first area and a second area according to the equipment placement location, the first area includes the equipment placement location, and the second area is other areas except the first area; Determine several alternative wiring paths according to the equipment placement and wiring channels, and the effective connection range of the several alternative wiring paths includes the equipment placement; Determine a first routing channel and a second routing channel according to the routing channel, the first routing channel is located in the first area, and the second routing channel is located in the second area; Determine whether the candidate routing path with the shortest routing path length and an active status includes a second routing channel, where the status includes active and inactive; If included, the state of the candidate routing path with the shortest routing path length is set to inactive, and the step of determining the candidate optimal routing path with the shortest routing path according to the device placement position and the routing channel is performed; If not, the alternative routing path with the shortest current routing path length is determined as the optimal routing path.

[0007] By adopting the above technical solutions, path planning based on the three-dimensional model of the data center can fully consider the actual wiring environment, accurately obtain key information such as equipment location and cable channels, and lay a reliable data foundation for subsequent optimization. Secondly, the data center is divided into equipment area and non-equipment area according to functional attributes, and the corresponding cable channels are matched, which can effectively avoid the current wiring method from affecting the non-equipment area. Furthermore, this method adopts the strategy of alternative path selection, first generates multiple candidate paths based on global information, and then dynamically screens them through length and area constraints, and finally locks the optimal path. On the one hand, the active state prevents repeated calculation of the path, and on the other hand, using length and area as the basis for judgment can make the algorithm always converge in the direction of global optimization, accelerating the calculation process. Through regionalization and path optimization, the wiring cost is minimized while ensuring the communication quality. By evaluating the three-dimensional structure of the data center, the optimal path for optical fiber wiring of the current data center is planned while reducing the difficulty of upgrading and renovating the data center in the future.

[0008] In conjunction with some embodiments of the first aspect, in some embodiments, determining the equipment placement and wiring channel according to the three-dimensional model of the data center specifically includes: receiving a three-dimensional model of a data center sent by a three-dimensional scanner; Extract routing channels, boundaries and heat dissipation facilities in 3D models; The equipment placement is determined based on the boundaries and heat dissipation facilities. The equipment placement does not exceed the boundaries and is within the preset range of the heat dissipation facilities.

[0009] By adopting the above technical solution, the data center can be scanned in all directions through a 3D scanner, and an accurate 3D digital model can be automatically generated. The geometric structure, equipment layout, obstacle distribution and other full-view information of the internal space can be quickly obtained. This not only greatly improves the efficiency of data collection and saves a lot of manpower and material resources, but also avoids the subjectivity and limitations of manual surveying and mapping, making the data more real and reliable. On the basis of data collection, the actual constraints and wiring requirements are also fully considered. Through the 3D model, key factors such as cable channels, computer room boundaries, and heat dissipation facilities can be extracted. By using boundary constraints and heat source safety distances, reasonable equipment placement areas can be accurately delineated to ensure that the equipment does not exceed the physical boundaries of the room and maintains an appropriate distance from the heat dissipation facilities, so that the equipment can dissipate heat better, providing an accurate data basis for the planning of optical fiber wiring paths.

[0010] In combination with some embodiments of the first aspect, in some embodiments, a plurality of candidate wiring paths are determined according to the device placement position and the wiring channel, specifically including: Determine the equipment placement information according to the equipment placement location. The equipment placement information includes the placement location coordinates, cabinet number and port information of each device; Determine routing channel information according to the routing channel, the routing channel information includes the starting point, end point, path coordinates, length and capacity of each routing channel; Map the equipment placement information and wiring channel information to the nodes and edges of the network topology graph, where the nodes correspond to the equipment placement information and the edges correspond to the wiring channel information; Add virtual edges between nodes corresponding to preset placement devices that need to be connected to indicate the establishment of optical fiber links; Traverse all optical fiber links in the network topology diagram to obtain several connected device pairs; The shortest path algorithm is used to calculate the wiring paths of all the several connected device pairs, and several candidate wiring paths are obtained.

[0011] By adopting the above technical solution, firstly, the data such as the device location and cable channel are accurately extracted through the three-dimensional model, and the "point-edge" digital representation is quantified, that is, the device location is used as the node and the cable channel is used as the connecting edge to build a network topology with clear logic and regular structure, which provides an intuitive and convenient data model for subsequent path search. On this basis, this method first considers the device interconnection requirements from a macro level, uses the virtual edge mechanism to simulate the optical fiber link, covers all device node pairs that need to be connected, and then enumerates and generates alternative paths in combination with the topological structure. This hierarchical and progressive idea conforms to the general rules of wiring design, has low computational complexity, and high reliability of path results. Especially in the path generation stage, the shortest path algorithm is used for calculation, with the device node as the starting point and the cable channel as the relay edge. The shortest path can be quickly locked in the combination of many node edges, ensuring that the cable length is optimal while taking into account constraints such as cable capacity, which greatly reduces the search range and calculation amount.

[0012] In combination with some embodiments of the first aspect, in some embodiments, after determining the candidate routing path with the shortest current routing path length as the optimal routing path if it is not included, the method further includes: Transfer the current optimal wiring path to the alternative database; executing the step of determining whether the candidate routing path with the shortest routing path length and the active status includes the second routing channel; If not, the candidate routing path with the shortest current routing path length is determined as the optimal routing path, and the step of transferring the current optimal routing path to the candidate database is performed; If included, the state of the alternative routing path with the shortest current routing path length is set to inactive; Determine whether there is still an active candidate routing path among the plurality of candidate routing paths; If so, executing the step of determining whether the candidate routing path with the shortest routing path length and active status includes the second routing channel; If it does not exist, the alternative database is sent to the control terminal.

[0013] By adopting the above technical solution, first of all, the method does not simply stop at obtaining the current optimal path, but adds it to the alternative solution library to form a dynamic accumulation idea, continuously enrich and improve the wiring solution, and reserve space for subsequent selection and comparison. On the one hand, it can enhance the robustness of the wiring solution, and on the other hand, it also provides a buffer for responding to changes in demand and temporary adjustments, with strong fault tolerance and flexibility. Secondly, when selecting solutions, this method does not rely solely on the length of the path, but further considers the actual wiring constraints, takes whether the non-equipment wiring channel is included as an important basis, and conducts multiple rounds of iterative screening to converge to the global optimum in the true sense. This fully reflects the rigor and comprehensiveness of the planning, which can not only avoid construction difficulties, safety hazards and other problems at the source, but also provide convenience for subsequent operation and maintenance management. By dynamically marking the alternative paths, repeated calculations can be avoided and the calculation efficiency can be improved. At the same time, whether there are still active paths as the termination basis can ensure the completeness of the traversal and not miss any possible optimal solution. When all paths are marked as inactive, it means that the search is exhaustive, and the algorithm can be automatically terminated to output the final result. This adaptive calculation mode makes the path planning process more intelligent and efficient.

[0014] In conjunction with some embodiments of the first aspect, in some embodiments, if the candidate database does not exist, sending the candidate database to the control terminal specifically includes: If it does not exist, all optimal routing paths in the candidate database are sorted according to the length of the routing paths to obtain the sorting result; Send the sorting results to the control terminal.

[0015] By adopting the above technical solution, multiple optimal paths from the current to the global are recorded in the alternative database and sorted by path length, which intuitively shows the advantages and disadvantages of the solutions and facilitates implementation personnel to make choices based on the current situation.

[0016] In combination with some embodiments of the first aspect, in some embodiments, after determining the candidate routing path with the shortest current routing path length as the optimal routing path if it is not included, the method further includes: Set the optimal routing path to a preset format in the 3D model; Mark the length and port number of the optimal wiring route in the 3D model; Determine the construction drawings and material lists of the optimal wiring path, and send the 3D model, construction drawings and material lists to the control terminal.

[0017] By adopting the above technical solution, designers and construction personnel can intuitively review the wiring plan, quickly understand the design intent, and reduce communication costs by flexibly configuring the display format of the optimal path in the 3D model and superimposing key information such as length and port number. At the same time, this method also supports the automatic generation of construction drawings and material lists. The automatic statistics and summary of the material list can accurately estimate the project budget and provide decision support for bidding.

[0018] In combination with some embodiments of the first aspect, in some embodiments, after determining the candidate routing path with the shortest current routing path length as the optimal routing path if it is not included, the method further includes: When it is determined that the states of all the candidate routing paths are inactive, a candidate routing path with the smallest routing path length among the candidate routing paths is determined as the optimal routing path.

[0019] By adopting the above technical solution, when it is found after multiple rounds of screening that all candidate paths no longer meet the constraints, the shortest path is selected from these alternatives. This processing method achieves local optimality and can effectively deal with extreme scenarios.

[0020] In a second aspect, an embodiment of the present application provides a data center fiber path planning system, the system comprising: one or more processors and a memory; the memory is coupled to the one or more processors, the memory is used to store computer program code, the computer program code includes computer instructions, and one or more processors call the computer instructions to enable the system to execute the method described in the first aspect and any possible implementation method of the first aspect.

[0021] In a third aspect, an embodiment of the present application provides a computer-readable storage medium, comprising instructions, which, when executed on a system, causes the system to execute the method described in the first aspect and any possible implementation of the first aspect.

[0022] In a fourth aspect, an embodiment of the present application provides a computer program product, characterized in that when the computer program product runs on a system, the system executes the method described in any possible implementation manner in the first aspect.

[0023] One or more technical solutions provided in the embodiments of the present application have at least the following technical effects or advantages: 1. This application provides a data center optical fiber path planning method, which performs path planning based on a three-dimensional model of a data center, can fully consider the actual wiring environment, accurately obtain key information such as equipment location and cable channels, and lay a reliable data foundation for subsequent optimization. Secondly, the data center is divided into equipment areas and non-equipment areas according to functional attributes, and the corresponding cable channels are matched, which can effectively prevent the current wiring method from affecting the non-equipment area. Furthermore, the method adopts a strategy of alternative path selection, first generates multiple candidate paths based on global information, and then dynamically screens them through length and area constraints, and finally locks the optimal path. On the one hand, the active state prevents repeated calculation of the path, and on the other hand, using length and area as the basis for judgment can make the algorithm always converge in the direction of the global optimum, accelerating the calculation process. Through means such as regionalization and path optimization, the wiring cost is minimized while ensuring the communication quality. By evaluating the three-dimensional structure of the data center, while reducing the difficulty of future upgrades and renovations of the data center, the optimal path for optical fiber wiring in the current data center is planned.

[0024] 2. The present application provides a method for planning optical fiber paths in a data center. First, the three-dimensional model accurately extracts data such as equipment location and cable channels, and quantifies them into a "point-edge" digital representation, that is, the equipment location is used as the node and the cable channel is used as the connecting edge to build a network topology diagram with clear logic and regular structure, which provides an intuitive and convenient data model for subsequent path search. On this basis, the method first considers the interconnection needs of devices from a macro level, simulates optical fiber links using a virtual edge mechanism, covers all pairs of device nodes that need to be connected, and then enumerates and generates alternative paths in combination with the topological structure. This hierarchical and progressive approach conforms to the general rules of wiring design, has low computational complexity, and has high reliability of path results. Especially in the path generation stage, the shortest path algorithm is used for calculation, with the equipment node as the starting point and the cable channel as the relay edge. The shortest path can be quickly locked in the combination of many node edges to ensure that the cable length is optimal while taking into account constraints such as cable capacity, which greatly reduces the search range and calculation amount.

[0025] 3. The present application provides a data center fiber path planning method. First, the method does not simply stop at obtaining the current optimal path, but adds it to the alternative solution library to form a dynamic accumulation idea, continuously enrich and improve the wiring solution, and reserve space for subsequent selection and comparison. On the one hand, it can enhance the robustness of the wiring solution, and on the other hand, it also provides a buffer for responding to changes in demand and temporary adjustments, with strong fault tolerance and flexibility. Secondly, when selecting the solution, the method does not rely solely on the path length, but further considers the actual wiring constraints, takes whether the non-equipment wiring channel is included as an important basis, and conducts multiple rounds of iterative screening to converge to the global optimum in the true sense. This fully reflects the rigor and comprehensiveness of the planning, which can not only avoid construction difficulties, safety hazards and other problems at the source, but also provide convenience for subsequent operation and maintenance management. By dynamically marking the alternative path, repeated calculations can be avoided and the operation efficiency can be improved. At the same time, whether there is still an active path as the termination basis can ensure the completeness of the traversal and not miss any possible optimal solution. When all paths are marked as inactive, it means that the search is exhaustive, the algorithm can be automatically terminated, and the final result is output. This adaptive calculation mode makes the path planning process more intelligent and efficient. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] Figure 1 It is a flow chart of a method for planning a fiber optic path in a data center in an embodiment of the present application.

[0027] Figure 2 This is another flow chart of a method for planning a fiber optic path in a data center in an embodiment of the present application.

[0028] Figure 3 It is a schematic diagram of the physical device structure of a data center optical fiber path planning system provided in an embodiment of the present application. DETAILED DESCRIPTION

[0029] The terms used in the following embodiments of the present application are only for the purpose of describing specific embodiments, and are not intended to be used as limitations to the present application. As used in the specification and appended claims of the present application, the singular expressions "one", "a kind of", "said", "above", "the" and "this" are intended to also include plural expressions, unless there is a clear indication to the contrary in the context. It should also be understood that the term "and / or" used in the present application refers to any or all possible combinations comprising one or more listed items.

[0030] In the following, the terms "first" and "second" are used for descriptive purposes only and are not to be understood as suggesting or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features, and in the description of the embodiments of the present application, unless otherwise specified, "plurality" means two or more.

[0031] An application scenario of an embodiment of the present application is described below: In the data center of a large Internet company, with the rapid growth of business volume and the continuous application of new technologies, the original fiber optic cabling can no longer meet the current needs. The data center management team decided to optimize and upgrade the existing cabling to improve network performance and reliability and support the long-term development of the company.

[0032] The first challenge faced by the upgrade and renovation work is that the original fiber optic cabling plan lacks foresight and flexibility. When designing the cabling plan, the main consideration was how to achieve the shortest path and lowest cost under the conditions at the time, but the needs of subsequent expansion and adjustment were not fully considered. For example, only some areas were planned during the early wiring, and a large amount of space was not yet used; in order to pursue the shortest path, some key lines were deployed in remote corners; as the number of equipment increased, the original fiber optic distribution frame could no longer meet the needs, and the cables needed to be sorted and integrated urgently. The combination of various factors has led to many constraints in this upgrade.

[0033] Secondly, the layout of the original data center was not reasonable enough, which further exacerbated the chaos and disorder of the wiring. Due to the lack of unified planning, the equipment placement and cable laying were relatively random, the lines deployed at different times were intertwined, and there was a lack of systematic identification and management, which made daily operation and maintenance face many difficulties. At the same time, the cables were installed above the equipment for a long time, which not only affected the heat dissipation, but also became a safety hazard. All these drawbacks urgently need to be systematically solved through upgrades.

[0034] Finally, the scale of enterprise users continues to grow, access patterns and traffic distribution are constantly changing, and the original network architecture can no longer support it. More new equipment needs to be introduced to improve service capabilities, which requires replanning the layout of the computer room, adjusting the cable deployment, and fully tapping the potential of the computer room to support the rapid growth in the next few years. However, many historical problems left over from the original optical fiber cabling are becoming a major obstacle to the new round of transformation, restricting the improvement of enterprise network performance.

[0035] In order to solve the above technical problems, the present application provides a data center optical fiber path planning method, system, storage medium and program product, which are used to evaluate the three-dimensional structure of the data center, reduce the difficulty of future upgrades and renovations of the data center, and plan the optimal path for optical fiber wiring in the current data center.

[0036] Combine the following Figure 1 , a data center optical fiber path planning method in an embodiment of the present application is described: See also Figure 1 , which is a flow chart of a data center optical fiber path planning method in an embodiment of the present application.

[0037] S101. Determine equipment placement and wiring channels based on the three-dimensional model of the data center; The system first receives the 3D model of the data center sent by the 3D scanner; Extract routing channels, boundaries and heat dissipation facilities in 3D models; The equipment placement is determined based on the boundaries and heat dissipation facilities. The equipment placement does not exceed the boundaries and is within the preset range of the heat dissipation facilities.

[0038] In this step, the system first receives the 3D model data of the data center from the 3D scanner. The model is usually presented in the form of a point cloud or mesh, which contains the fine structure information inside the data center. Then, the system extracts the geometric elements that are critical to fiber optic cabling from the model, including the routing channel, the room boundary, and the location and shape of the cooling facilities. These elements are closely related to equipment layout and cable laying, and are the basis for optimization planning.

[0039] After obtaining the above information, the system begins to determine the specific placement of the equipment. On the one hand, the equipment cannot exceed the boundaries of the computer room to avoid affecting the normal use of other areas; on the other hand, the equipment must be arranged within the effective range of the heat dissipation facilities to ensure long-term reliable operation. The system comprehensively considers the size, power consumption and other attributes of the equipment, as well as the space constraints and heat dissipation conditions of the computer room, and through sophisticated simulation and optimization calculation, it comes up with a set of optimal equipment layout solutions that take into account both cost and benefit.

[0040] For example, suppose there is a rectangular space in the data center with a size of 10m×20m×3m, which contains both conventional cabinets and high-power blade servers. The heat dissipation facilities are located on the east and west walls, with an effective heat dissipation distance of 2m. The system first classifies the equipment and arranges the servers and other equipment with high heat generation in areas close to the heat dissipation facilities, such as within 1.5m from the east wall; and arranges the network equipment with low power consumption in the remote central area. At the same time, in order to facilitate maintenance, a channel of no less than 1m must be reserved between the equipment. Finally, the system outputs a three-dimensional coordinate table, recording the spatial position and orientation of each device, laying the foundation for subsequent optical fiber wiring.

[0041] S102, dividing the data center into a first area and a second area according to equipment placement; The system divides the data center into a first area and a second area according to the equipment placement location. The first area includes the equipment placement location, and the second area is other areas except the first area.

[0042] After determining the equipment layout, the system needs to further divide the room space in order to develop differentiated fiber optic cabling strategies. According to the location and density of equipment distribution, the system divides the entire room into two logical areas: the first area and the second area. The first area refers to the core area where the equipment is placed, with a strong demand for optical fiber and high cabling complexity; while the second area covers the remaining blank areas, which are mainly used for routing and backup, and the cabling is relatively simple.

[0043] The purpose of regional division is to achieve a reasonable allocation of planning resources. By allocating limited fiber ports, wiring time and other resources to the first area first, the connection quality and stability of core equipment can be guaranteed; while a relatively flexible wiring solution can be adopted for the second area, which can meet basic wiring requirements while reserving sufficient adjustment space for subsequent capacity expansion. This zoning planning enables the system to find a balance between local optimization and global consideration, and maximize the performance of the overall wiring solution at a limited cost.

[0044] For example, for a machine room with densely distributed equipment, the system identifies the eight cabinets in the center as the first area, and the four cabinets around and the remaining space as the second area. In the first area, the system plans 2-3 redundant optical fiber connections for each device, and prefers the line with the shortest travel distance; in the second area, the system reduces redundancy, retains only 1-2 spare optical fiber connections, and appropriately sacrifices the line length, uniformly laying the wiring troughs along the wall and top to simplify the construction difficulty. Through this zoning planning, the limited 48-core fiber ports can cover all 20 cabinets, and reserve access conditions for the 8 new cabinets, giving full play to the capacity and flexibility of the system.

[0045] S103, determining a number of alternative wiring paths according to the equipment placement and wiring channels; The system determines several candidate wiring paths according to the equipment placement and the wiring channel, and the effective connection range of the several candidate wiring paths includes the equipment placement.

[0046] The system needs to first design several alternative fiber optic wiring paths based on the initial equipment layout and channel planning as the basis for subsequent evaluation and optimization.

[0047] On the one hand, each alternative path must be able to effectively connect the starting device and the target device, that is, the endpoint of the path must fall within the range of the device placement. The system automatically generates a series of connection combinations by analyzing the device coordinates and port locations, and characterizes the fiber path in the form of vectors or topology. On the other hand, the alternative path should also make use of existing routing channels as much as possible to reduce unnecessary detours and intersections. The system refers to the channel layout diagram of the computer room and gives priority to the path plan laid along a straight line. Turns and high and low crossings are considered only when necessary to control the length and complexity of the path.

[0048] Finally, the system will output several alternative routes that take into account connectivity and economy, annotate the key attributes of each route, such as the starting point, end point, length, turning point, etc., and attach a 3D visualization preview to facilitate intuitive evaluation by planners. These preliminary plans cover various possible laying ideas, which not only meet basic functional requirements, but also reflect the aesthetics of wiring, providing rich materials for subsequent plan optimization.

[0049] For example, for an optical fiber that needs to connect two cabinets A and B, the system designs three alternative paths by analyzing its placement and the layout of the equipment room: L1 is laid in a straight line along the aisle between the two cabinets, with a minimum length of 10m; L2 is laid along the main trunk duct on the side of the cabinet, requiring a detour of 15m; L3 is led out from the top of the cabinet, runs through the ceiling duct and is led down from the opposite side, with a total length of 20m. The system records the three-dimensional model and key parameters of each path into the database and calculates their respective unit costs, such as 100 yuan for L1, 120 yuan for L2, and 150 yuan for L3. This information provides data support for the system's subsequent cost-benefit analysis and solution optimization.

[0050] S104, determining a first routing channel and a second routing channel according to the routing channel; The system determines a first routing channel and a second routing channel according to the routing channel, the first routing channel is located in the first area, and the second routing channel is located in the second area.

[0051] In order to further refine the wiring plan, the system needs to determine the routing channels of different priorities based on the area division of the computer room on the basis of the previous step. Since the first area carries the core equipment connection, the focus of the wiring work will also be concentrated here. Therefore, the system gives priority to the channels located in the first area as the first routing channels. These channels are usually well designed, with convenient paths, and can effectively connect key equipment, which is the top priority of wiring work. In contrast, the channels located in the second area have fewer interactive requirements and relatively less wiring pressure, so the system determines it as the second routing channel. Compared with the first routing channel, the second routing channel has a larger capacity margin and wiring flexibility.

[0052] By clearly defining the first and second routing channels, the system can more finely control the cost and quality of fiber cabling. For the first routing channel, the system will invest more resources, such as using better-performing optical fibers, configuring a higher number of ports, and conducting more detailed laying and construction, to fully guarantee the network quality in the core area; while for the second routing channel, the system can moderately lower the standards and use more economical materials and laying solutions to maximize cabling cost savings while ensuring basic connectivity. This differentiated resource allocation strategy can achieve balanced development of key and non-key areas with a limited overall budget.

[0053] For example, in a financial enterprise's data center, the core trading area uses 10G multimode optical fiber, equipped with QSFP28 optical modules, and uses ribbon optical fiber for wiring. The process is hot-melt, and the redundancy backup can reach 4 times; while in the office auxiliary area, it uses 1G single-mode optical fiber, equipped with SFP optical modules, and uses traditional optical fiber for wiring. The process is cold connection, and the backup is controlled within 2 times. By giving differentiated technical standards to the channels in the two areas, the system not only meets the needs of 7×24-hour high-speed operation of the trading system, but also effectively controls the investment in office system wiring.

[0054] S105, determining whether the candidate wiring path with the shortest wiring path length and an active status includes the second wiring channel; The system determines whether the candidate wiring path with the shortest routing path length and active status contains the second routing channel. The status includes active and inactive. After generating several candidate paths, the system needs to select the best one from them to form the final wiring plan. One of the important evaluation criteria is the length of the path. The longer the wiring path, the higher the material cost and the greater the construction difficulty, and it may also lead to increased signal attenuation and reduced network quality.

[0055] Specifically, the system first sorts all candidate paths by length and finds the path with the shortest length. At the same time, the system also checks whether the status of the path is active, which means that the candidate path has not been traversed yet.

[0056] S106, setting the state of the candidate routing path with the shortest current routing path length to inactive; If it is included, the system sets the status of the alternative routing path with the shortest routing path length to inactive. And execute step S103 again to determine the alternative optimal routing path with the shortest routing path according to the device placement and routing channel. That is, if it is included, continue to execute steps S103-S106 until the judgment result is not included. Based on the previous step, if the system determines that the shortest path contains too many second routing channels, it is necessary to temporarily abandon the path and adjust its status from active to inactive.

[0057] The status adjustment is achieved by modifying the path attribute table. The system changes the "active / inactive" field of the shortest path from 1 to 0, making it temporarily unqualified for selection. However, this does not mean that the path is deleted from now on. The system will also retain its length, routing and other attributes to provide a basis for subsequent possible selection.

[0058] After the status is adjusted, the system will re-execute the shortest path evaluation process, that is, return to step S103, and regenerate and review a new batch of candidate paths. In the new round of evaluation, since the previous shortest path has been excluded, the system will select the second shortest active path from the remaining paths and continue to check its channel composition until the optimal solution that meets the requirements is found.

[0059] S107, determining the candidate wiring path with the shortest current wiring path length as the optimal wiring path; If not, the system will determine the alternative routing path with the shortest current routing path length as the optimal routing path. After multiple rounds of iterative evaluation and state adjustment, the system finally locked in a routing path that met multiple requirements and determined it as the optimal routing path. Different from the previous preliminary plan, this path is more complete in terms of length, channel composition, physical characteristics, etc., and can provide high-quality and highly reliable fiber optic connections for data centers.

[0060] Determining the optimal path means that the system has successfully balanced multiple key factors such as cost, performance, and operation and maintenance, and found a wiring solution that can maximize the long-term development needs of the data center. This solution can not only give full play to the utilization efficiency of existing resources and control the overall construction cost, but also ensure good communication quality and long-term expansion capabilities, laying the foundation for the sustainable development of the data center.

[0061] S108. When it is determined that the states of all the candidate routing paths are inactive, determine the candidate routing path with the shortest routing path length among the candidate routing paths as the optimal routing path.

[0062] In some extreme cases, the system may encounter a situation where all candidate paths are not ideal, that is, all paths are either too long or contain too many low-quality second routing channels, which cannot meet the various needs of the data center. In this case, the system will determine the candidate routing path with the smallest routing path length among several candidate routing paths as the optimal routing path.

[0063] The above embodiments have the following beneficial effects: Path planning based on the three-dimensional model of the data center can fully consider the actual wiring environment, accurately obtain key information such as equipment location and cable channels, and lay a reliable data foundation for subsequent optimization. Secondly, the data center is divided into equipment area and non-equipment area according to functional attributes, and the corresponding cable channels are matched, which can effectively avoid the current wiring method from affecting the non-equipment area. Furthermore, this method adopts the strategy of alternative path selection, first generates multiple candidate paths based on global information, and then dynamically screens them through length and area constraints, and finally locks the optimal path. On the one hand, the active state prevents repeated calculation of the path, and on the other hand, using length and area as the basis for judgment can make the algorithm always converge in the direction of global optimization, accelerating the calculation process. Through regionalization and path optimization, the wiring cost is minimized while ensuring the communication quality. By evaluating the three-dimensional structure of the data center, the optimal path for optical fiber wiring of the current data center is planned while reducing the difficulty of upgrading and renovating the data center in the future.

[0064] Through the 3D scanner, the data center is scanned in all directions, and an accurate 3D digital model is automatically generated. The geometric structure, equipment layout, obstacle distribution and other full-view information of the internal space can be quickly obtained. This not only greatly improves the efficiency of data collection and saves a lot of manpower and material resources, but also avoids the subjectivity and limitations of manual surveying and mapping, making the data more real and reliable. On the basis of data collection, the actual constraints and wiring requirements are also fully considered. Through the 3D model, key factors such as cable channels, computer room boundaries, and heat dissipation facilities are extracted. By using boundary constraints and heat source safety distances, reasonable equipment placement areas can be accurately delineated to ensure that the equipment does not exceed the physical boundaries of the room and maintains an appropriate distance from the heat dissipation facilities, so that the equipment can dissipate heat better, providing an accurate data basis for the planning of optical fiber wiring paths.

[0065] First, the three-dimensional model accurately extracts data such as device location and cable channel, and quantifies them into a "point-edge" digital representation, that is, with the device location as the node and the cable channel as the connecting edge, a network topology with clear logic and regular structure is constructed, which provides an intuitive and convenient data model for subsequent path search. On this basis, this method first considers the device interconnection needs from a macro level, uses the virtual edge mechanism to simulate the optical fiber link, covers all device node pairs that need to be connected, and then enumerates and generates alternative paths in combination with the topological structure. This hierarchical and progressive idea conforms to the general rules of wiring design, has low computational complexity, and high reliability of path results. Especially in the path generation stage, the shortest path algorithm is used for calculation, with the device node as the starting point and the cable channel as the relay edge. The shortest path can be quickly locked in the combination of many node edges, ensuring that the cable length is optimal while taking into account constraints such as cable capacity, which greatly reduces the search range and calculation amount.

[0066] When all candidate paths no longer meet the constraints after multiple rounds of screening, the shortest path is selected from the candidates. This processing method achieves local optimality and can effectively deal with extreme scenarios.

[0067] Further, after determining the candidate routing path with the shortest current routing path length as the optimal routing path, the system sets the optimal routing path in a preset format in the three-dimensional model; Mark the length and port number of the optimal wiring route in the 3D model; Determine the construction drawings and material lists of the optimal wiring path, and send the 3D model, construction drawings and material lists to the control terminal.

[0068] In the above embodiment, by flexibly configuring the display format of the optimal path in the three-dimensional model and superimposing key information such as length and port number, designers and construction personnel can intuitively review the wiring plan, quickly understand the design intent, and reduce communication costs. At the same time, the method also supports the automatic generation of construction drawings and material lists. The automatic statistics and summary of the material list can accurately estimate the project budget and provide decision support for bidding.

[0069] In the above embodiment, the system finally obtains only one optimal wiring path, which is only one case. In actual application, there may be multiple optimal wiring paths, which differ in the length of the wiring paths. In this case, the present application can classify these optimal wiring paths that meet the requirements into a database and send it to the user for selection. Figure 2 , another data center optical fiber path planning method in an embodiment of the present application is described: See also Figure 2 , is another flow chart of a data center optical fiber path planning method in an embodiment of the present application.

[0070] S201, transferring the current optimal wiring path to the candidate database; The system first transfers the current optimal routing path to the alternative database. In the previous steps, the system has obtained an optimal routing path that meets multiple requirements through comprehensive evaluation. However, in actual applications, only one optimal path may not be enough, and users need to be given more options. Therefore, the system will temporarily transfer the currently found optimal path from the main database to an alternative database. The alternative database is used to temporarily store those path solutions that are already relatively ideal but need further comparison and screening.

[0071] The process of transferring a path is actually copying and deleting related data records between the two databases. Specifically, the system will first create a new record in the alternative database with the same attributes as the optimal path, including path length, channel composition, start and end nodes, etc. At the same time, the system will also add a timestamp to this record to indicate the time it entered the alternative database. After successfully copying to the alternative database, the system will delete the original record in the main database to free up storage space. Through this transfer operation, the system realizes seamless migration of paths between different databases.

[0072] For example, for the fiber connection between cabinets A and B, the system has found a 90-meter optimal path P1. Now, the system transfers the complete record of P1 from the primary database to the alternative database, and marks the timestamp as "20230530-101030", indicating that it was transferred to the database at 10:10:30 on May 30, 2023. All entries related to P1 in the primary database are cleared to make room for the next path evaluation. At this point, P1 becomes the first candidate path in the alternative database, waiting to be compared with other optimal paths found later.

[0073] S202, determining whether the candidate wiring path with the shortest wiring path length and an active status includes a second wiring channel; After transferring the existing optimal path to the candidate database, the system needs to continue to evaluate the remaining paths and look for other possible optimal solutions. The core of this step is to find the second shortest active path and determine whether it contains the second routing channel.

[0074] Specifically, the system will first find the path with the shortest current length and active status in the main database. Since the shortest path has been transferred in the previous step, the path found here is suboptimal. Then, the system will analyze the channel composition of the path and calculate the proportion of the cable length located in the second routing channel to the total length. If the proportion exceeds a certain threshold (such as 50%), it means that this path contains more low-quality cable segments, which may have a negative impact on network performance.

[0075] The judgment result will directly affect the next operation. If the path does not contain the second routing channel, or the proportion of the second routing channel is low, the system will regard it as a new optimal path and retain it; on the contrary, if the proportion of the second routing channel is too high, the system will temporarily freeze the path and adjust its status to inactive to prevent it from affecting subsequent path evaluation.

[0076] For example, after transferring the optimal path P1 with a length of 90 meters, the system found a suboptimal path P2 with a length of 95 meters in the remaining paths. After analysis, 40 meters of the total length of P2 is located in the second routing channel, accounting for about 42%, which is below the warning line of 50%. Therefore, the system believes that the channel composition of P2 is acceptable and decides to retain it as a new optimal path. On the contrary, if 60 meters of P2 are located in the second routing channel, accounting for as high as 63%, the system will temporarily freeze P2, set its status to inactive, and no longer consider it as a candidate for the optimal path. By judging the proportion of the second routing channel, the system can quickly screen out suboptimal solutions with poor line quality and focus on evaluating more promising paths.

[0077] S203, determining the candidate wiring path with the shortest current wiring path length as the optimal wiring path; If not, the candidate routing path with the shortest current routing path length is determined as the optimal routing path, and the step of transferring the current optimal routing path to the candidate database is performed.

[0078] S204, setting the state of the candidate routing path with the shortest current routing path length to inactive; If included, the system sets the status of the alternative routing path with the shortest current routing path length to inactive.

[0079] S205, determining whether there are still active candidate routing paths among the plurality of candidate routing paths; The system determines whether there is an active candidate routing path among the plurality of candidate routing paths. If so, step S202 is repeatedly executed to determine whether the candidate routing path with the shortest routing path length and the active status includes the second routing channel.

[0080] S206 , sorting all the optimal wiring paths in the candidate database according to the length of the wiring paths, obtaining the sorting result and sending the sorting result to the control terminal.

[0081] If it does not exist, the system will sort all the optimal wiring paths in the candidate database according to the length of the wiring path, obtain the sorting result and send the sorting result to the control terminal.

[0082] The above embodiments have the following beneficial effects: First, this method does not simply stop at obtaining the current optimal path, but adds it to the alternative solution library to form a dynamic accumulation idea, continuously enrich and improve the wiring solution, and reserve space for subsequent selection and comparison. On the one hand, it can enhance the robustness of the wiring solution, and on the other hand, it also provides a buffer for responding to changes in demand and temporary adjustments, with strong fault tolerance and flexibility. Secondly, when selecting solutions, this method does not rely solely on the length of the path, but further considers the actual wiring constraints, takes whether the non-equipment wiring channel is included as an important basis, and conducts multiple rounds of iterative screening to converge to the global optimum in the true sense. This fully reflects the rigor and comprehensiveness of the planning, which can not only avoid construction difficulties, safety hazards and other problems at the source, but also provide convenience for subsequent operation and maintenance management. By dynamically marking the alternative paths, repeated calculations can be avoided and the calculation efficiency can be improved. At the same time, whether there are still active paths as the termination basis can ensure the completeness of the traversal and not miss any possible optimal solutions. When all paths are marked as inactive, it means that the search is exhaustive, and the algorithm can be automatically terminated to output the final result. This adaptive calculation mode makes the path planning process more intelligent and efficient.

[0083] The alternative database records multiple optimal paths from the current to the global level, sorted by path length, intuitively showing the pros and cons of the solutions, making it easier for implementers to make choices based on the current situation.

[0084] The following describes the system in the embodiment of the present invention from the perspective of hardware processing. Figure 3 , which is a schematic diagram of the physical device structure of a data center optical fiber path planning system provided in an embodiment of the present application.

[0085] It should be noted that Figure 3 The structure of the system shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present invention.

[0086] like Figure 3 As shown, the system includes a central processing unit (CPU) 301, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 302 or the program loaded from the storage part 308 to the random access memory (RAM) 303, such as executing the method in the above embodiment. In RAM 303, various programs and data required for system operation are also stored. CPU 301, ROM 302 and RAM 303 are connected to each other through a bus 304. Input / output (I / O) interface 305 is also connected to bus 304.

[0087] The following components are connected to the I / O interface 305: an input section 306 including a camera, an infrared sensor, etc.; an output section 307 including a liquid crystal display (LCD) and a speaker, etc.; a storage section 308 including a hard disk, etc.; and a communication section 309 including a network interface card such as a LAN (Local Area Network) card, a modem, etc. The communication section 309 performs communication processing via a network such as the Internet. A drive 310 is also connected to the I / O interface 305 as needed. A removable medium 311, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 310 as needed so that a computer program read therefrom is installed into the storage section 308 as needed.

[0088] In particular, according to an embodiment of the present invention, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present invention includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a computer program for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication part 309, and / or installed from a removable medium 311. When the computer program is executed by the central processing unit (CPU) 301, various functions defined in the present invention are performed.

[0089] It should be noted that the computer-readable medium shown in the embodiment of the present invention may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present invention, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by or in combination with an instruction execution system, device or device. In the present invention, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable computer program. Such a propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing.

[0090] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present invention. Among them, each box in the flowchart or block diagram can represent a module, a program segment, or a part of the code, and the above-mentioned module, program segment, or a part of the code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flowchart, and the combination of boxes in the block diagram or flowchart, can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0091] As another aspect, the present invention further provides a computer-readable storage medium, which may be included in the system described in the above embodiment; or may exist independently without being assembled into the system. The above storage medium carries one or more computer programs, and when the above one or more computer programs are executed by a processor of a system, the system implements the method provided in the above embodiment.

[0092] As described above, the above embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present application.

[0093] As used in the above embodiments, the term "when..." may be interpreted to mean "if..." or "after..." or "in response to determining..." or "in response to detecting...", depending on the context. Similarly, the phrases "upon determining..." or "if (the stated condition or event) is detected" may be interpreted to mean "if determining..." or "in response to determining..." or "upon detecting (the stated condition or event)" or "in response to detecting (the stated condition or event)", depending on the context.

[0094] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions may be transmitted from a website site, computer, server or data center to another website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated. The available medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state hard disk), etc.

[0095] Those skilled in the art can understand that to implement all or part of the processes in the above-mentioned embodiments, the processes can be completed by computer programs to instruct related hardware, and the programs can be stored in computer-readable storage media. When the programs are executed, they can include the processes of the above-mentioned method embodiments. The aforementioned storage media include: ROM or random access memory RAM, magnetic disk or optical disk and other media that can store program codes.

Claims

1. A data center optical fiber path planning method, characterized in that: include: Determine equipment placement and wiring channels based on the 3D model of the data center; Dividing the data center into a first area and a second area according to the equipment placement location, the first area includes the equipment placement location, and the second area is other areas except the first area; Determine a plurality of candidate wiring paths according to the device placement position and the wiring channel, wherein the effective connection range of the plurality of candidate wiring paths includes the device placement position; Determine a first routing channel and a second routing channel according to the routing channel, the first routing channel is located in the first area, and the second routing channel is located in the second area; Determine whether the candidate routing path with the shortest routing path length and an active status includes the second routing channel, where the status includes active and inactive; If included, the state of the candidate wiring path with the shortest current wiring path length is set to inactive, and the step of determining the candidate optimal wiring path with the shortest wiring path according to the device placement position and the wiring channel is performed; If not, the alternative routing path with the shortest current routing path length is determined as the optimal routing path.

2. The method according to claim 1, characterized in that Determining the equipment placement and wiring channels based on the three-dimensional model of the data center specifically includes: receiving a three-dimensional model of the data center sent by a three-dimensional scanner; Extracting the wiring channels, boundaries and heat dissipation facilities in the three-dimensional model; The device placement position is determined according to the boundary and the heat dissipation facility, and the device placement position does not exceed the boundary and is located within a preset range of the heat dissipation facility.

3. The method according to claim 1, characterized in that Determining a plurality of alternative wiring paths according to the device placement position and the wiring channel specifically includes: Determine device placement information according to the device placement position, where the device placement information includes the placement position coordinates, cabinet number and port information of each device; Determining routing channel information according to the routing channel, the routing channel information including a starting point, an end point, a path coordinate, a length and a capacity of each routing channel; Mapping the device placement information and the wiring channel information to nodes and edges of a network topology graph, wherein the nodes correspond to the device placement information and the edges correspond to the wiring channel information; Add virtual edges between nodes corresponding to preset placement devices that need to be connected to indicate the establishment of optical fiber links; Traversing all optical fiber links in the network topology diagram to obtain a number of connection device pairs; The wiring paths of all the plurality of connection device pairs are calculated using a shortest path algorithm to obtain the plurality of candidate wiring paths.

4. The method according to claim 1, characterized in that: If not, after determining the candidate routing path with the shortest current routing path length as the optimal routing path, the method further includes: Transferring the currently described optimal wiring path to an alternative database; Execute the step of determining whether the candidate wiring path with the shortest routing path length and an active status includes the second routing channel; If not, the candidate routing path with the shortest current routing path length is determined as the optimal routing path, and the step of transferring the current optimal routing path to the candidate database is performed; If included, the state of the alternative routing path with the shortest current routing path length is set to inactive; Determining whether there is still an active candidate routing path among the plurality of candidate routing paths; If so, executing the step of determining whether the candidate wiring path with the shortest routing path length and active status includes the second routing channel; If it does not exist, the candidate database is sent to the control terminal.

5. The method according to claim 4, characterized in that If the candidate database does not exist, sending the candidate database to the control terminal specifically includes: If not, all optimal wiring paths in the candidate database are sorted according to the length of the wiring paths to obtain a sorting result; The sorting result is sent to the control terminal.

6. The method according to claim 1, characterized in that After determining the candidate routing path with the shortest current routing path length as the optimal routing path if it is not included, the method further includes: Setting the optimal wiring path in the three-dimensional model into a preset format; Marking the length and port number of the optimal wiring route in the three-dimensional model; A construction drawing and a material list of the optimal wiring path are determined, and the three-dimensional model, the construction drawing and the material list are sent to the control terminal.

7. The method according to claim 1, characterized in that After determining the candidate routing path with the shortest current routing path length as the optimal routing path if it is not included, the method further includes: When it is determined that the states of all the candidate routing paths are inactive, the candidate routing path with the shortest routing path length among the candidate routing paths is determined as the optimal routing path.

8. A data center optical fiber path planning system, characterized in that: The system comprises: One or more processors and a memory; the memory is coupled to the one or more processors, the memory is used to store computer program code, the computer program code includes computer instructions, and the one or more processors call the computer instructions to cause the system to execute the method as described in any one of claims 1-7.

9. A computer-readable storage medium comprising instructions, characterized in that: When the instructions are executed on a system, the system is caused to execute the method according to any one of claims 1 to 7.

10. A computer program product, characterized in that When the computer program product is run on a system, the system is caused to execute the method according to any one of claims 1 to 7.

Citation Information

Cited By

  • Method and system for realizing efficient optical fiber wiring planning based on intelligent path planning algorithm

    CN119728445A