MY194954A - Topological graph optimal path algorithm with constraint conditions - Google Patents
Topological graph optimal path algorithm with constraint conditionsInfo
- Publication number
- MY194954A MY194954A MYPI2018700200A MYPI2018700200A MY194954A MY 194954 A MY194954 A MY 194954A MY PI2018700200 A MYPI2018700200 A MY PI2018700200A MY PI2018700200 A MYPI2018700200 A MY PI2018700200A MY 194954 A MY194954 A MY 194954A
- Authority
- MY
- Malaysia
- Prior art keywords
- topological
- constraint conditions
- optimal path
- path
- nodes
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
Disclosed is a topological graph optimal path algorithm with constraint conditions, comprising: (S10) Generating topological nodes with telecommunication devices and generating topological links with fiber connections, so as to form a topological matrix; (S20) selecting a source and a destination topological node; (S30) establishing, according to the constraint conditions, a list of topological nodes and topological links, which must be passed through, converting the topological links, which must be passed through, into topological nodes, which must be passed through, and adding same to the list of topological nodes which must be passed through; (S40) establishing, according to the constraint conditions, a list of topological nodes and topological links to be avoided, and updating the topological matrix; (S50) setting a start and an end topological node during the current path-searching to be Nt and Ne; when Nt is connected with the topological link L<t?e>, (S60) adding Nt, Ne, and L<t?e> to the overall path; otherwise, (S70) searching for the optimal path between Nt and Ne and adding same to the overall path; and (S80) if Ne is the destination topological node, then ending; otherwise, (S90) updating the topological matrix according to the optimal path between Nt and Ne, and starting the next iteration. The present invention realizes searching for the optimal path under constraint conditions, and improves the path-searching efficiency in the case of a large source topological node degree by improving the Dijkstra algorithm. (Fig. 1)
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510589652.8A CN105141524B (en) | 2015-09-16 | 2015-09-16 | A kind of topological diagram optimal path algorithm of Problem with Some Constrained Conditions |
PCT/CN2016/098777 WO2017045578A1 (en) | 2015-09-16 | 2016-09-13 | Topological graph optimal path algorithm with constraint conditions |
Publications (1)
Publication Number | Publication Date |
---|---|
MY194954A true MY194954A (en) | 2022-12-28 |
Family
ID=54726737
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
MYPI2018700200A MY194954A (en) | 2015-09-16 | 2016-09-13 | Topological graph optimal path algorithm with constraint conditions |
Country Status (4)
Country | Link |
---|---|
CN (1) | CN105141524B (en) |
MY (1) | MY194954A (en) |
PH (1) | PH12018500275A1 (en) |
WO (1) | WO2017045578A1 (en) |
Families Citing this family (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN105141524B (en) * | 2015-09-16 | 2018-06-01 | 武汉烽火技术服务有限公司 | A kind of topological diagram optimal path algorithm of Problem with Some Constrained Conditions |
CN109412954A (en) * | 2017-08-18 | 2019-03-01 | 中国电信股份有限公司 | Route determining methods, device and storage medium based on unordered joint constraint |
CN108680163B (en) * | 2018-04-25 | 2022-03-01 | 武汉理工大学 | Unmanned ship path searching system and method based on topological map |
CN109195192B (en) * | 2018-08-16 | 2022-04-01 | 全球能源互联网研究院有限公司 | Energy balance scheduling method, device and system for wireless sensor network and storage medium |
CN109238296B (en) * | 2018-08-16 | 2022-03-22 | 佛山科学技术学院 | High-precision indoor navigation method and device |
CN109361604A (en) * | 2018-12-18 | 2019-02-19 | 北京格林威尔科技发展有限公司 | The most short service path of Dominator and link determines method and apparatus in IPRAN or PTN |
CN111865627B (en) * | 2019-04-25 | 2023-07-25 | 中国移动通信集团河北有限公司 | Transmission networking evaluation method, device, computing equipment and computer storage medium |
CN111787436A (en) * | 2020-07-02 | 2020-10-16 | 中国电子科技集团公司第三十四研究所 | Method for automatic searching and planning of optical network communication path |
CN112115567B (en) * | 2020-08-01 | 2024-04-16 | 富盛科技股份有限公司 | Optical fiber minimum consumption path planning method |
CN112511230B (en) * | 2020-11-20 | 2022-07-12 | 国网浙江省电力有限公司宁波供电公司 | Optimal optical fiber path selection method and device |
CN113297822A (en) * | 2021-04-26 | 2021-08-24 | 阳光新能源开发有限公司 | Photovoltaic power station current collection circuit determination method and device and storage medium |
CN114928569B (en) * | 2022-04-28 | 2023-06-09 | 烽火通信科技股份有限公司 | Shortest path implementation method and system containing multiple necessary resources |
CN115242702B (en) * | 2022-09-22 | 2022-12-13 | 广州优刻谷科技有限公司 | Internet of things node optimal path planning method and system |
Family Cites Families (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6377551B1 (en) * | 1998-08-17 | 2002-04-23 | Nortel Networks Limited | QoS based route determination method for communications networks |
US6542469B1 (en) * | 1998-12-10 | 2003-04-01 | Sprint Communications Company, L.P. | Communications network system and method for routing based on disjoint pairs of path |
US6996065B2 (en) * | 2000-07-06 | 2006-02-07 | Lucent Technologies Inc. | Dynamic backup routing of network tunnel paths for local restoration in a packet network |
CN100387026C (en) * | 2004-12-24 | 2008-05-07 | 华为技术有限公司 | Method for searching connected routes with target node set of pointed service routes |
CN100490352C (en) * | 2007-01-10 | 2009-05-20 | 北京航空航天大学 | Route device and method for raising service quality of space information network |
CN101459468B (en) * | 2007-12-10 | 2012-06-06 | 华为技术有限公司 | Optical layer wavelength end-to-end scheduling method and apparatus |
CN101888572B (en) * | 2009-05-11 | 2014-08-13 | 中兴通讯股份有限公司 | Realization method and system of alternative route of WSON optical transport network |
CN101621721A (en) * | 2009-08-06 | 2010-01-06 | 中兴通讯股份有限公司 | K-shortest path computing method and device |
CN101788999A (en) * | 2009-12-30 | 2010-07-28 | 安徽大学 | Binary chop tracking method of shortest paths in network map |
CN103051533B (en) * | 2011-10-11 | 2017-09-12 | 中兴通讯股份有限公司 | A kind of band protects the route computing method and device of business |
US9083484B2 (en) * | 2012-02-13 | 2015-07-14 | Ciena Corporation | Software defined networking photonic routing systems and methods |
CN103248571A (en) * | 2013-05-16 | 2013-08-14 | 湖北邮电规划设计有限公司 | Computing method of optimal second route |
CN104468356B (en) * | 2014-12-05 | 2018-08-24 | 东阳市阳涛电子科技有限公司 | A kind of message forwarding method of more destination nodes |
CN105141524B (en) * | 2015-09-16 | 2018-06-01 | 武汉烽火技术服务有限公司 | A kind of topological diagram optimal path algorithm of Problem with Some Constrained Conditions |
-
2015
- 2015-09-16 CN CN201510589652.8A patent/CN105141524B/en active Active
-
2016
- 2016-09-13 MY MYPI2018700200A patent/MY194954A/en unknown
- 2016-09-13 WO PCT/CN2016/098777 patent/WO2017045578A1/en active Application Filing
-
2018
- 2018-02-06 PH PH12018500275A patent/PH12018500275A1/en unknown
Also Published As
Publication number | Publication date |
---|---|
PH12018500275A1 (en) | 2018-08-13 |
CN105141524A (en) | 2015-12-09 |
CN105141524B (en) | 2018-06-01 |
WO2017045578A1 (en) | 2017-03-23 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
MY194954A (en) | Topological graph optimal path algorithm with constraint conditions | |
DK1935145T3 (en) | Process for generating voltage trees | |
ATE485657T1 (en) | DYNAMIC ROUTING OF OPTICAL SIGNALS IN OPTICAL NETWORKS | |
AR109954A1 (en) | METHODS, COMMUNICATION DEVICES AND NETWORK NODES TO IMPROVE COMMUNICATION IN A WIRELESS COMMUNICATION NETWORK | |
RU2012138150A (en) | COMMUNICATION SYSTEM, CONTROL DEVICE, COMMUNICATION METHOD AND PROGRAM | |
GB201209740D0 (en) | Content centric and load-balancing aware dynamic data aggregation | |
PH12015502475A1 (en) | A wireless device, network nodes and methods therein for handling a device-to-device (d2d) communication during handover in a wireless telecommunications network | |
IN2012DE01073A (en) | ||
MX2016006783A (en) | Distributed routing in wireless networks. | |
MX2009005534A (en) | Path management for enhanced protection. | |
MX2016009107A (en) | Methods and network nodes for radio link failure, rlf, reporting using a rlf indicaton procedure in an evolved node b, enb. | |
PH12018501086A1 (en) | Efficient lsp protection method based on rsvp-te dynamic tunnel | |
AR114118A1 (en) | METHODS AND USER EQUIPMENT TO RESUME A CONNECTION WITH FULL CONFIGURATION | |
WO2008124736A3 (en) | Probing network nodes for optimization | |
WO2015097552A3 (en) | A method for configuring a network comprising several nodes, a method for transmitting data in said network, and corresponding equipment and computer program | |
MX2015016846A (en) | Welding system data management system and method. | |
EP3041170B1 (en) | Network planning method and device | |
CN101909004B (en) | Multi-domain optical network routing method based on edge ROADM (Reconfigurable Optical Add-Drop Multiplexer) ring structure | |
Clad et al. | Graceful router updates in link-state protocols | |
AR105706A1 (en) | METHODS THAT INCLUDE COMMUNICATION OF WIRELESS ACCESS POINTS AND RELATED NODES | |
CN111277494B (en) | Message transmission method and device | |
Paolucci et al. | Experimenting hierarchical PCE architecture in a distributed multi-platform control plane testbed | |
CN108429688B (en) | Single-node fault route protection method based on segment route | |
JP2012217112A (en) | Reliability enhancement in tree-shaped topology network | |
CN107040467B (en) | Searching algorithm for complex network topology center node |