WO2022052986A1 - 路径搜索的方法、电子设备及存储介质 - Google Patents

路径搜索的方法、电子设备及存储介质 Download PDF

Info

Publication number
WO2022052986A1
WO2022052986A1 PCT/CN2021/117429 CN2021117429W WO2022052986A1 WO 2022052986 A1 WO2022052986 A1 WO 2022052986A1 CN 2021117429 W CN2021117429 W CN 2021117429W WO 2022052986 A1 WO2022052986 A1 WO 2022052986A1
Authority
WO
WIPO (PCT)
Prior art keywords
path
node
network structure
structure diagram
target
Prior art date
Application number
PCT/CN2021/117429
Other languages
English (en)
French (fr)
Inventor
冯斌
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2022052986A1 publication Critical patent/WO2022052986A1/zh

Links

Images

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
    • 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"
    • 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
    • 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
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2111/00—Details relating to CAD techniques
    • G06F2111/04—Constraint-based CAD

Definitions

  • the embodiments of the present application relate to the field of computers, and in particular, to a path searching method, an electronic device, and a storage medium.
  • the complexity of the network has increased sharply, the structure of the network has become more and more complex, and the path search has become more and more complicated.
  • the searched path needs to ensure not only the transmission of local services, but also the transmission of all network services.
  • the increase of special requirements such as the increase of constraints, all lead to the difficulty of path search.
  • the search characteristic of Distesla's algorithm is to expand outward from the starting point until it reaches the end point.
  • the searched paths returned by the Distesla algorithm may not meet other constraints, such as not including specific nodes; the paths returned one by one may be concentrated in an invalid direction, resulting in repeated invalid searches and reducing the path search rate. search efficiency and accuracy.
  • An embodiment of the present application provides a path search method, including: constructing a first network structure diagram according to network information of a network to be searched; acquiring a guide node of the first network structure diagram; generating a guide path according to the guide node, and the guide path It is used to indicate the direction of the path search; according to the guide path, the target path of the first network structure diagram is generated.
  • Embodiments of the present application further provide an electronic device, including: at least one processor; and,
  • a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to A method to perform the above path search.
  • Embodiments of the present application further provide a computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, the above-mentioned path search method is implemented.
  • FIG. 1 is a flowchart of a method for path search provided according to the first embodiment of the present application
  • FIG. 2 is a flowchart of a method for path search provided in a second embodiment of the present application
  • FIG. 3 is a schematic diagram of a first network structure diagram in a method for path search provided in a second embodiment of the present application;
  • FIG. 4 is a structural block diagram of a network to be searched provided according to the second embodiment of the present application.
  • FIG. 5 is a flowchart of a method for path search provided in a third embodiment of the present application.
  • FIG. 6 is a structural block diagram of an electronic device provided according to a fourth embodiment of the present application.
  • the first embodiment of the present application relates to a method for path search, and its process is shown in Figure 1:
  • Step 101 Build a first network structure diagram according to the network information of the network to be searched.
  • Step 102 Obtain a bootstrap node of the first network structure diagram.
  • Step 103 Generate a guide path according to the guide node, and the guide path is used to indicate the direction of the path search.
  • Step 104 Generate a target path of the first network structure diagram according to the guide path.
  • the path search method proposed in the present application constructs a first network structure diagram according to the network information of the network to be searched, and generates a guide path by setting a guide node.
  • the guide path can indicate the direction of the path search, thereby correcting the path search. direction, reduce repeated searches in invalid directions, and improve the accuracy of search; at the same time, because there is no need to repeat searches in invalid directions, the speed of search is improved, thereby improving the efficiency of search and reducing the waste of search resources.
  • the second embodiment of the present application relates to a path search method, which is applied to an electronic device, such as a server, or deployed on a server.
  • the second embodiment is an example of steps 101-104 in the first embodiment, and the process is shown in Figure 2:
  • Step 201 Build a first network structure diagram according to the network information of the network to be searched.
  • the network to be searched may be a data transmission network in practical applications, or may be a scheduling network or the like.
  • a transmission network is taken as an example to introduce the method of searching for the path.
  • Obtain the site information of each site in the network to be searched and the connection information of each site take each site as a node, and use each site information as the node information of the corresponding node; take the connection information between each site as the connection information of each node.
  • the site information may include transmission rate, bandwidth, location information, and so on.
  • the first network structure graph is formed according to the nodes, node information and edges.
  • Step 202 Obtain a bootstrap node of the first network structure diagram.
  • a bootstrap node for example, a randomly obtained node is used as a bootstrap node; or, a node corresponding to a specified label is obtained as a bootstrap node.
  • a node may be randomly selected from the first network structure diagram as a bootstrap node. It can also be to obtain the bootstrap node specified by the user.
  • the node information also includes the label information of the node, and the label information is used to indicate the attributes of the node.
  • the label information A can be used to indicate that the node corresponding to the label information A is a regular node, and the label information B can indicate the label information B.
  • the corresponding node is a must-pass node; the specified label may be label information used to indicate that the node belongs to the must-pass node.
  • a pre-specified geographic area may also be acquired, a node within the specified geographic area may be searched, and a node within the specified geographic area may be arbitrarily selected as a bootstrap node. For example, if the specified area is X, then a node can be randomly selected as a guide node in the X area.
  • the specified direction can also be obtained, and the node belonging to the specified direction can be randomly obtained as the guide node.
  • a node directly connected to the starting node can also be obtained as a directly connected node; a bootstrap node is obtained from a node other than the directly connected node.
  • the nodes directly connected to the starting node are obtained as directly connected nodes.
  • the starting node is node A
  • the nodes directly connected to node A are node B, node C, and node D
  • the remaining nodes are node E and node F
  • one node from node E and node F can be selected as the guiding node.
  • the selection method can be the above-mentioned random selection method, or can be obtained according to a specified label.
  • Step 203 Obtain the start node and the target node of the path search.
  • the starting node and target node of the path search can be determined according to the received search task, and the search task can be sent by other terminals or the current network.
  • Step 204 Search for the first path from the start node to the bootstrap node, and search for the second path from the target node to the bootstrap node.
  • Dijkstra's algorithm may be employed to search for a first path from the start node to the lead node, and search for a second path from the target node to the lead node.
  • the starting node is denoted as np
  • the target node is denoted as nq
  • the guide node is denoted as nk; then in the first network structure diagram, Dijkstra's algorithm is used to search for all paths from np to nk, which can be The searched path is used as the first path.
  • Dijkstra's algorithm is used to search all paths from nq to nk in the first network structure diagram, and the searched path can be used as the second path.
  • the first path may include one path from the start node to the guide node, or may include more than two paths from the start node to the guide node, and the second path may include one path
  • the path from the target node to the bootstrap node may also include two or more paths from the target node to the bootstrap node.
  • Step 205 Acquire a guide path from the first path and the second path according to the preset policy.
  • the preset strategy includes: selecting a path with the smallest number of nodes. For example, if the preset strategy is to select the path with the least number of nodes in the path; the starting node is denoted as np, the target node is denoted as nq, and the guide node is denoted as nk; the first path includes p1, p2 and p3; the second path includes p4, p5 and p6; according to the preset strategy, the path with the least number of nodes can be selected from the first path, denoted as P1, and the path with the least number of nodes can be selected from the second path, denoted as P2; then from P1 and In P2, the path with the least number of nodes is selected as the guiding path and denoted as Pk.
  • the path with the smallest number of nodes can be directly selected from p1, p2, p3, p4, p5 and p6 as the guiding path.
  • the preset strategy includes choosing the path with the shortest path. For example, if the preset strategy is to select the path with the shortest path; the starting node is denoted as np, the target node is denoted as nq, and the guide node is denoted as nk; the first path includes p1, p2 and p3; the second path includes p4, p5 and p6; according to the preset strategy, select the shortest path from the first path, denoted as P1, and select the shortest path from the second path, denoted as P2; then select the number of nodes from P1 and P2 The least path is used as the guide path, denoted as Pk.
  • the path with the shortest path can be directly selected from p1, p2, p3, p4, p5 and p6 as the guiding path.
  • Step 206 Acquire nodes other than the bootstrap node in the bootstrap path as filter nodes.
  • each node in the bootstrap node is obtained, and the nodes other than the bootstrap node are used as filter nodes.
  • the nodes included in the guide path Pk are respectively np, n1, n2, n3 and nk, where the guide node is nk, then np, n1, n2 and n3 are all used as filter nodes.
  • Step 207 Delete the filter node from the first network structure diagram to generate a second network structure diagram.
  • the filter node may be deleted from the first network structure diagram to generate the second network structure diagram.
  • Step 208 Obtain a third path from the bootstrap node to the sink node in the second network structure diagram, where the sink node is the target node or the start node.
  • the sink node if the bootstrap path is the path from the start node to the bootstrap node, the sink node is determined to be the target node; if the bootstrap path is the path from the target node to the bootstrap node, the sink node is determined is the starting node.
  • Dijkstra's algorithm is used to search for the third path from the guide node to the sink node. It can be understood that other search algorithms may also be used to obtain the third path in the second network structure diagram.
  • Step 209 splicing the guide path and the third path to form the target path of the first network structure diagram.
  • the guide path and the third path are spliced, and the spliced path is used as the target path in the first network structure diagram.
  • the traditional Dijkstra algorithm search path is easy to search infinitely in one direction, and within a certain number of paths, it is impossible to return a path that satisfies specific constraints.
  • the search direction can be quickly determined, avoiding invalid directions. How many times to search, so that the effective path that satisfies the special constraint can be quickly searched, and the efficiency of the path search is improved.
  • the second network structure diagram is regenerated according to the guide path, and the second network structure diagram is searched.
  • the guide path and the third path make the path search not only reduce the search of invalid paths but also combine the advantages of Dijkstra's algorithm, so that the target path can be obtained quickly.
  • FIG. 4 the structure of the network design and planning system is shown in Figure 4, including: engineering module, network module, business module, design module, planning module, configuration module and report module.
  • the engineering module is used to complete the creation of the network and generate the basic engineering network.
  • the basic engineering network includes sites and optical fibers, and supports the import and export of network engineering;
  • the network module is used to complete the basic configuration of the network, such as site device type configuration; It is used to complete functions such as service creation, import and export in the network;
  • the design module is used to complete the network transmission link design;
  • the planning module is used to complete the service transmission path and required resource planning in the network;
  • the configuration module is used to generate the service planning in the network.
  • the resource configuration statistics are calculated;
  • the report module is used to output the network planning and configured resources in the form of reports.
  • the path searching method in this example can be applied to the planning module in the network design and planning system to search for a data transmission path, so as to plan a reasonable data transmission path.
  • the third embodiment of the present application relates to a path search method.
  • the third embodiment of the present application is an improvement to the second embodiment.
  • the main improvement lies in that the first network structure is formed by splicing the guiding path and the third path. Before the target path of the graph, it also includes judging whether the third path satisfies the constraint condition.
  • the flow of the third embodiment is shown in Figure 5:
  • Step 301 Build a first network structure diagram according to the network information of the network to be searched.
  • Step 302 Obtain a bootstrap node of the first network structure diagram.
  • Step 303 Obtain the start node and the target node of the path search.
  • Step 304 Search for the first path from the start node to the bootstrap node, and search for the second path from the target node to the bootstrap node.
  • Step 305 According to a preset strategy, obtain a guide path from the first path and the second path.
  • Step 306 Obtain nodes other than the bootstrap node in the bootstrap path as filtering nodes.
  • Step 307 Delete the filter node from the first network structure diagram to generate a second network structure diagram.
  • Step 308 Obtain a third path from the bootstrap node to the sink node in the second network structure diagram, where the sink node is the target node or the start node.
  • Steps 301 to 308 are substantially the same as steps 201 to 208 in the second embodiment, and will not be repeated here.
  • Step 309 Determine whether the third path satisfies the preset constraint conditions, if the judgment result indicates that the third path satisfies the constraint condition, go to step 310;
  • preset constraints are obtained, for example, each must-pass node, etc. If the third path does not satisfy the preset constraint condition, it indicates that the guide path does not play a role in correcting the search path, and the process may return to step 302 to obtain the guide node again.
  • the preset constraint condition may be updated. Since the guiding path has been determined, the constraint condition that the guiding path has satisfied can be deleted from the preset constraint conditions, and the preset constraint condition can be updated; that is, when searching for a path in the second network structure diagram, a new Constraints for path search.
  • the preset constraint condition includes: passing through node A and node B, and if node A has already passed through the guidance path, the updated constraint condition includes: passing through node B.
  • step 310 is executed.
  • Step 310 Splicing the guide path and the third path to form the target path of the first network structure diagram.
  • Step 311 It is detected that the target path is a path from the target node to the starting node, and the direction of the target path is reversed, so that the target path is a path from the starting node to the target node.
  • the target path can be reversed, so that the target path is from the starting node to the target The path of the node.
  • the third path is verified, so as to ensure the validity of the third path. If the third path does not meet the preset constraints, the surface The guide path does not play a role in correcting the search direction, and the accuracy of the path search can be improved by re-acquiring the guide node until the accurate guide node is obtained.
  • the fourth embodiment of the present application relates to an electronic device, the structural block diagram of which is shown in FIG. 6 , the electronic device includes: at least one processor 401 ; and a memory 402 communicatively connected to the at least one processor 401 ; wherein, the memory 402 Instructions executable by the at least one processor 401 are stored, and the instructions are executed by the at least one processor 401 to enable the at least one processor 401 to perform the above-described method of path searching.
  • the memory and the processor are connected by a bus, and the bus may include any number of interconnected buses and bridges, and the bus links one or more processors and various circuits of the memory together.
  • the bus may also link together various other circuits such as peripherals, voltage regulators and power management circuits, etc., which are well known in the art and therefore will not be further described herein.
  • the bus interface provides the interface between the bus and the transceiver.
  • a transceiver may be a single element or multiple elements, such as multiple receivers and transmitters, providing a means for communicating with various other devices over a transmission medium.
  • the data processed by the processor is transmitted over the wireless medium through the antenna, which in some embodiments also receives the data and transmits the data to the processor.
  • the processor is responsible for managing the bus and general processing, and can also provide various functions, including timing, peripheral interface, voltage regulation, power management, and other control functions. Instead, memory may be used to store data used by the processor in performing operations.
  • the fifth embodiment of the present application relates to a computer-readable storage medium storing a computer program, and when the computer program is executed by a processor, the above-mentioned method for locating a fault is implemented.
  • the program is stored in a storage medium and includes several instructions to make a device (which may be a single-chip microcomputer) , chip, etc.) or a processor (processor) to execute all or part of the steps of the methods described in the various embodiments of the present application.
  • the aforementioned storage medium includes: U disk, mobile hard disk, Read-Only Memory (ROM, Read-Only Memory), Random Access Memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes .

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Geometry (AREA)
  • Marketing (AREA)
  • Mathematical Optimization (AREA)
  • Operations Research (AREA)
  • Evolutionary Computation (AREA)
  • Development Economics (AREA)
  • Computer Hardware Design (AREA)
  • Game Theory and Decision Science (AREA)
  • Pure & Applied Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Mathematical Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Computational Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

提供了一种路径搜索的方法、电子设备及存储介质。方法包括：根据待搜索网络的网络信息，构建第一网络结构图（101）；获取第一网络结构图的引导节点（102）；根据引导节点，生成引导路径（103），引导路径用于指示路径搜索的方向；根据引导路径，生成所述第一网络结构图的目标路径（104）。

Description

路径搜索的方法、电子设备及存储介质
交叉引用
本申请基于申请号为“202010943576.7”、申请日为2020年09月09日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此以引入方式并入本申请。
技术领域
本申请实施例涉及计算机领域，特别涉及一种路径搜索的方法、电子设备及存储介质。
背景技术
随着网络技术的发展，尤其是5G技术的到来，网络的复杂度剧增，网络的结构越来越复杂，路径搜索也越来越复杂。例如，在网络业务传输中，搜索到的路径不仅需要保证局部业务的可传输，还要保证网络所有业务的可传输。随着网络业务量的增大，特殊需求增加，如必经约束的增加等，都导致了路径搜索的难度。目前使用迪斯特斯拉算法为所有业务找到可传输路径。迪斯特斯拉算法的搜索特点是以起始点为中心向外扩展，直到扩展到终点为止。
然而，迪斯特斯拉算法返回搜索到的路径可能不符合其他约束条件，如未包括特定节点等；逐条返回的路径可能集中在某个无效的方向，导致重复进行无效搜索，降低了路径搜索的搜索效率和准确性。
发明内容
本申请实施例提供了一种路径搜索的方法，包括：根据待搜索网络的网络信息，构建第一网络结构图；获取第一网络结构图的引导节点；根据引导节点，生成引导路径，引导路径用于指示路径搜索的方向；根据引导路径，生成第一 网络结构图的目标路径。
本申请实施例还提供了一种电子设备，包括：至少一个处理器；以及，
与所述至少一个处理器通信连接的存储器；其中，存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行上述的路径搜索的方法。
本申请实施例还提供了一种计算机可读存储介质，存储有计算机程序，计算机程序被处理器执行时实现上述的路径搜索的方法。
附图说明
图1是根据本申请第一实施例中提供的路径搜索的方法的流程图；
图2是根据本申请第二实施例中提供的路径搜索的方法的流程图；
图3是根据本申请第二实施例中提供的路径搜索的方法中一种第一网络结构图的示意图；
图4是根据本申请第二实施例中提供的待搜索网络的结构框图；
图5是根据本申请第三实施例中提供的路径搜索的方法的流程图；
图6是根据本申请第四实施例中提供的电子设备的结构框图。
具体实施方式
为使本申请实施例的目的、技术方案和优点更加清楚，下面将结合附图对本申请的各实施例进行详细的阐述。然而，本领域的普通技术人员可以理解，在本申请各实施例中，为了使读者更好地理解本申请而提出了许多技术细节。但是，即使没有这些技术细节和基于以下各实施例的种种变化和修改，也可以实现本申请所要求保护的技术方案。以下各个实施例的划分是为了描述方便，不应对本申请的实现方式构成任何限定，各个实施例在不矛盾的前提下可以相互结合相互引用。
本申请的第一实施方式涉及一种路径搜索的方法，其流程如图1所示：
步骤101：根据待搜索网络的网络信息，构建第一网络结构图。
步骤102：获取第一网络结构图的引导节点。
步骤103：根据引导节点，生成引导路径，引导路径用于指示路径搜索的 方向。
步骤104：根据引导路径，生成第一网络结构图的目标路径。
本申请提出的路径搜索的方法，根据待搜索网络的网络信息，构建第一网络结构图，通过设定引导节点，生成引导路径，该引导路径可以指示路径搜索的方向，从而可以矫正路径搜索的方向，减少在无效方向上的重复搜索，提升了搜索的准确度；同时由于无需重复在无效方向的搜索，提升搜索的速度，进而提高搜索的效率，减少搜索资源的浪费。
本申请的第二实施方式涉及一种路径搜索的方法，该路径搜索的方法应用于电子设备，如，服务器等，或者部署于服务端。第二实施例是对第一实施例中的步骤101-104的举例说明，其流程如图2所示：
步骤201：根据待搜索网络的网络信息，构建第一网络结构图。
在一些例子中，待搜索网络可以是实际应用中的数据传输网络，还可以是调度网络等等。本申请中以传输网络为例介绍该路径搜索的方法。获取该待搜索网络中每个站点的站点信息和各站点的连接信息，将每个站点作为节点，将每个站点信息作为对应节点的节点信息；将各站点之间的连接信息作为各个节点之间的边，站点信息可以包括，传输速率、带宽、位置信息等。根据节点、节点信息以及边，组成该第一网络结构图。
步骤202：获取第一网络结构图的引导节点。
获取引导节点的方式有多种，例如，将随机获取的节点作为引导节点；或者，获取指定标签对应的节点作为引导节点。
在一些例子中，可以随机从该第一网络结构图中选取一个节点作为引导节点。也可以是获取用户指定的引导节点。节点信息中还包括，节点的标签信息，标签信息用于指示该节点的属性，例如，标签信息A可以用于表示该标签信息A对应的节点为常规节点、标签信息B可以表示该标签信息B对应节点为必经节点；指定标签可以是用于指示节点属于必经节点的标签信息。
在另一个例子中，还可以获取预先指定的地理区域，查找该指定的地理区域内的节点，该指定的地理区域内任意选取一个节点作为引导节点。例如，若指定区域为X，那么可以在该X区域内随机选取节点作为引导节点。
还可以获取指定方向，可以随机获取属于指定方向上节点作为引导节点。
在另一个例子中，还可以获取与起始节点直连的节点作为直连节点；从除直连节点之外的节点中获取引导节点。
在一些例子中，获取与起始节点直连的节点作为直连节点，例如，如图3所示，起始节点为A节点，与A节点直连的节点为B节点、C节点和D节点，那么将B节点、C节点和D节点作为直连节点，剩余的节点为E节点和F节点，那么E节点和F节点中可以选取一个节点作为引导节点。选取的方式，可以采用上述的随机选取的方式，也可以根据指定标签获取。
步骤203：获取路径搜索的起始节点以及目标节点。
路径搜索的起始节点和目标节点可以根据接收到的搜索任务确定，搜索任务可以由其他终端或当前网络发送。
步骤204：搜索从起始节点到引导节点之间的第一路径，以及搜索从目标节点到引导节点之间的第二路径。
在一些例子中，可以采用迪杰斯特拉算法搜索从起始节点到引导节点之间的第一路径，以及搜索从目标节点到引导节点之间的第二路径。例如，将起始节点记作np，目标节点记作nq,引导节点记作nk；那么在该第一网络结构图中采用迪杰斯特拉算法搜索从np到nk之间的所有路径，可以将搜索到的路径作为第一路径，同理，在该第一网络结构图中采用迪杰斯特拉算法搜索从nq到nk之间的所有路径，可以将搜索到的路径作为第二路径。也就是说，本示例中，第一路径中可以包括1条从起始节点到引导节点的路径，也可以包括2条以上的从起始节点到引导节点的路径，第二路径中包括1条从目标节点到引导节点的路径，也可以包括2条以上从目标节点到引导节点的路径。
步骤205：根据预设策略，从第一路径和第二路径中获取引导路径。
在一个例子中，预设策略包括：选取节点数目最少的路径。例如，若预设策略为选取路径中节点数目最少的路径；将起始节点记作np，目标节点记作nq,引导节点记作nk；第一路径包括p1、p2和p3；第二路径包括p4、p5和p6；可以根据该预设策略分别从第一路径中选取节点数目最少的路径，记为P1，以及从第二路径中选取节点数目最少的路径，记为P2；再从P1和P2中选取节点数目最少的路径作为引导路径记为Pk。当然，可以直接从p1、p2、p3、p4、p5和p6中选出节点数目最少的路径作为引导路径。
另一个例子，预设策略包括选取路径最短的路径。例如，若预设策略为选取路径最短的路径；将起始节点记作np，目标节点记作nq,引导节点记作nk；第一路径包括p1、p2和p3；第二路径包括p4、p5和p6；可以根据该预设策略分别从第一路径中选取路径最短的路径，记为P1，以及从第二路径中选取路径最短的路径，记为P2；再从P1和P2中选取节点数目最少的路径作为引导路径，记为Pk。当然，可以直接从p1、p2、p3、p4、p5和p6中选选取路径最短的路径作为引导路径。
步骤206：获取引导路径中除引导节点之外的节点作为过滤节点。
在一些例子中，获取引导节点中各个节点，将除引导节点之外的节点作为过滤节点。例如，引导路径Pk包括的节点分别为np、n1、n2、n3和nk，其中，引导节点为nk,那么将np、n1、n2和n3均作为过滤节点。
步骤207：从第一网络结构图中删除过滤节点，生成第二网络结构图。
在一些例子中，可以从第一网络结构图中删除过滤节点，生成第二网络结构图。
步骤208：获取第二网络结构图中从引导节点到宿节点之间的第三路径，宿节点为目标节点或起始节点。
在一些例子中，若引导路径为从起始节点到引导节点之间的路径，则确定该宿节点为目标节点；若引导路径为从目标节点到引导节点之间的路径，则确定该宿节点为该起始节点。采用迪杰斯特拉算法搜索从引导节点到宿节点之间的第三路径，可以理解的是，获取第二网络结构图中的第三路径还可以采用其他搜索算法。
步骤209：拼接引导路径和第三路径，形成第一网络结构图的目标路径。
在一些例子中，拼接该引导路径和第三路径，将拼接后的路径作为该第一网络结构图中的目标路径。
传统的迪杰斯特拉算法搜索路径容易在一个方向进行无限搜索，在一定路径数量范围内无法返回满足特定约束条件的路径，通过引导节点，使得可以快速确定搜索方向，避免在无效方向上进行多少次搜索，使的可以快速搜索到满足特殊约束的有效路径，提高了路径搜索的效率。同时，本示例中，根据引导路径重新生成第二网络结构图，对该第二网络结构图进行搜索，本示例中该第 二网络结构图采用传统迪杰斯特拉生成第三路径，通过拼接引导路径和第三路径，使得路径搜索即可以减少无效路径的搜索又结合了迪杰斯特拉算法的优势，进而可以快速得到目标路径。
本示例中，为了便于对路径搜索的应用场景的理解，下面举例介绍一个的应用场景。例如，网络设计和规划系统的结构如图4所示，包括：工程模块，网络模块，业务模块，设计模块，规划模块，配模块置和报表模块。工程模块用于完成网络的创建，生成基础工程网络，基础工程网络中包含站点和光纤，支持网络工程的导入导出；网络模块用于完成网络的基础配置，如站点设备类型配置等；业务模块用于完成网络中业务的创建，导入导出等功能；设计模块用于完成网络传输链路设计；规划模块用于完成网络中业务传输路径和所需资源规划；配置模块用于将网络中业务规划产生的资源配置统计出来；报表模块用于将网络规划和配置出的资源以报表的形式输出。本示例中的路径搜索的方法可以应用于该网络设计和规划系统中的规划模块，用于搜索数据传输的路径，从而规划出合理的数据传输路径。
本申请的第三实施方式涉及一种路径搜索的方法，本申请第三实施例是对第二实施例的改进，主要改进之处在于：在拼接引导路径和第三路径，形成第一网络结构图的目标路径之前，还包括判断该第三路径是否满足约束条件。该第三实施方式流程如图5所示：
步骤301：根据待搜索网络的网络信息，构建第一网络结构图。
步骤302：获取第一网络结构图的引导节点。
步骤303：获取路径搜索的起始节点以及目标节点。
步骤304：搜索从起始节点到引导节点之间的第一路径，以及搜索从目标节点到引导节点之间的第二路径。
步骤305：根据预设策略，从第一路径和第二路径中获取引导路径。
步骤306：获取引导路径中除引导节点之外的节点作为过滤节点。
步骤307：从第一网络结构图中删除过滤节点，生成第二网络结构图。
步骤308：获取第二网络结构图中从引导节点到宿节点之间的第三路径，宿节点为目标节点或起始节点。
步骤301至步骤308与第二实施例中的步骤201至步骤208大致相同，此 处将不再赘述。
步骤309：判断第三路径是否满足预设的约束条件，若判断结果指示第三路径满足约束条件，则执行步骤310；若判断结果指示第三路径不满足约束条件，则返回步骤302。
在一些例子中，获取预设的约束条件，例如，各个必经节点等。若第三路径不满足预设的约束条件，表明引导路径未起到矫正搜索路径的作用，则可以返回执行步骤302重新获取引导节点。
需要说明的是，在判断第三路径是否满足预设的约束条件之前，可以更新该预设的约束条件。由于引导路径已经确定，可以从预设的约束条件中删除该引导路径已经满足的约束条件，更新该预设的约束条件；也就是说，在第二网络结构图中搜索路径时，采用新的约束条件进行路径搜索。例如，预设的约束条件包括：经过A节点和B节点，若引导路径中已经经过了A节点，那么更新后的约束条件包括：经过B节点。
若该第三路径已经满足了预设的约束条件，则执行步骤310。
步骤310：拼接引导路径和第三路径，形成第一网络结构图的目标路径。
步骤311：检测到目标路径为从目标节点至起始节点的路径，反转目标路径的方向，以使目标路径为从起始节点至目标节点的路径。
在一些例子中，若待搜索网络中存在方向性，当检测到目标路径为从目标节点至起始节点的路径，则可以反转该目标路径，以使该目标路径为从起始节点至目标节点的路径。
本示例中的路径搜索方法，在拼接引导路径和第三路径之前，对第三路径进行验证，从而可以确保该第三路径的有效性，若该第三路径不满足预设的约束条件，表面该引导路径未起到矫正搜索方向的作用，可以通过重新获取引导节点，直至获取准确的引导节点，提高路径搜索的准确性。
本申请第四实施方式涉及一种电子设备，其结构框图如图6所示，该电子设备包括：至少一个处理器401；以及，与至少一个处理器401通信连接的存储器402；其中，存储器402存储有可被至少一个处理器401执行的指令，指令被至少一个处理器401执行，以使至少一个处理器401能够执行上述的路径搜索的方法。
其中，存储器和处理器采用总线方式连接，总线可以包括任意数量的互联的总线和桥，总线将一个或多个处理器和存储器的各种电路链接在一起。总线还可以将诸如外围设备、稳压器和功率管理电路等之类的各种其他电路链接在一起，这些都是本领域所公知的，因此，本文不再对其进行另外的描述。总线接口在总线和收发机之间提供接口。收发机可以是一个元件，也可以是多个元件，比如多个接收器和发送器，提供用于在传输介质上与各种其他装置通信的单元。经处理器处理的数据通过天线在无线介质上进行传输，在一些实施方式中，天线还接收数据并将数据传送给处理器。
处理器负责管理总线和通常的处理，还可以提供各种功能，包括定时，外围接口，电压调节、电源管理以及其他控制功能。而存储器可以被用于存储处理器在执行操作时所使用的数据。
本申请第五实施方式涉及一种计算机可读存储介质，存储有计算机程序，计算机程序被处理器执行时实现上述的故障定位的方法。
本领域技术人员可以理解实现上述实施例方法中的全部或部分步骤是可以通过程序来指令相关的硬件来完成，该程序存储在一个存储介质中，包括若干指令用以使得一个设备(可以是单片机，芯片等)或处理器(processor)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等各种可以存储程序代码的介质。
本领域的普通技术人员可以理解，上述各实施方式是实现本申请的一些实施例，而在实际应用中，可以在形式上和细节上对其作各种改变，而不偏离本申请的精神和范围。

Claims (10)

  1. 一种路径搜索的方法，其中，包括：
    根据待搜索网络的网络信息，构建第一网络结构图；
    获取所述第一网络结构图的引导节点；
    根据所述引导节点，生成引导路径，所述引导路径用于指示路径搜索的方向；
    根据所述引导路径，生成所述第一网络结构图的目标路径。
  2. 根据权利要求1所述的路径搜索的方法，其中，所述根据所述引导节点，生成引导路径，包括：
    获取路径搜索的起始节点以及目标节点；
    搜索从所述起始节点到所述引导节点之间的第一路径，以及搜索从所述目标节点到所述引导节点之间的第二路径；
    根据预设策略，从所述第一路径和所述第二路径中获取引导路径。
  3. 根据权利要求2所述的路径搜索的方法，其中，所述根据所述引导路径，生成所述第一网络结构图的目标路径，包括：
    获取所述引导路径中除所述引导节点之外的节点作为过滤节点；
    从所述第一网络结构图中删除所述过滤节点，生成第二网络结构图；
    获取所述第二网络结构图中从所述引导节点到宿节点之间的第三路径，所述宿节点为所述目标节点或所述起始节点；
    拼接所述引导路径和所述第三路径，形成所述第一网络结构图的目标路径。
  4. 根据权利要求3所述的路径搜索的方法，其中，在所述拼接所述引导路径和所述第三路径，形成所述第一网络结构图的目标路径之前，所述方法还包括：
    判断所述第三路径是否满足预设的约束条件，获取判断结果；
    若所述判断结果指示所述第三路径满足所述约束条件，则执行所述拼接所述引导路径和所述第三路径，形成所述第一网络结构图的目标路径的步骤；
    若所述判断结果指示所述第三路径不满足所述约束条件，则返回执行获取所述第一网络结构图的引导节点，生成引导路径的步骤，直至重新生成的所述第三路径满足所述约束条件。
  5. 根据权利要求3或4所述的路径搜索的方法，其中，在所述拼接所述引导路径和所述第三路径，形成所述第一网络结构图的目标路径之后，所述方法还包括：
    检测到所述目标路径为从所述目标节点至所述起始节点的路径，反转所述目标路径的方向，以使所述目标路径为从所述起始节点至所述目标节点的路径。
  6. 根据权利要求2至5中任意一项所述的路径搜索的方法，其中，所述预设策略包括：选取节点数目最少的路径，或者，选取路径最短的路径。
  7. 根据权利要求1所述的路径搜索的方法，其中，所述获取所述第一网络结构图的引导节点，包括：
    将随机获取的节点作为所述引导节点；
    或者，获取指定标签对应的节点作为所述引导节点。
  8. 根据权利要求2至6中任意一项所述的路径搜索的方法，其中，所述获取所述第一网络结构图的引导节点，包括：
    获取与所述起始节点直连的节点作为直连节点；
    从除所述直连节点之外的节点中获取所述引导节点。
  9. 一种电子设备，包括：至少一个处理器；以及，
    与所述至少一个处理器通信连接的存储器；其中，
    所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器能够执行如权利要求1至8中任一所述的路径搜索的方法。
  10. 一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现权利要求1至8中任一项所述的路径搜索的方法。
PCT/CN2021/117429 2020-09-09 2021-09-09 路径搜索的方法、电子设备及存储介质 WO2022052986A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010943576.7A CN114239192A (zh) 2020-09-09 2020-09-09 路径搜索的方法、电子设备及存储介质
CN202010943576.7 2020-09-09

Publications (1)

Publication Number Publication Date
WO2022052986A1 true WO2022052986A1 (zh) 2022-03-17

Family

ID=80630270

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/117429 WO2022052986A1 (zh) 2020-09-09 2021-09-09 路径搜索的方法、电子设备及存储介质

Country Status (2)

Country Link
CN (1) CN114239192A (zh)
WO (1) WO2022052986A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117852731A (zh) * 2023-12-06 2024-04-09 珠海市规划设计研究院 边角涟漪思维的多目标点路径搜索方法、系统及介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130003730A1 (en) * 2011-06-30 2013-01-03 Fujitsu Limited Path search program, path search apparatus and path search method
CN103425753A (zh) * 2013-07-24 2013-12-04 浙江大学 一种基于方向寻优的启发式最短路径搜索方法
CN107710696A (zh) * 2015-06-24 2018-02-16 华为技术有限公司 区域导向和变化容忍的快速最短路径算法和图形预处理框架
CN108268971A (zh) * 2017-12-06 2018-07-10 腾讯科技（深圳）有限公司 路径的搜索方法、装置、处理器和电子装置
CN110967015A (zh) * 2019-11-20 2020-04-07 中国人民解放军国防科技大学 一种路径规划方法及系统
CN111309004A (zh) * 2019-12-06 2020-06-19 江苏南大电子信息技术股份有限公司 一种基于改进的跳点搜索算法移动机器人路径规划方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130003730A1 (en) * 2011-06-30 2013-01-03 Fujitsu Limited Path search program, path search apparatus and path search method
CN103425753A (zh) * 2013-07-24 2013-12-04 浙江大学 一种基于方向寻优的启发式最短路径搜索方法
CN107710696A (zh) * 2015-06-24 2018-02-16 华为技术有限公司 区域导向和变化容忍的快速最短路径算法和图形预处理框架
CN108268971A (zh) * 2017-12-06 2018-07-10 腾讯科技（深圳）有限公司 路径的搜索方法、装置、处理器和电子装置
CN110967015A (zh) * 2019-11-20 2020-04-07 中国人民解放军国防科技大学 一种路径规划方法及系统
CN111309004A (zh) * 2019-12-06 2020-06-19 江苏南大电子信息技术股份有限公司 一种基于改进的跳点搜索算法移动机器人路径规划方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117852731A (zh) * 2023-12-06 2024-04-09 珠海市规划设计研究院 边角涟漪思维的多目标点路径搜索方法、系统及介质

Also Published As

Publication number Publication date
CN114239192A (zh) 2022-03-25

Similar Documents

Publication Publication Date Title
US8730819B2 (en) Flexible network measurement
US7996388B2 (en) Adding new continuous queries to a data stream management system operating on existing queries
CN112003787B (zh) 一种路由路径确定方法、装置、控制设备和存储介质
US9075747B2 (en) Bus controller and control unit that outputs instruction to the bus controller
CN111277639B (zh) 一种保持数据一致性的方法和装置
CN111312352B (zh) 一种基于区块链的数据处理方法、装置、设备和介质
US20220116479A1 (en) Systems and methods for managing an automotive edge computing environment
US9367298B1 (en) Batch configuration mode for configuring network devices
WO2022012576A1 (zh) 路径规划方法、装置、路径规划设备及存储介质
WO2022052986A1 (zh) 路径搜索的方法、电子设备及存储介质
CN112767151B (zh) 应用于区块链中验证节点的交易处理方法和装置
Xu et al. QueryGuard: Privacy-preserving latency-aware query optimization for edge computing
CN105577480A (zh) 一种网络连接性能的监测方法及装置
CN114003775A (zh) 图数据处理、查询方法及其系统
Li et al. History is a mirror to the future: Best-effort approximate complex event matching with insufficient resources
CN110069565A (zh) 一种分布式数据库数据批量处理的方法及装置
CN112688802A (zh) 一种基于api网关的高效能交换中间件
WO2022111356A1 (zh) 数据迁移方法、系统、服务器和存储介质
CN103885842A (zh) 一种带加速节点的片上网络的优化整体的任务映射方法
WO2022267865A1 (zh) 工作流创建方法、系统、电子设备和计算机可读存储介质
JP2009157786A (ja) メッセージ送信制御方法、メッセージ送信制御装置、及びメッセージ送信制御プログラム
US20120254277A1 (en) Aggregating information of distributed jobs
US11657040B2 (en) Blockchain machine network acceleration engine
CN114090617A (zh) 一种计划执行方法、装置、数据库节点及介质
US20210349739A1 (en) Trustworthy application integration

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21866038

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 19.07.2023)

122 Ep: pct application non-entry in european phase

Ref document number: 21866038

Country of ref document: EP

Kind code of ref document: A1