PH12018500275A1 - Topological graph optimal path algorithm with constraint conditions - Google Patents

Topological graph optimal path algorithm with constraint conditions

Info

Publication number
PH12018500275A1
PH12018500275A1 PH12018500275A PH12018500275A PH12018500275A1 PH 12018500275 A1 PH12018500275 A1 PH 12018500275A1 PH 12018500275 A PH12018500275 A PH 12018500275A PH 12018500275 A PH12018500275 A PH 12018500275A PH 12018500275 A1 PH12018500275 A1 PH 12018500275A1
Authority
PH
Philippines
Prior art keywords
topological
constraint conditions
optimal path
path
nodes
Prior art date
Application number
PH12018500275A
Inventor
Shu Li
Hanfu Sun
Ping Wu
Original Assignee
Fiberhome Telecommunication Tech Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Fiberhome Telecommunication Tech Co Ltd filed Critical Fiberhome Telecommunication Tech Co Ltd
Publication of PH12018500275A1 publication Critical patent/PH12018500275A1/en

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: generating topological nodes with telecommunication devices and generating topological links with fibre connections, so as to form a topological matrix; selecting a source and a destination topological node; 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; establishing, according to the constraint conditions, a list of topological nodes and topological links to be avoided, and updating the topological matrix; 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], adding Nt, Ne, and L[t,e] to the overall path; otherwise, searching for the optimal path between Nt and Ne and adding same to the overall path; and if Ne is the destination topological node, then ending; otherwise, 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.
PH12018500275A 2015-09-16 2018-02-06 Topological graph optimal path algorithm with constraint conditions PH12018500275A1 (en)

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
PH12018500275A1 true PH12018500275A1 (en) 2018-08-13

Family

ID=54726737

Family Applications (1)

Application Number Title Priority Date Filing Date
PH12018500275A PH12018500275A1 (en) 2015-09-16 2018-02-06 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)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
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

Also Published As

Publication number Publication date
MY194954A (en) 2022-12-28
WO2017045578A1 (en) 2017-03-23
CN105141524A (en) 2015-12-09
CN105141524B (en) 2018-06-01

Similar Documents

Publication Publication Date Title
PH12018500275A1 (en) Topological graph optimal path algorithm with constraint conditions
WO2019101230A3 (en) Constructing blockchain world state merkle patricia trie subtree
CO2019001252A2 (en) Multi-issue code books with additional optimization of overhead
MX353113B (en) Distributed routing in wireless networks.
GB201209740D0 (en) Content centric and load-balancing aware dynamic data aggregation
MX346767B (en) A wireless device, network nodes and methods therein for handling a device-to-device (d2d) communication during handover in a wireless telecommunications network.
EP2773005A3 (en) Method for Optimizing a Power Flow in an Electric Power Network
ATE485657T1 (en) DYNAMIC ROUTING OF OPTICAL SIGNALS IN OPTICAL NETWORKS
AR077779A1 (en) METHOD AND SYSTEM FOR MONITORING A CABLE SYSTEM OF AN ELECTRICAL ENERGY TRANSMISSION SYSTEM
MX2009005534A (en) Path management for enhanced protection.
MX2019003653A (en) Methods and nodes for cell selection in a wireless communication network.
WO2014037872A3 (en) Guideline-based decision support
PH12018501086A1 (en) Efficient lsp protection method based on rsvp-te dynamic tunnel
GB201111955D0 (en) Framework for ubiquitous networking
GB201203418D0 (en) Method for routing in a network, routing system, and transport system
TW201613387A (en) Method and device for configuring operation mode of data forwarding device
MX2015010648A (en) Method of laundering a fabric.
MX2015016846A (en) Welding system data management system and method.
MX2012001593A (en) Mesh infrastructure utilizing priority repeaters and multiple transceivers.
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
HUE046146T2 (en) Pitch-based ultrafine carbon fibers, method for producing same, non-aqueous electrolyte secondary battery negative electrode using said pitch-based ultrafine carbon fibers, and non-aqueous electrolyte secondary battery having said non-aqueous electrol...
AR105706A1 (en) METHODS THAT INCLUDE COMMUNICATION OF WIRELESS ACCESS POINTS AND RELATED NODES
WO2015018465A3 (en) Method, system and controlling means for load balancing between local nodes
ATE544272T1 (en) MANAGING ROUTING TOPOLOGY IN A NETWORK
WO2011144079A3 (en) Method and apparatus for generating distribution trees, and routing bridge