CN106934151B - Automatic routing searching method for multiple cables - Google Patents
Automatic routing searching method for multiple cables Download PDFInfo
- Publication number
- CN106934151B CN106934151B CN201710141564.0A CN201710141564A CN106934151B CN 106934151 B CN106934151 B CN 106934151B CN 201710141564 A CN201710141564 A CN 201710141564A CN 106934151 B CN106934151 B CN 106934151B
- Authority
- CN
- China
- Prior art keywords
- route
- current cable
- cable
- segment
- cables
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Geometry (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Computer Hardware Design (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for automatically searching for a route by a plurality of cables, which comprises the following steps: step 100: sorting the current cables from high to low according to the priority, and selecting the cable with the highest priority as the current cable; step 200: inquiring the route of the current cable along the route segment with the non-zero free amount according to a shortest path algorithm; step 300: and judging whether the current cable is the last cable, if so, outputting the route of each cable, otherwise, taking the next cable of the current cable as the current cable, and returning to the step 200. According to the method, the problem that important cables cannot be routed can be effectively avoided by sequencing the cables, and meanwhile, the shortest route can be quickly found through the strong computing power of a computer and the shortest route algorithm, so that the method for automatically finding the route by the plurality of cables can effectively solve the problem that the workload for laying and finding the optimal route scheme by the plurality of cables is huge.
Description
Technical Field
The invention relates to the field of cable laying, in particular to a method for automatically searching for a route of a plurality of cables.
Background
When a large number of cables are laid, there are more than one route for any one cable, and many routes exist, and in these routes, workers need to consider various factors to find the best route. In cable laying, the following factors are generally considered: starting and stopping nodes for laying cables, which are set according to requirements; the utilization rate of the pipeline, namely the number of used pipe holes accounts for the number of main pipe holes, and therefore a large amount of historical data needs to be inquired by workers and then calculated. Pole utilization, i.e. number of used/total hoisting lines; the priority and importance of cabling, which is determined according to the needs of the prior art; the cables route various constraints.
The complex limiting factors and the complex pipeline network or pole network are added, the workload is huge and the design period is long when people want to select the optimal laying route, meanwhile, due to the difference of the levels of designers, the design result can also vary from person to person, the subjectivity is high, and the design result is not the optimal routing scheme.
In summary, how to effectively solve the problem that the workload for finding the optimal routing scheme by laying a plurality of cables is enormous is a problem that needs to be solved urgently by those skilled in the art at present.
Disclosure of Invention
In view of the above, an object of the present invention is to provide an automatic routing method for multiple cables, which can effectively solve the problem of enormous workload for laying multiple cables to find an optimal routing scheme.
In order to achieve the first object, the invention provides the following technical scheme:
a method for automatically searching for a route by a plurality of cables comprises the following steps:
step 100: determining initial nodes and final nodes of all cables, sequencing the current cables from high to low according to the priority, and selecting the cable with the highest priority as the current cable;
step 200: inquiring the route of the current cable along a route segment with the non-zero free amount between an initial node and a final node of the current cable according to a shortest path algorithm, if the route is inquired, determining the route to be the route of the current cable, and if the route is not inquired, prompting that the route of the current cable is not found;
step 300: and judging whether the current cable is the last cable, if so, outputting the route of each cable, otherwise, taking the next cable of the current cable as the current cable, and returning to the step 200.
Preferably, the route of the current cable is queried according to the shortest path algorithm along the route segment with the free space not being zero, and the route is as follows:
and inquiring the route of the current cable according to the shortest path algorithm along the route segment with the free space not being zero according to the constraint condition of the current cable.
Preferably, the step 200 is:
step 210: according to the constraint condition of the current cable, inquiring the route of the current cable along the route section with the non-zero vacancy amount between the initial node and the final node of the current cable according to a shortest path algorithm;
step 220: judging whether the route of the current cable is inquired, if so, executing step 230, and if not, prompting that the route of the current cable is not found;
step 230: and judging whether each routing segment of the route meets the utilization rate of the routing segment, if so, determining that the route is the route of the current cable, and if not, adding the routing segment which does not meet the utilization rate of the routing segment in the route into the constraint condition of the current cable, and returning to the step 210.
Preferably, the step 230 is:
judging whether each routing segment of the route meets the utilization rate of the routing segment, if so, determining that the route is the route of the current cable, if not, sending a constraint condition modification application to the terminal, taking the constraint condition modification as the constraint condition of the current cable when receiving the constraint condition modification, returning to the step 210, and adding the routing segments which do not meet the utilization rate of the routing segment in the route to the constraint condition of the current cable when not receiving the constraint condition modification, and returning to the step 210.
Preferably, while the determining that the route is the route of the current cable, the method further includes:
the amount of free space of each route segment occupied by the route is subtracted by one.
Preferably, the constraint condition includes that when the route of the current cable has a first predetermined route segment, the route of the current cable is queried according to a shortest path algorithm along the route segment with the free space amount being not zero as follows: inquiring a first route between a first route segment and an initial node and a second route between the first route segment and a final node along a route segment with the free space not being zero according to a shortest path algorithm, and taking a route synthesized by the first route and the second route as an inquired route; and the constraint condition comprises that when the route of the current cable avoids the second preset route segment, the vacancy of the second route segment is set to be zero before the route of the current cable is inquired along the route segment with the vacancy not being zero according to the shortest path algorithm.
The method for automatically searching the route of the multiple cables can rapidly acquire the routes of the multiple cables through powerful calculation of a computer. The method specifically comprises the following steps. Step 100: determining initial nodes and final nodes of all cables, sequencing the current cables from high to low according to the priority, and selecting the cable with the highest priority as the current cable. Step 200: and inquiring the route of the current cable along the route segment with the non-zero free amount between the initial node and the final node of the current cable according to a shortest path algorithm, if the route is inquired, determining the route to be the route of the current cable, and if the route is not inquired, prompting that the route of the current cable is not found. Step 300: and judging whether the current cable is the last cable, if so, outputting the route of each cable, otherwise, taking the next cable of the current cable as the current cable, and returning to the step 200.
According to the technical scheme, when the method is applied, only the first node and the final node of each cable need to be input, and after the priority order is set, the priority is from high to low through the method, and cable routing inquiry is carried out one by one through a shortest path algorithm. After the query is completed, the route of each cable can be obtained. In the method, the cables are sequenced by setting the priority of the cables, the problem that important cables cannot be routed can be effectively avoided, meanwhile, the shortest route can be quickly found through the strong computing power of a computer and the shortest path algorithm, and the problem that the route set at will is too long and energy is wasted is avoided. In conclusion, the method for automatically searching for the route by the multiple cables can effectively solve the problem that the workload for laying the multiple cables and searching for the optimal route scheme is huge.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a method for automatically finding a route for multiple cables according to an embodiment of the present invention.
Detailed Description
The embodiment of the invention discloses a method for automatically searching for a route by a plurality of cables, which aims to effectively solve the problem of huge workload for laying and searching for an optimal route scheme by a plurality of cables.
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Referring to fig. 1, fig. 1 is a flowchart of a method for automatically finding a route for multiple cables according to an embodiment of the present invention.
In an embodiment, the present embodiment provides an automatic routing finding method for multiple cables, so as to quickly obtain routes of multiple cables through powerful calculation of a computer. The method specifically comprises the following steps.
Step 100: determining initial nodes and final nodes of all cables, sequencing the current cables from high to low according to the priority, and selecting the cable with the highest priority as the current cable.
The initial node and the final node of each cable are determined, it should be noted that the route determined by each cable starts from the initial node and ends at the final node, and a line is formed between the initial node and the final node along the existing nodes in a string manner, so that the line is a route, and a line segment located between two adjacent nodes is called a route segment. After the initial node and the final node of each cable are obtained, the current cables are sorted from high to low according to the priority order, and it should be noted that it is specifically specified which cable is the cable with high priority and which cable is the cable with low priority, so that the computer can judge according to the priority rule and automatically perform priority sorting. Or manually judging according to the existing complex and disordered information of various aspects and inputting into the computer. The factors generally considering the priority mainly include the level of each cable, the degree of engineering requirements, the importance of the bearer service, and the like. After the sorting is completed, the cables are sequentially arranged from high to low in priority, and before the following steps are executed, the cable with the highest priority is selected as the current cable, namely the cable which is currently subjected to route searching. Through priority setting, the situation that important pipelines cannot be routed according to detours or important cables due to insufficient resources can be avoided.
Step 200: and inquiring the route of the current cable along the route segment with the non-zero free amount between the initial node and the final node of the current cable according to a shortest path algorithm, if the route is inquired, determining the route to be the route of the current cable, and if the route is not inquired, prompting that the route of the current cable is not found.
It should be noted that when a certain part of the cable passes through between two adjacent nodes, when the cable is threaded and arranged in the pipeline, the number of the spare holes of the pipeline between the two nodes is required to be not zero, that is, not less than one, so that the route segment spare amount between the two nodes should not be equal to zero, that is, not less than one; when the cables are threaded on the support rods, the number of the suspension wires left on the support rods at the two node positions at the two ends of the routing segment is not zero, i.e. not less than one, so that the routing segment space between the two nodes should not be equal to zero, i.e. not less than one. And inquiring the route of the current cable along the route segment with the non-zero vacancy amount so as to ensure that each route segment vacancy amount of the inquired route is not zero, so that the route can successfully finish threading. It should be noted that, a shortest path algorithm should be adopted for a specific query manner, and specifically, the shortest path algorithm may refer to the prior art, which is not described in detail herein.
After querying a route of a current cable along a route segment with a non-zero margin amount through a shortest path algorithm, if the route can be queried, the route can be regarded as the shortest route of the current cable, and if the route is not queried, it indicates that the cable cannot arrange the route under the current condition, and a prompt is sent outwards to prompt that the route of the current cable is not found.
Step 300: and judging whether the current cable is the last cable, if so, outputting the route of each cable, otherwise, taking the next cable of the current cable as the current cable, and returning to the step 200.
After the route query of the current cable is completed, it is required to know whether all currently set cables have undergone the route query. Namely, whether the current cable is the last cable is judged, if yes, the inquiry of each cable is finished, namely, the route of each cable can be output, and for the cable which does not inquire the route, the output inquiry result is used for prompting that the route of the cable is not inquired, namely, the whole inquiry is finished. If not, the next cable of the current cable is set as the current cable, and the step 200 is returned to perform routing query on the cables with the lower priority.
In this embodiment, when the method is applied, only the first node and the last node of each cable need to be input, and after the priority order is set, the method is used to query the cable routes one by one from high priority to low priority through the shortest path algorithm. After the query is completed, the route of each cable can be obtained. In the method, the cables are sequenced by setting the priority of the cables, the problem that important cables cannot be routed can be effectively avoided, meanwhile, the shortest route can be quickly found through the strong computing power of a computer and the shortest path algorithm, and the problem that the route set at will is too long and energy is wasted is avoided. In conclusion, the method for automatically searching for the route by the multiple cables can effectively solve the problem that the workload for laying the multiple cables and searching for the optimal route scheme is huge. And meanwhile, the cost of cable arrangement routing can be greatly reduced.
Further, considering that, when actually laying cables, it is often encountered that, when laying the current cables, the current cables are easily limited by constraint conditions, and in order to plan the route of each cable, at this time, the route segment whose free space is not zero may be made to query the route of the current cable according to a shortest path algorithm, specifically: and inquiring the route of the current cable according to the shortest path algorithm along the route segment with the free space not being zero according to the constraint condition of the current cable.
Particularly, under the constraint condition, how to adopt the shortest path algorithm can specifically refer to a method for avoiding the crowded road section by a map. If the constraint condition includes that a certain node is avoided, the spare amount of all routing segments including the node can be set to be zero, and the node is searched; if a certain node is needed, the method can be executed in two parts, firstly, the shortest route is obtained between the initial node and the node according to the shortest path algorithm, then, the shortest route is obtained between the node and the final node according to the shortest path book algorithm, and the two shortest routes are connected in series, namely, the final route of the cable is obtained; the shortest path algorithm can be executed according to the corresponding transformation according to specific constraint conditions.
Further, step 200 may be further performed according to the following detailed steps.
Step 210: and according to the constraint condition of the current cable, inquiring the route of the current cable along the route segment with the non-zero vacancy amount between the initial node and the final node of the current cable according to a shortest path algorithm.
Step 220: and judging whether the route of the current cable is inquired, if so, executing step 230, and if not, prompting that the route of the current cable is not found.
Step 230: and judging whether each routing segment of the route meets the utilization rate of the routing segment, if so, determining that the route is the route of the current cable, and if not, adding the routing segment which does not meet the utilization rate of the routing segment in the route into the constraint condition of the current cable, and returning to the step 210.
It should be noted that, for the pipe routing, the routing segment utilization is the pipe utilization, i.e., the ratio of the number of occupied pipe holes to the total number of pipe bundles of the bus, and for the rod routing, the routing segment utilization is the rod utilization, i.e., the ratio of the number of occupied suspension wires to the total number of suspension wires. When the current route does not meet the utilization rate of the route segments of the current cable, the route segments which do not meet the utilization rate of the route segments in the route are added into the constraint condition of the current cable, and when the shortest path algorithm is adopted next time, the route segments which do not meet the utilization rate of the segments are avoided, for example, when the shortest path algorithm is carried out to obtain the route, the next shortest route is obtained as the route which meets the condition currently. Specifically, the avoidance can be performed in different manners according to different shortest path algorithms. It should be noted that, whether the routing segment utilization is satisfied should include two layers: whether the utilization rate of the route sections is lower than that of the route sections or not can be judged, so that the route sections with less vacant quantity can be prevented from being continuously occupied as much as possible to be used as standby in the later period, further, cables can be conveniently and temporarily dispatched in the later period, more important cable wiring is easy, and meanwhile, the method has the advantages of convenience in network optimization, emergency occupation and the like; whether the utilization rate of the route sections is higher than that of the route sections or not can be determined, so that the route sections which occupy less empty space in advance are ensured, each route is more compact in arrangement, and when a plurality of cables are arranged, the cables are conveniently and intensively arranged, and the wiring cost is reduced. Both meanings should be within the scope of the present invention, so that the occupied condition of each routing segment can be reasonably controlled by judging the utilization rate of the routing segment. It should be further noted that the utilization rate of a specific routing segment may be determined according to actual needs, and is not specifically limited herein.
Further, considering that, because the pole utilization rate is set, it is easy to cause some cables to be unable to query the route, and based on this, in order to avoid that the cables are unable to acquire the route, step 230 may specifically be:
judging whether the route meets the utilization rate of the route section, if so, determining that the route is the route of the current cable, if not, sending a constraint condition modification application to the terminal, taking the constraint condition modification as the constraint condition of the current cable when receiving the constraint condition modification, returning to the step 210, and adding the route avoiding into the constraint condition of the current cable when not receiving the constraint condition modification, and returning to the step 210. It should be noted that, after sending a modification application to the terminal, the terminal enters a receiving state to receive the modified constraint condition, and if no response is made over a predetermined time or the received instruction is a no-modification instruction, the route segment that does not satisfy the route segment utilization rate in the route is added to the constraint condition of the current cable, and the process returns to step 210, that is, it indicates that no modification is performed. When the modified constraint is received, then step 210 should be returned without adding the routing segment that does not satisfy the routing segment utilization to the constraint of the current cable. Before returning to step 210, it is determined whether the constraint condition of the current cable needs to be modified manually, and if so, the modified constraint condition is used as the constraint condition of the current cable.
Further, considering that when many cables are wired, the spare amount of some routing segments is easily insufficient, and based on this, in the above step, when the route is determined to be the route of the current cable, the spare amount of each routing segment occupied by the route is subtracted by one, so as to update the spare amount of each cable in time.
Further, in the terminal constraint, it is generally common that the route of the current cable includes a first route segment, and then the route of the current cable is queried according to the shortest path algorithm along the route segment with the free space amount being not zero as: and inquiring a first route between the first route segment and the initial node and a second route between the first route segment and the final node along the route segment with the free space not being zero according to a shortest path algorithm, and taking a route synthesized by the first route and the second route as an inquired route. It should be noted that if any one of the routes is not queried, it is considered that no route is queried.
Still further, or often, the routing of the current cable avoids the second routing segment, where the margin of the second routing segment is set to zero before the routing of the current cable is queried by the shortest path algorithm along a routing segment for which the margin is not zero.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (5)
1. A method for automatically searching for a route of a plurality of cables is characterized by comprising the following steps:
step 100: determining initial nodes and final nodes of all cables, sequencing the current cables from high to low according to the priority, and selecting the cable with the highest priority as the current cable;
step 200: inquiring the route of the current cable along a route segment with the non-zero free amount between an initial node and a final node of the current cable according to a shortest path algorithm, if the route is inquired, determining the route to be the route of the current cable, and if the route is not inquired, prompting that the route of the current cable is not found;
step 300: judging whether the current cable is the last cable, if so, outputting the route of each cable, otherwise, taking the next cable of the current cable as the current cable, and returning to the step 200; while determining that the route is the route of the current cable, the method further includes: the amount of free space of each route segment occupied by the route is subtracted by one.
2. The method for automatically finding a route for multiple cables according to claim 1, wherein the route for the current cable is queried according to a shortest path algorithm along the route segment with the free space not being zero, and is:
and inquiring the route of the current cable according to the shortest path algorithm along the route segment with the free space not being zero according to the constraint condition of the current cable.
3. The method for automatically finding and routing a plurality of cables according to claim 2, wherein the step 200 is:
step 210: according to the constraint condition of the current cable, inquiring the route of the current cable along the route section with the non-zero vacancy amount between the initial node and the final node of the current cable according to a shortest path algorithm;
step 220: judging whether the route of the current cable is inquired, if so, executing step 230, and if not, prompting that the route of the current cable is not found;
step 230: and judging whether each routing segment of the route meets the utilization rate of the routing segment, if so, determining that the route is the route of the current cable, and if not, adding the routing segment which does not meet the utilization rate of the routing segment in the route into the constraint condition of the current cable, and returning to the step 210.
4. The method according to claim 3, wherein the step 230 is:
judging whether each routing segment of the route meets the utilization rate of the routing segment, if so, determining that the route is the route of the current cable, if not, sending a constraint condition modification application to the terminal, taking the constraint condition modification as the constraint condition of the current cable when receiving the constraint condition modification, returning to the step 210, and adding the routing segments which do not meet the utilization rate of the routing segment in the route to the constraint condition of the current cable when not receiving the constraint condition modification, and returning to the step 210.
5. The method of claim 4, wherein the constraint condition includes that when the route of the current cable has the first predetermined route segment, the route of the current cable is queried according to a shortest path algorithm along the route segment with the free space amount being not zero as: inquiring a first route between a first route segment and an initial node and a second route between the first route segment and a final node along a route segment with the free space not being zero according to a shortest path algorithm, and taking a route synthesized by the first route and the second route as an inquired route; and the constraint condition comprises that when the route of the current cable avoids the second preset route segment, the vacancy of the second route segment is set to be zero before the route of the current cable is inquired along the route segment with the vacancy not being zero according to the shortest path algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710141564.0A CN106934151B (en) | 2017-03-10 | 2017-03-10 | Automatic routing searching method for multiple cables |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710141564.0A CN106934151B (en) | 2017-03-10 | 2017-03-10 | Automatic routing searching method for multiple cables |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106934151A CN106934151A (en) | 2017-07-07 |
| CN106934151B true CN106934151B (en) | 2020-08-21 |
Family
ID=59432128
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710141564.0A Active CN106934151B (en) | 2017-03-10 | 2017-03-10 | Automatic routing searching method for multiple cables |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106934151B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114611341B (en) * | 2022-05-11 | 2022-08-02 | 中移铁通有限公司广东分公司 | Automatic planning method, device, equipment and storage medium for optical cable routing |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011023815A (en) * | 2009-07-13 | 2011-02-03 | Nippon Telegr & Teleph Corp <Ntt> | Communication medium selection device, communication medium selection method, and recording medium recorded with communication medium selection program |
| CN102025529A (en) * | 2010-08-04 | 2011-04-20 | 华信邮电咨询设计研究院有限公司 | Traffic route selection method based on optimal-cost intelligent optical network system |
| CN102231647A (en) * | 2011-06-21 | 2011-11-02 | 中国电力科学研究院 | Fiber communication network service route configuration method used in electric power |
| CN103107941A (en) * | 2011-11-09 | 2013-05-15 | 中国移动通信集团设计院有限公司 | Optical cable resource automatic scheduling device and method |
| CN104202176A (en) * | 2014-07-15 | 2014-12-10 | 华信咨询设计研究院有限公司 | Computer automatic constructing method of optical network topology |
| CN105007222A (en) * | 2015-04-20 | 2015-10-28 | 中国电信股份有限公司 | Business transmission path selection method and business transmission path selection device |
-
2017
- 2017-03-10 CN CN201710141564.0A patent/CN106934151B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2011023815A (en) * | 2009-07-13 | 2011-02-03 | Nippon Telegr & Teleph Corp <Ntt> | Communication medium selection device, communication medium selection method, and recording medium recorded with communication medium selection program |
| CN102025529A (en) * | 2010-08-04 | 2011-04-20 | 华信邮电咨询设计研究院有限公司 | Traffic route selection method based on optimal-cost intelligent optical network system |
| CN102231647A (en) * | 2011-06-21 | 2011-11-02 | 中国电力科学研究院 | Fiber communication network service route configuration method used in electric power |
| CN103107941A (en) * | 2011-11-09 | 2013-05-15 | 中国移动通信集团设计院有限公司 | Optical cable resource automatic scheduling device and method |
| CN104202176A (en) * | 2014-07-15 | 2014-12-10 | 华信咨询设计研究院有限公司 | Computer automatic constructing method of optical network topology |
| CN105007222A (en) * | 2015-04-20 | 2015-10-28 | 中国电信股份有限公司 | Business transmission path selection method and business transmission path selection device |
Non-Patent Citations (2)
| Title |
|---|
| 传输网络光缆物理路由的规划;熊锦华; 杨旭; 梁雄健;《现代有线传输》;20050228;全文 * |
| 光网络中基于层次化PCE反向回溯路由算法;宋继恩;夏芸;赵永利;邢建超;黄善国;张杰;《光通信技术》;20121015;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106934151A (en) | 2017-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Hindi et al. | Design of low-voltage distribution networks: a mathematical programming method | |
| CN112749458B (en) | Cable path planning method, device, equipment and storage medium | |
| CN108965014B (en) | QoS-aware service chain backup method and system | |
| JP4619134B2 (en) | Plant cable wiring design support system | |
| CN112118176A (en) | A Service Reliability-Oriented Routing Load Optimization Method for Integrated Data Network Channels | |
| CN111064666B (en) | Networking method and device | |
| US8738332B2 (en) | System and process for client driven automated circuiting and branch circuit wiring | |
| CN113193996A (en) | Power optical transmission network optimization method, device, equipment and storage medium | |
| CN106934151B (en) | Automatic routing searching method for multiple cables | |
| CN106845031B (en) | Automatic distribution method for cable laying routes in cable network | |
| CN117176638A (en) | Routing path determining method and related components | |
| CN108551403B (en) | Transmission network planning method and system | |
| WO2017118431A1 (en) | Route selection method and apparatus | |
| CN107995109B (en) | Routing method and routing equipment | |
| CN110866739B (en) | A Representation Method for Comprehensive Outage Time of Distribution Network Considering Fault Diagnosis Path | |
| CN119004713A (en) | Data center optical fiber path planning method, system, storage medium and program product | |
| CN106685521A (en) | Method and apparatus of predicting resource margin early warning for optical communication network | |
| CN107248952B (en) | Method and system for determining service alternative route | |
| JP4829911B2 (en) | Network design apparatus, network design method, and network design system | |
| JP6006684B2 (en) | Flow path change calculation device | |
| WO2022137415A1 (en) | Wiring design system and wiring design method | |
| CN114301827A (en) | Method and apparatus for searching optical cable route | |
| CN115866455A (en) | Route planning method and device, computer equipment and storage medium | |
| JPH0746727A (en) | Cable detour route setting method | |
| CN118568099B (en) | A digital village information processing method and system |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |