CN116522552A - Machine room wiring method and system - Google Patents
Machine room wiring method and system Download PDFInfo
- Publication number
- CN116522552A CN116522552A CN202310391129.9A CN202310391129A CN116522552A CN 116522552 A CN116522552 A CN 116522552A CN 202310391129 A CN202310391129 A CN 202310391129A CN 116522552 A CN116522552 A CN 116522552A
- Authority
- CN
- China
- Prior art keywords
- cable connection
- connection nodes
- wiring
- machine room
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 53
- 239000011159 matrix material Substances 0.000 claims abstract description 47
- 238000010586 diagram Methods 0.000 claims abstract description 42
- 238000003860 storage Methods 0.000 claims description 22
- 238000004422 calculation algorithm Methods 0.000 claims description 15
- 238000004891 communication Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 10
- 230000000694 effects Effects 0.000 claims description 7
- 238000013439 planning Methods 0.000 abstract description 9
- 238000012384 transportation and delivery Methods 0.000 abstract description 9
- 238000009826 distribution Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 5
- 238000010276 construction Methods 0.000 description 4
- 239000000463 material Substances 0.000 description 4
- 238000012790 confirmation Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000013473 artificial intelligence Methods 0.000 description 2
- 238000012550 audit Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000005259 measurement Methods 0.000 description 2
- 238000010295 mobile communication Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 230000008094 contradictory effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
- 238000012800 visualization Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/20—Design optimisation, verification or simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2113/00—Details relating to the application field
- G06F2113/16—Cables, cable trees or wire harnesses
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Geometry (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Mathematical Optimization (AREA)
- Entrepreneurship & Innovation (AREA)
- Computational Mathematics (AREA)
- Development Economics (AREA)
- Pure & Applied Mathematics (AREA)
- Game Theory and Decision Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mathematical Analysis (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Design And Manufacture Of Integrated Circuits (AREA)
Abstract
The embodiment of the application provides a machine room wiring method and system, wherein the method comprises the following steps: obtaining a layout diagram corresponding to a region to be wired; the area to be wired comprises a plurality of cable connection nodes; determining geometrical relationships among the plurality of cable connection nodes according to the layout diagram; the only minimum bridge unit exists between adjacent cable connection nodes; generating an adjacent matrix according to the geometric relation among the plurality of cable connection nodes and the preset length corresponding to the minimum bridge unit; and determining an optimal wiring path between any two cable connection nodes according to the adjacency matrix. Therefore, the optimal wiring path between any cable connection nodes can be automatically calculated according to the constructed adjacent matrix, the planning efficiency of the wiring path of the machine room is improved, the overall delivery schedule of the wiring of the machine room is accelerated, and the overall delivery cost of the wiring of the machine room is reduced.
Description
Technical Field
The embodiment of the application relates to the technical field of computer application, in particular to a machine room wiring method, a system, computer equipment and a computer readable storage medium.
Background
When the existing information machine room is wired, the construction unit mainly performs route planning on the bridge layout by hand according to engineering experience, and then performs cable length estimation in a mode of combining drawing ranging and field actual measurement. However, the traditional information machine room wiring method can basically meet the demands for wiring route planning and cable quantity estimation of a small-scale machine room, but for the wiring of a medium-large-scale data center, the problems of low efficiency, long path, large multi-party audit opinion disputes and the like exist in the wiring path planning and engineering quantity confirmation due to large wiring engineering quantity and non-unique wiring path, so that the overall delivery progress and cost of the information machine room are affected.
Disclosure of Invention
An object of the embodiments of the present application is to provide a machine room wiring method, system, computer device, and computer readable storage medium, for solving the following problems: the traditional information machine room wiring method has the problems of low wiring path planning efficiency, long path, large disputes of multi-party auditing opinions and the like.
One aspect of the embodiments of the present application provides a machine room wiring method, including:
obtaining a layout diagram corresponding to a region to be wired; the area to be wired comprises a plurality of cable connection nodes;
determining geometrical relationships among the plurality of cable connection nodes according to the layout diagram; the only minimum bridge unit exists between adjacent cable connection nodes;
generating an adjacent matrix according to the geometric relation among the plurality of cable connection nodes and the preset length corresponding to the minimum bridge unit;
and determining an optimal wiring path between any two cable connection nodes according to the adjacency matrix.
Optionally, the geometric relationship includes an adjacent relationship, and the determining the geometric relationship between the plurality of cable connection nodes according to the layout diagram includes:
and orderly numbering the plurality of cable connection nodes according to the layout diagram, and determining the adjacent relation among the plurality of cable connection nodes.
Optionally, the method further comprises:
adjusting the geometric relationship among the plurality of cable connecting nodes according to the layout diagram;
and re-determining the optimal wiring path between any two cable connection nodes according to the adjusted geometric relationship.
Optionally, the adjusting the geometric relationship between the plurality of cable connection nodes according to the layout diagram includes:
and setting adjacent cable connection nodes in the geometric relationship to be non-adjacent or setting non-adjacent cable connection nodes to be adjacent according to the layout.
Optionally, the generating an adjacency matrix according to the geometric relation among the plurality of cable connection nodes and the preset length corresponding to the minimum bridge unit includes:
constructing a communication undirected graph according to the geometric relationship among the plurality of cable connection nodes;
and determining a length weight value corresponding to each side in the communication undirected graph according to the preset length corresponding to the minimum bridge unit, and generating an adjacent matrix.
Optionally, the method further comprises:
determining the total cable quantity of each cable connection node according to the optimal wiring path among all the cable connection nodes in the area to be wired;
and displaying the optimal wiring path and the total amount of the cables of each cable connection node.
Optionally, the method further comprises:
and adjusting the optimal wiring path according to the optimal wiring path and the total amount of the cables of each cable connection node.
Optionally, the determining, according to the adjacency matrix, an optimal routing path of routing between any two cable connection nodes includes:
and determining an optimal wiring path of wiring between any two cable connection nodes according to the adjacency matrix based on a preset optimal path algorithm.
Optionally, the method further comprises:
acquiring the actual wiring length;
determining the length of the optimal wiring path according to the preset length corresponding to the minimum bridge unit;
and adjusting the preset length corresponding to the minimum bridge unit according to the actual wiring length and the length of the optimal wiring path so as to optimize the estimated effect of wiring on the area to be wired.
Optionally, the cable connection node includes an equipment node and a bridge branch node.
An aspect of the embodiments of the present application further provides a machine room wiring system, including:
the layout diagram acquisition module is used for acquiring a layout diagram corresponding to the area to be wired; the area to be wired comprises a plurality of cable connection nodes;
the geometric relation determining module is used for determining geometric relations among the plurality of cable connection nodes according to the layout diagram; the only minimum bridge unit exists between adjacent cable connection nodes;
the adjacent matrix generation module is used for generating an adjacent matrix according to the geometric relation among the plurality of cable connection nodes and the preset length corresponding to the minimum bridge unit;
and the optimal wiring path determining module is used for determining an optimal wiring path between any two cable connection nodes according to the adjacency matrix and the length of the optimal wiring path.
An aspect of the embodiments of the present application further provides a computer device, where the computer device includes a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the steps of the machine room routing method as described above when the computer program is executed.
An aspect of the embodiments of the present application further provides a computer readable storage medium, where a computer program is stored, where the computer program is executable by at least one processor, so that the at least one processor implements the steps of the machine room routing method as described above when the computer program is executed.
According to the machine room wiring method, system, equipment and computer readable storage medium, the geometric relationship between the cable connection nodes is determined according to the layout diagram by acquiring the layout diagram corresponding to the area to be wired, and the adjacency matrix is generated, so that the optimal wiring path between any two cable connection nodes can be automatically calculated according to the adjacency matrix, the efficiency of planning the machine room wiring path is improved, the overall delivery schedule of machine room wiring is accelerated, and the overall delivery cost of machine room wiring is reduced.
Drawings
Fig. 1 schematically shows an application environment diagram of a machine room wiring method according to an embodiment of the present application;
fig. 2 schematically shows a flow chart of a machine room wiring method according to an embodiment of the present application;
fig. 3 schematically illustrates a plan layout of a bridge branch node in an information room according to a first embodiment of the present application;
fig. 4 schematically illustrates a plan layout of a cabinet and a bridge branch node in an information room according to a first embodiment of the present application;
fig. 5 schematically illustrates a plan layout of a wiring device node and a bridge branch node according to a first embodiment of the present application;
fig. 6 schematically illustrates an overall step flow diagram of a machine room routing method according to a first embodiment of the present application;
fig. 7 schematically shows a flowchart of steps for calculating an optimal wiring path using the Floyd algorithm according to the first embodiment of the present application;
fig. 8 schematically shows a block diagram of a machine room wiring device according to a second embodiment of the present application; and
Fig. 9 schematically illustrates a hardware architecture diagram of a computer device adapted to implement a machine room wiring method according to a third embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
It should be noted that the descriptions of "first," "second," etc. in the embodiments of the present application are for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In addition, the technical solutions of the embodiments may be combined with each other, but it is necessary to base that the technical solutions can be realized by those skilled in the art, and when the technical solutions are contradictory or cannot be realized, the combination of the technical solutions should be regarded as not exist and not within the protection scope of the present application.
In recent years, technologies such as big data, cloud computing, artificial intelligence and the like are rapidly developed, and as an important component of a computing infrastructure, a data center is a data center and a computing carrier for promoting the development of new generation digital technologies such as 5G, artificial intelligence, cloud computing and the like, and has an important boosting effect on the increase of digital economy.
In the delivery process of a newly built or newly built and enlarged data center machine room, more strong and weak electric wiring projects are involved, and particularly the problems of large wiring quantity, multiple wiring paths, inaccurate cable length estimation, difficult determination of the shortest wiring path and the like are encountered in the comprehensive wiring process of a production network system, so that the prediction of the wiring project quantity by a constructor is not facilitated, and the confirmation and cost control of the wiring project by an owner are not facilitated.
When the existing information machine room is wired, the construction unit mainly performs route planning on the bridge layout by hand according to engineering experience, and then performs cable length estimation in a mode of combining drawing ranging and field actual measurement. However, this wiring method has the following drawbacks:
(1) The traditional information machine room wiring method can basically meet the requirements for small-scale machine rooms, but aims at the wiring of medium-and large-scale data centers, and the problems of low efficiency, long path, large multi-party audit opinion and the like exist in the planning of wiring paths and the confirmation of engineering quantity due to the fact that the wiring engineering quantity is large and the wiring paths are not unique. Thereby affecting the progress and cost of the overall delivery of the information room.
(2) The traditional information machine room wiring method is mostly realized in a manual and form statistics mode, and aims at solving the problems that routing relations and design engineering quantity list forms are required to be searched again according to field conditions for different machine rooms, so that functions such as automation, platformization and visualization are inconvenient to realize, and experience accumulation and standardized management of wiring engineering are not facilitated.
In view of this, the present application aims to propose an automated machine room wiring method comprising: obtaining a layout diagram corresponding to a region to be wired; the area to be wired comprises a plurality of cable connection nodes; determining geometrical relationships among the plurality of cable connection nodes according to the layout diagram; the only minimum bridge unit exists between adjacent cable connection nodes; generating an adjacent matrix according to the geometric relation among the plurality of cable connection nodes and the preset length corresponding to the minimum bridge unit; and determining an optimal wiring path between any two cable connection nodes according to the adjacency matrix. Therefore, by constructing the adjacency matrix according to the geometric relationship between the cable connection nodes, the optimal wiring path between any cable connection nodes is automatically calculated, the planning efficiency of the wiring path of the machine room is improved, the overall delivery schedule of the wiring of the machine room is accelerated, and the overall delivery cost of the wiring of the machine room is reduced.
Various embodiments are provided to further describe machine room wiring schemes, with particular reference to the following.
In the description of the present application, it should be understood that the numerical references before the steps do not identify the order of performing the steps, but are only used for convenience in describing the present application and distinguishing each step, and thus should not be construed as limiting the present application.
The following is a term explanation of the present application:
communicating an undirected graph: the communication undirected graph refers to that any vertex u, v in the graph has a path to communicate u and v. Undirected graphs are described with respect to directed graphs, that is, each edge is a bi-directional edge, while directed graphs each edge is a uni-directional edge, that is, only one point can point to another.
Adjacency matrix: for both sets V and E, where V is the vertex and E is the edge. Storing all vertex data in the graph by using a one-dimensional array; the data of the relationship (edge or arc) between vertices is stored in a two-dimensional array called a adjacency matrix.
Floyd algorithm: the Floyd algorithm is also called an insertion point method, and is an algorithm for searching the shortest path between multiple source points in a given weighted graph by using the idea of dynamic programming.
Fig. 1 schematically shows an environmental application schematic according to an embodiment of the present application. As shown in fig. 1:
the computer device 10000 can be connected to the client 30000 via a network 20000.
The computer device 10000 can provide services such as network debugging, or return machine room wiring result data to the client 30000, or the like.
The computer device 10000 can be located in a data center such as a single venue or distributed in different geographic locations (e.g., in multiple venues). The computer device 10000 can provide services via one or more networks 20000. Network 20000 includes various network devices such as routers, switches, multiplexers, hubs, modems, bridges, repeaters, firewalls, proxy devices, and/or the like. Network 20000 may include physical links such as coaxial cable links, twisted pair cable links, fiber optic links, combinations thereof, and the like. Network 20000 may include wireless links such as cellular links, satellite links, wi-Fi links, and the like.
The computer device 10000 can be implemented by one or more computing nodes. One or more computing nodes may include virtualized computing instances. Virtualized computing instances may comprise emulation of virtual machines, e.g., computer systems, operating systems, servers, etc. The computing node may load the virtual machine by the computing node based on the virtual image and/or other data defining the particular software (e.g., operating system, dedicated application, server) used for the emulation. As the demand for different types of processing services changes, different virtual machines may be loaded and/or terminated on one or more computing nodes. A hypervisor may be implemented to manage the use of different virtual machines on the same computing node.
The client 30000 may be configured to access the content and services of the computer device 10000. Client 30000 can include any type of electronic device, such as a mobile device, tablet device, laptop computer, workstation, virtual reality device, gaming device, set top box, digital streaming media device, vehicle terminal, smart television, set top box, and the like.
The client 30000 can output (e.g., display, render, present) the machine room cabling results data, etc., to a user.
The network debugging scheme will be described below by way of various embodiments. The scheme may be implemented by the computer device 10000.
Example 1
Fig. 2 schematically shows a flow chart of a machine room wiring method according to an embodiment of the present application. Comprising steps S202-S208, wherein,
step S202, obtaining a layout diagram corresponding to a region to be wired; the area to be wired comprises a plurality of cable connection nodes;
in this embodiment, the cable connection nodes include equipment nodes and bridge branch nodes. Specifically, the area to be wired may be one or more areas in an information room, where the information room may include equipment nodes such as a cabinet and a power distribution cabinet, and bridge branch nodes such as a strong current bridge and a weak current bridge, where the equipment such as the cabinet, the power distribution cabinet, the strong current bridge and the weak current bridge generally involve cable connection. As an example, fig. 3 is a schematic plan view of a bridge branch node in an information room, and fig. 4 is a schematic plan view of a cabinet and a bridge branch node in an information room.
Step S204, determining the geometric relationship among the plurality of cable connection nodes according to the layout; the only minimum bridge unit exists between adjacent cable connection nodes;
in this embodiment, in the machine room routing stage, the geometric relationship between the plurality of cable connection nodes in the area to be routed may be determined according to the layout diagram of the area to be routed, where the geometric relationship may include an adjacent relationship and a non-adjacent relationship. If the cable connection nodes are adjacent to each other, a unique minimum bridge unit exists between the two cable connection nodes. The minimum bridge units have corresponding preset lengths, which are preset wiring lengths, such as 1 meter, 2 meters, etc., which are not particularly limited in the embodiments of the present application, and in a specific implementation, all bridge minimum unit segments may be numbered according to the related wiring device positions at the bridge construction completion stage, and the routing lengths may be marked according to the preset lengths, such as D 1,10 ～D 2,10 ，
Step S206, generating an adjacent matrix according to the geometric relation among the plurality of cable connection nodes and the preset length corresponding to the minimum bridge unit;
after the geometric relation among the cable connection nodes is determined, an adjacency matrix is constructed according to the geometric relation among the cable connection nodes and the preset length corresponding to the minimum bridge unit, and self-customized wiring is carried out based on the adjacency matrix. Specifically, the length weight value of each edge in the adjacent matrix can be determined according to the preset length corresponding to the minimum bridge unit.
And step S208, determining the optimal wiring path between any two cable connection nodes according to the adjacency matrix.
In a preferred embodiment of the present application, the step S208 may include the steps of:
and determining an optimal wiring path of wiring between any two cable connection nodes according to the adjacency matrix based on a preset optimal path algorithm.
The preset optimal path algorithm may be a preset designated algorithm, which is used for calculating an optimal path between nodes, and specifically, the preset optimal path algorithm may be a Floyd algorithm or other optimal path algorithms, which is not specifically limited in the embodiment of the present application.
Several alternative embodiments are provided below to optimize the machine room routing method, in particular as follows:
in a preferred embodiment of the present application, the geometric relationship includes an adjacent relationship, and the step S204 may include the steps of:
and orderly numbering the plurality of cable connection nodes according to the layout diagram, and determining the adjacent relation among the plurality of cable connection nodes.
Specifically, in the information machine room design stage, a plurality of cable connection nodes in a region to be wired can be numbered orderly according to the collected layout diagram, for example, the region to be wired contains a strong current system and a weak current system for wiring, the strong current bridge and the power distribution cabinet in the strong current system are numbered orderly in a segmented manner, and the weak current bridge and the power distribution cabinet in the weak current system are numbered orderly in a segmented manner.
As an example, a cable connection node includes an equipment node and a bridge branch node, which are numbered as follows:
(1) Wiring area number: r is R i (specifically, the machine room is corresponding to different areas of the machine room, such as the machine room 1, the machine room 2, the corridor 3 and the distribution room 4).
(2) Device node number: d (D) i,jk (where i represents the device area; jk may represent the row and column numbers), D xmn (where x represents the device area; mn may represent the row, column number) and the like.
(3) Bridge branch node: s is S i,jk (wherein i represents a bridge area; jk may represent a row and column number), S x,mn (where x represents the bridge area; mn may represent the row and column numbers) and the like.
After numbering is completed, the adjacent relationship between the cable connection nodes can be further defined, i.e. different nodes D are defined i,jk And D x,mn Or S x,mn Whether or not they are adjacent. If adjacent, D i,jk ，D x,mn Or S x,mn There is a single minimum bridge unit in between. In this embodiment, the minimum bridge unit has a corresponding preset length, and the preset length is a preset wiring length, for example, 1 meter or 2 meters, which is not particularly limited in this embodiment.
As an example, the adjacency between nodes may be represented as follows:
the corresponding preset length of the minimum bridge unit can be expressed as
As an example, fig. 5 is a schematic plan layout of a wiring device node and a bridge branch node, comprising 2 rooms, numbered R1 and R2, respectively; the R1 room comprises 4 bridge branch nodes, which are respectively numbered as S1-01, S1-02, S1-03 and S1-04, and 7 wiring equipment nodes, which are respectively numbered as D1-01, D1-02, D1-03, D1-04, D1-05, D1-06 and D1-07; the R2 room comprises 2 bridge branch nodes, which are respectively numbered as S2-01 S2-02, and 7 wiring equipment nodes, which are respectively numbered as D2-01, D2-02, D2-03, D2-04, D2-05, D2-06 and D2-07.
In a preferred embodiment of the present application, the step S206 may include the steps of:
constructing a communication undirected graph according to the geometric relationship among the plurality of cable connection nodes; and determining a length weight value corresponding to each side in the communication undirected graph according to the preset length corresponding to the minimum bridge unit, and generating an adjacent matrix.
In a preferred embodiment of the present application, the method further comprises:
adjusting the geometric relationship among the plurality of cable connecting nodes according to the layout diagram; and re-determining the optimal wiring path between any two cable connection nodes according to the adjusted geometric relationship.
In this embodiment, for the dual-routing requirement, after the optimal path is calculated for the first time, the geometric relationship between the cable connection nodes in the area to be routed can be adjusted, and the optimal routing path between any two cable connection nodes is redetermined according to the adjusted geometric relationship, that is, the steps S204-S208 are performed again.
In a preferred embodiment of the present application, said adjusting the geometrical relationship between the plurality of cable connection nodes according to the layout comprises:
and setting adjacent cable connection nodes in the geometric relationship to be non-adjacent or setting non-adjacent cable connection nodes to be adjacent according to the layout.
In this embodiment, in order to realize that the wiring path of the second time is not repeated with the wiring path of the previous time, adjacent cable connection nodes defined at the previous time of wiring may be reset to be non-adjacent, and the non-adjacent cable connection nodes may be set to be adjacent. In the implementation, the adjacent relation between the cable connection nodes can be adjusted according to the actual wiring requirement, for example, more cables are routed through a certain equipment node, and in order to relieve the pressure of the equipment node, some nodes adjacent to the equipment node can be set to be non-adjacent.
In a preferred embodiment of the present application, the method may further comprise the steps of:
determining the total cable quantity of each cable connection node according to the optimal wiring path among all the cable connection nodes in the area to be wired; and displaying the optimal wiring path and the total amount of the cables of each cable connection node.
In this embodiment, a visual interface may be provided to visualize the wiring paths as needed, so as to facilitate the number estimation before continuing to purchase the wiring materials. The total cable amount of each cable connection node is determined according to the optimal wiring path among all cable connection nodes in the area to be wired, and the optimal wiring path and the total cable amount of each cable connection node are displayed, so that during actual wiring, the quantity pre-purchase of wiring materials can be estimated according to the visualized optimal wiring path and the total cable amount of each cable connection node, or the total wiring materials and the routing rationality under the layout of different equipment nodes and bridge branch nodes are analyzed, and the layout of the bridge branch nodes and the equipment nodes is continuously optimized, so that the wiring cost is further reduced.
In a preferred embodiment of the present application, the method may further comprise the steps of:
and adjusting the optimal wiring path according to the optimal wiring path and the total amount of the cables of each cable connection node.
In a specific implementation, the total amount of wiring materials and routing rationality under different cable connection node layouts may be analyzed according to the optimal wiring path and the total amount of cables of each cable connection node, and the optimal wiring path may be adjusted, for example, if the total amount of cables passing through a target cable connection node is more, the target path passing through the cable connection node in the optimal wiring path may be adjusted so as not to pass through the cable connection node.
In a preferred embodiment of the present application, the method may further comprise the steps of:
acquiring the actual wiring length; determining the length of the optimal wiring path according to the preset length corresponding to the minimum bridge unit; and adjusting the preset length corresponding to the minimum bridge unit according to the actual wiring length and the length of the optimal wiring path so as to optimize the estimated effect of wiring on the area to be wired.
In this embodiment, the actual wiring effect is compared and analyzed, and the length of the optimal wiring path is calculated, so that the preset length corresponding to the minimum bridge unit is adjusted to optimize the estimated effect of the wiring. Specifically, the routing length of the nonstandard straight line segments such as the turning part of the bridge frame and the terminal wiring of the equipment can be emphasized and compared to adjust the preset length corresponding to the minimum bridge frame unit, so that the length weight value in the adjacent matrix is continuously updated, and the estimated accuracy of the wiring length is continuously optimized.
In a specific implementation, a length deviation value can be obtained by calculating the difference between the length of the optimal wiring path and the actual wiring length, and whether the length deviation value is smaller than a preset threshold value is judged, if the length deviation value is smaller than the preset threshold value, the prediction of the wiring degree meets the requirement, and the preset length corresponding to the minimum bridge unit does not need to be adjusted; if the length deviation value is larger than or equal to the preset threshold value, the estimated wiring degree is not in accordance with the requirement, and the preset length corresponding to the minimum bridge unit needs to be adjusted.
For further describing the embodiment of the present application, it is assumed that the area to be wired includes an equipment node and a bridge branch node, and fig. 6 shows an overall step flowchart of a machine room wiring method, which specifically includes the following steps:
step S601, obtaining a layout diagram of equipment nodes and bridge branch nodes in a region to be wired;
in the present embodiment, the document a is obtained by extracting a layout diagram and outputting the result.
Step S602, numbering equipment nodes, bridge branch nodes and minimum bridge units, and initializing wiring lengths of all bridge units;
in the present embodiment, the document B is obtained by extracting a layout diagram and outputting the result.
Step S603, forming a communication undirected graph by the equipment nodes and the bridge branch nodes, and outputting an initialized adjacent matrix;
in this embodiment, required data is obtained by integrating the document A, B, and a connected undirected graph is constructed from the data.
Step S604, according to actual wiring experience feedback, the wiring length of the minimum bridge unit is adjusted, and the distance weight value in the adjacent matrix is determined;
step S605, calculating the shortest length of wiring among the nodes of the equipment required by output and the wiring path through an optimal path algorithm;
step S606, adjusting the adjacent matrix according to the requirement, and calculating a plurality of optimal paths to output a plurality of shortest lengths and wiring paths;
step S607, adding a reasonable safety margin for each wiring path, and arranging field wiring;
step S608, determining whether the deviation between the actual wiring degree and the estimated length meets the requirement, if not, determining the wiring length weight of the minimum bridge unit to be adjusted, and returning to step S604.
As an example, as shown in fig. 7, a flowchart of steps for calculating an optimal wiring path using the Floyd algorithm, specifically includes the steps of: initializing a graph (adjacency matrix); the source node is put into the set S; judging whether the shortest paths of all nodes are solved; if yes, ending the flow, otherwise, selecting a point U which is not in the S and is far from the shortest distance, and adding the point U into the S; judging whether a shorter distance to U is found; if not, adding U into S; if yes, the distance of other points which are not in the S is further increased, and U is added into the S; and returning to the execution step to judge whether the shortest paths of all the nodes are all solved.
Example two
Fig. 8 schematically illustrates a block diagram of a machine room cabling system according to a second embodiment of the present application, which may be partitioned into one or more program modules, which are stored in a storage medium and executed by one or more processors to complete the embodiments of the present application. Program modules in the embodiments of the present application refer to a series of computer program instruction segments capable of implementing specific functions, and the following description specifically describes the functions of each program module in the embodiments of the present application.
As shown in fig. 8, the machine room cabling system 800 may include the following modules:
a map obtaining module 810, configured to obtain a map corresponding to a to-be-wired area; the area to be wired comprises a plurality of cable connection nodes;
a geometric relationship determining module 820, configured to determine geometric relationships between the plurality of cable connection nodes according to the layout diagram; the only minimum bridge unit exists between adjacent cable connection nodes;
an adjacency matrix generating module 830, configured to generate an adjacency matrix according to a geometric relationship between the plurality of cable connection nodes and a preset length corresponding to the minimum bridge unit;
an optimal routing path determining module 840, configured to determine an optimal routing path between any two cable connection nodes according to the adjacency matrix, and a length of the optimal routing path.
In a preferred embodiment of the present application, the geometric relationship comprises an adjacency relationship, and the geometric relationship determination module 820 comprises:
and the adjacent relation determining submodule is used for orderly numbering the plurality of cable connection nodes according to the layout diagram and determining the adjacent relation among the plurality of cable connection nodes.
In a preferred embodiment of the present application, the system further comprises:
the geometric relation adjustment module is used for adjusting the geometric relation among the plurality of cable connection nodes according to the layout diagram;
and the path redetermining module is used for redetermining the optimal wiring path between any two cable connection nodes according to the adjusted geometric relationship.
In a preferred embodiment of the present application, the geometric relationship adjustment module includes:
and the geometric relation adjustment sub-module is used for setting adjacent cable connection nodes in the geometric relation to be non-adjacent or setting non-adjacent cable connection nodes to be adjacent according to the layout diagram.
In a preferred embodiment of the present application, the adjacency matrix generation module 830 includes:
the communication undirected graph construction submodule is used for constructing a communication undirected graph according to the geometric relationship among the plurality of cable connection nodes;
and the adjacency matrix generation submodule is used for determining a length weight value corresponding to each side in the communication undirected graph according to the preset length corresponding to the minimum bridge unit and generating an adjacency matrix.
In a preferred embodiment of the present application, the system further comprises:
the cable total amount determining module is used for determining the cable total amount of each cable connection node according to the optimal wiring path among all the cable connection nodes in the area to be wired;
and the path display module is used for displaying the optimal wiring path and the total amount of the cables of each cable connection node.
In a preferred embodiment of the present application, the system further comprises:
and the path adjusting module is used for adjusting the optimal wiring path according to the optimal wiring path and the total amount of the cables of each cable connecting node.
In a preferred embodiment of the present application, the optimal routing path determining module 840 includes:
and the optimal wiring path determining submodule is used for determining an optimal wiring path of wiring between any two cable connection nodes according to the adjacency matrix based on a preset optimal path algorithm.
In a preferred embodiment of the present application, the system further comprises:
the wiring length acquisition module is used for acquiring the actual wiring length;
the path length determining module is used for determining the length of the optimal wiring path according to the preset length corresponding to the minimum bridge unit;
the preset length adjusting module is used for adjusting the preset length corresponding to the minimum bridge unit according to the actual wiring length and the length of the optimal wiring path so as to optimize the estimated effect of wiring on the area to be wired.
In a preferred embodiment of the present application, the cable connection node includes an equipment node and a bridge branch node.
Example III
Fig. 9 schematically illustrates a hardware architecture diagram of a computer device 10000 adapted to implement a machine room wiring method according to a third embodiment of the present application. In this embodiment, the computer device 10000 is a device capable of automatically performing numerical calculation and/or information processing in accordance with an instruction set or stored in advance. For example, the server may be a smart phone, a tablet computer, a notebook computer, a desktop computer, a rack-mounted server, a blade server, a tower server, or a cabinet server (including a FEN independent server or a server cluster formed by a plurality of servers), etc. As shown in fig. 9, the computer device 10000 includes at least, but is not limited to: the memory 10010, processor 10020, network interface 10030 may be communicatively linked to each other via a system bus. Wherein:
memory 10010 includes at least one type of computer-readable storage medium including flash memory, hard disk, multimedia card, card memory (e.g., SD or DX memory, etc.), random Access Memory (RAM), static Random Access Memory (SRAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), programmable read-only memory (PROM), magnetic memory, magnetic disk, optical disk, etc. In some embodiments, memory 10010 may be an internal storage module of computer device 10000, such as a hard disk or memory of computer device 10000. In other embodiments, the memory 10010 may also be an external storage device of the computer device 10000, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card (Flash Card) or the like. Of course, the memory 10010 may also include both an internal memory module of the computer device 10000 and an external memory device thereof. In this embodiment, the memory 10010 is typically used for storing an operating system installed in the computer device 10000 and various application software, such as program codes of a room wiring method. In addition, the memory 10010 may be used to temporarily store various types of data that have been output or are to be output.
The processor 10020 may be a central processing unit (Central Processing Unit, simply CPU), controller, microcontroller, microprocessor, or other data processing chip in some embodiments. The processor 10020 is typically configured to control overall operation of the computer device 10000, such as performing control and processing related to data interaction or communication with the computer device 10000. In this embodiment, the processor 10020 is configured to execute program codes or process data stored in the memory 10010.
The network interface 10030 may comprise a wireless network interface or a wired network interface, which network interface 10030 is typically used to establish a communication link between the computer device 10000 and other computer devices. For example, the network interface 10030 is used to connect the computer device 10000 to an external terminal through a network, establish a data transmission channel and a communication link between the computer device 10000 and the external terminal, and the like. The network may be a wireless or wired network such as an Intranet (Intranet), the Internet (Internet), a global system for mobile communications (Global System of Mobile communication, abbreviated as GSM), wideband code division multiple access (Wideband Code Division Multiple Access, abbreviated as WCDMA), a 4G network, a 5G network, bluetooth (Bluetooth), wi-Fi, etc.
It should be noted that fig. 9 only shows a computer device having components 10010-10030, but it should be understood that not all of the illustrated components are required to be implemented, and more or fewer components may be implemented instead.
In this embodiment, the machine room routing method stored in the memory 10010 may also be divided into one or more program modules and executed by one or more processors (the processor 10020 in this embodiment) to complete the embodiments of the present application.
Example IV
The present application also provides a computer-readable storage medium having a computer program stored thereon, which when executed by a processor, implements the steps of the machine room routing method in the embodiments.
In this embodiment, the computer-readable storage medium includes a flash memory, a hard disk, a multimedia card, a card memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, and the like. In some embodiments, the computer readable storage medium may be an internal storage unit of a computer device, such as a hard disk or a memory of the computer device. In other embodiments, the computer readable storage medium may also be an external storage device of a computer device, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash Card (Flash Card), etc. that are provided on the computer device. Of course, the computer-readable storage medium may also include both internal storage units of a computer device and external storage devices. In this embodiment, the computer readable storage medium is typically used to store an operating system and various types of application software installed on the computer device, such as program codes of the machine room wiring method in the embodiment, and the like. Furthermore, the computer-readable storage medium may also be used to temporarily store various types of data that have been output or are to be output.
It will be apparent to those skilled in the art that the modules or steps of the embodiments of the application described above may be implemented in a general purpose computing device, they may be concentrated on a single computing device, or distributed across a network of computing devices, they may alternatively be implemented in program code executable by computing devices, so that they may be stored in a storage device for execution by computing devices, and in some cases, the steps shown or described may be performed in a different order than what is shown or described, or they may be separately fabricated into individual integrated circuit modules, or multiple modules or steps of them may be fabricated into a single integrated circuit module. Thus, embodiments of the present application are not limited to any specific combination of hardware and software.
The foregoing description is only of the preferred embodiments of the present application, and is not intended to limit the scope of the claims, and all equivalent structures or equivalent processes using the descriptions and drawings of the present application, or direct or indirect application in other related technical fields are included in the scope of the claims of the present application.
Claims (13)
1. The machine room wiring method is characterized by comprising the following steps of:
obtaining a layout diagram corresponding to a region to be wired; the area to be wired comprises a plurality of cable connection nodes;
determining geometrical relationships among the plurality of cable connection nodes according to the layout diagram; the only minimum bridge unit exists between adjacent cable connection nodes;
generating an adjacent matrix according to the geometric relation among the plurality of cable connection nodes and the preset length corresponding to the minimum bridge unit;
and determining an optimal wiring path between any two cable connection nodes according to the adjacency matrix.
2. The machine room routing method of claim 1, wherein the geometric relationship comprises an adjacency relationship, and the determining the geometric relationship between the plurality of cable connection nodes according to the layout diagram comprises:
and orderly numbering the plurality of cable connection nodes according to the layout diagram, and determining the adjacent relation among the plurality of cable connection nodes.
3. The machine room wiring method of claim 1, further comprising:
adjusting the geometric relationship among the plurality of cable connecting nodes according to the layout diagram;
and re-determining the optimal wiring path between any two cable connection nodes according to the adjusted geometric relationship.
4. The machine room routing method of claim 3, wherein the adjusting the geometric relationship between the plurality of cable connection nodes according to the layout diagram comprises:
and setting adjacent cable connection nodes in the geometric relationship to be non-adjacent or setting non-adjacent cable connection nodes to be adjacent according to the layout.
5. The machine room routing method according to claim 1, wherein the generating an adjacency matrix according to the geometric relationship between the plurality of cable connection nodes and the preset length corresponding to the minimum bridge unit includes:
constructing a communication undirected graph according to the geometric relationship among the plurality of cable connection nodes;
and determining a length weight value corresponding to each side in the communication undirected graph according to the preset length corresponding to the minimum bridge unit, and generating an adjacent matrix.
6. The machine room wiring method of claim 1, further comprising:
determining the total cable quantity of each cable connection node according to the optimal wiring path among all the cable connection nodes in the area to be wired;
and displaying the optimal wiring path and the total amount of the cables of each cable connection node.
7. The machine room routing method of claim 6, further comprising:
and adjusting the optimal wiring path according to the optimal wiring path and the total amount of the cables of each cable connection node.
8. The machine room routing method according to claim 1, wherein the determining an optimal routing path for routing between any two cable connection nodes according to the adjacency matrix includes:
and determining an optimal wiring path of wiring between any two cable connection nodes according to the adjacency matrix based on a preset optimal path algorithm.
9. The machine room wiring method of claim 1, further comprising:
acquiring the actual wiring length;
determining the length of the optimal wiring path according to the preset length corresponding to the minimum bridge unit;
and adjusting the preset length corresponding to the minimum bridge unit according to the actual wiring length and the length of the optimal wiring path so as to optimize the estimated effect of wiring on the area to be wired.
10. The machine room routing method of claim 1, wherein the cable connection nodes comprise equipment nodes and bridge branch nodes.
11. A machine room wiring system, comprising:
the layout diagram acquisition module is used for acquiring a layout diagram corresponding to the area to be wired; the area to be wired comprises a plurality of cable connection nodes;
the geometric relation determining module is used for determining geometric relations among the plurality of cable connection nodes according to the layout diagram; the only minimum bridge unit exists between adjacent cable connection nodes;
the adjacent matrix generation module is used for generating an adjacent matrix according to the geometric relation among the plurality of cable connection nodes and the preset length corresponding to the minimum bridge unit;
and the optimal wiring path determining module is used for determining an optimal wiring path between any two cable connection nodes according to the adjacency matrix and the length of the optimal wiring path.
12. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor executes the computer program for carrying out the steps of the machine room cabling method according to any one of claims 1 to 10.
13. A computer-readable storage medium, characterized in that the computer-readable storage medium has stored therein a computer program executable by at least one processor to cause the at least one processor to perform the steps of the machine room wiring method of any one of claims 1 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310391129.9A CN116522552A (en) | 2023-04-12 | 2023-04-12 | Machine room wiring method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310391129.9A CN116522552A (en) | 2023-04-12 | 2023-04-12 | Machine room wiring method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116522552A true CN116522552A (en) | 2023-08-01 |
Family
ID=87400401
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310391129.9A Pending CN116522552A (en) | 2023-04-12 | 2023-04-12 | Machine room wiring method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116522552A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117612145A (en) * | 2023-12-15 | 2024-02-27 | 上海青翼工业软件有限公司 | Automatic part machining method and device, computer equipment and storage medium |
-
2023
- 2023-04-12 CN CN202310391129.9A patent/CN116522552A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117612145A (en) * | 2023-12-15 | 2024-02-27 | 上海青翼工业软件有限公司 | Automatic part machining method and device, computer equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110868319A (en) | Network topology drawing method, device, equipment and readable storage medium | |
| CN111135574B (en) | Game scene generation method and device, computer readable medium and electronic equipment | |
| CN116522552A (en) | Machine room wiring method and system | |
| CN114239198B (en) | Power grid subgraph division method and device based on parallel optimization | |
| CN110209748A (en) | The method and apparatus for indexing geography fence | |
| CN114880337A (en) | Map data integrated updating method, device, equipment and storage medium | |
| CN105743693A (en) | Communication network line topology-building and updating method and communication network line topology-building and updating system based on GIS | |
| CN112633785B (en) | Warehouse visualization method and device | |
| CN113220748B (en) | Method and system for constructing power distribution network equipment load thermodynamic diagram and data analysis | |
| CN113378069B (en) | Main and distribution network automatic drawing method based on intelligent recommendation algorithm | |
| CN112337093B (en) | Virtual object clustering method and device, storage medium and electronic device | |
| CN114330807A (en) | Route determination method and device and electronic equipment | |
| CN113762573B (en) | Logistics network optimization method and device | |
| CN111080749B (en) | Multi-source measurement labeling method and device in power distribution network wide-area measurement control system | |
| CN114281668A (en) | Abnormal case generation method, abnormal case generation device, electronic device, and storage medium | |
| CN109039907B (en) | Method, device, equipment and storage medium for determining optimal path of network data traffic | |
| CN112988932A (en) | High-precision map labeling method, device, equipment, readable storage medium and product | |
| CN115359227B (en) | Fusion method and device of regional live-action map and lane-level map and electronic equipment | |
| CN110276567A (en) | The method and apparatus for checking ground region identification code based on automated guided vehicle | |
| CN117273270B (en) | Engineering quota evaluation method and device, terminal equipment and storage medium | |
| CN115984425A (en) | OpenGL-based method and system for linkage drawing and editing of flat section diagram | |
| CN117592885A (en) | Supply and demand data processing method and device based on supply chain, medium and electronic equipment | |
| CN115730681A (en) | Model training method, device, equipment and storage medium | |
| CN117592229A (en) | Cable path map generation method, device and nonvolatile storage medium | |
| CN118276817A (en) | Data sorting method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |