Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberCN104579725 A
Publication typeApplication
Application numberCN 201310482907
Publication date29 Apr 2015
Filing date15 Oct 2013
Priority date15 Oct 2013
Publication number201310482907.1, CN 104579725 A, CN 104579725A, CN 201310482907, CN-A-104579725, CN104579725 A, CN104579725A, CN201310482907, CN201310482907.1
Inventors周泉
Applicant中国移动通信集团江苏有限公司
Export CitationBiBTeX, EndNote, RefMan
External Links: SIPO, Espacenet
Traversal search method and device for routes
CN 104579725 A
Abstract
The invention discloses a traversal search method and device for routes. The method comprises steps as follows: searching a first route associated with a starting point and a second route associated with a terminating point; comparing a tail node of the first route associated with the starting point and a tail node of the second route associated with the terminating point; when the tail node of the first route associated with the starting point is identical with the tail node of the second route associated with the terminating point, combining the first route associated with the starting point and the second route associated with the terminating point to form a route from the starting point to the terminating point.
Claims(10)  translated from Chinese
1. 一种路由遍历搜索方法,其特征在于,包括: 搜索与起始点关联的第一路由及与终止点关联的第二路由; 比较所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节占. 当所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节点相同时,将所述与起始点关联的第一路由和终止点关联的第二路由组合后形成从起始点到终止点的路由。 A routing traversal search method comprising: a first route and associated with the termination point associated with the second route search starting point; comparing the tail node associated with the starting point of the first route and the said point associated with the termination of the tail section of the second route accounted for when the first route is associated with the starting point and the end node associated with the termination point of the second route end nodes are the same, said the play. route from the starting point to the ending point of the first route and the associated termination point of the second route combinations associated starting point after the formation.
2. 根据权利要求1所述的方法,其特征在于,所述搜索与起始点关联的第一路由包括: 搜索第一指定路由深度下所有以起始点起始的第一路由,所述第一指定路由深度i=l,2, 3. . . (n+l)/2,其中,η为最大路由深度。 2. A method according to claim 1, characterized in that, associated with said first route search start point comprises: a first next specified route search all of the first routing depth starting with the starting point, the first Specifies routing depth i = l, 2, 3... (n + l) / 2, where, η is the maximum depth of routes.
3. 根据权利要求2所述的方法,其特征在于,所述搜索与起始点关联的第一路由还包括: 对于第一路由深度下的以起始点起始的第一路由,查找所述第一路由的尾节点,查找与所述尾节点关联的所有边; 将在所述边上但不在所述第一路由上的节点加入到所述第一路由,得到第一路由深度下与所述起始点起始的第一路由。 3. The method according to claim 2, characterized in that, associated with said first route search starting point further comprises: first with respect to the starting point of the first route starting at the first routing depth look all the way from the end node and look for all the edges associated with the end node; the first but not the node on the route is added to the first route in the edge, get under the first routing depth the starting point of the first route starting.
4. 根据权利要求1所述的方法,其特征在于,所述搜索与终止点关联的第二路由包括: 搜索第二指定路由深度下所有以起始点起始的第二路由,所述第二指定路由深度j=n, n-1, n-2. . . η/2,其中,η为最大路由深度。 4. The method according to claim 1, characterized in that the search is associated with the termination point of the second route include: the depth of the specified route in the search of the second route to the starting point of all the second start of the second Specifies routing depth j = n, n-1, n-2... η / 2, where, η is the maximum depth of routes.
5. 根据权利要求4所述的方法,其特征在于,所述搜索与终止点关联的第二路由还包括: 对于第二路由深度下的以终止点起始的第二路由,查找所述第二路由的尾节点,查找与所述尾节点关联的所有边; 将在所述边上但不在所述第二路由上的节点加入到所述第二路由,得到第二路由深度下与所述终止点起始的第二路由。 5. The method according to claim 4, characterized in that the termination is associated with the search of the second route point further comprises: a second route to the end point to the depth at the start of the second route, the first lookup Two routes tail node, find all the edges associated with the end node; the second but not the node on the route added to the routing at the edge of the second to give the second route and the depth termination point of starting a second route.
6. -种路由遍历搜索装置,其特征在于,包括: 搜索模块,用于搜索与起始点关联的第一路由及与终止点关联的第二路由; 比较模块,用于比较所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节点; 组合模块,用于当所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节点相同时,将所述与起始点关联的第一路由和终止点关联的第二路由组合后形成从起始点到终止点的路由。 6. - kind of routing traversal search apparatus comprising: search module associated with the first route starting point for searching for and associated with the termination point of the second route; a comparison module, and the starting point for comparing the tail node associated with the first route and the second route termination point associated with tail node; a combination module for, when the first route is associated with the starting point and the end node associated with the termination point The second route is the same tail node, the route from the starting point to the end point of the route after the formation of the first and second termination point associated with the combination of the routing associated with the starting point.
7. 根据权利要求6所述的装置,其特征在于,所述搜索模块包括:第一搜索子模块, 用于搜索第一指定路由深度下所有以起始点起始的第一路由,所述第一指定路由深度i=l,2, 3. . . (η+1)/2,其中,η为最大路由深度。 7. The apparatus according to claim 6, wherein said search module comprises: a first search sub-module, configured to route at the specified depth first search route to the starting point of all of the first starting, the first a route specified depth i = l, 2, 3... (η + 1) / 2, where, η is the maximum depth of routes.
8. 根据权利要求7所述的装置,其特征在于,所述第一搜索子模块,还用于对于第一路由深度下的以起始点起始的第一路由,查找所述第一路由的尾节点,查找与所述尾节点关联的所有边;将在所述边上但不在所述第一路由上的节点加入到所述第一路由,得到第一路由深度下与所述起始点起始的第一路由。 8. The apparatus according to claim 7, characterized in that the first search sub-module, is also used for the starting point of the first route to a first depth at the start of the route, the first route lookup end node, find all the edges associated with the end node; the first but not the node on the route is added to the first route in the edge, get under the first route starting from the depth beginning of the first routes.
9. 根据权利要求6所述的装置,其特征在于,所述搜索模块包括:第二搜索子模块, 用于搜索第二指定路由深度下所有以起始点起始的第二路由,所述第二指定路由深度j=n, n-1, n-2. . . n/2,其中,η为最大路由深度。 9. The apparatus according to claim 6, wherein said search module comprises: a second search sub-module, used in the next route search for the second specified depth to the starting point of all the routes starting a second, the first two routes specified depth j = n, n-1, n-2... n / 2, where, η is the maximum depth of routes.
10. 根据权利要求9所述的装置,其特征在于,所述第二搜索子模块,用于对于第二路由深度下的以终止点起始的第二路由,查找所述第二路由的尾节点,查找与所述尾节点关联的所有边;将在所述边上但不在所述第二路由上的节点加入到所述第二路由,得到第二路由深度下与所述终止点起始的第二路由。 10. The apparatus according to claim 9, characterized in that said second search sub-module, for the depth of the second route to the termination point at the start of the second route, the second route lookup tail node, find all the edges associated with the end node; the second but not the node is added to the route on the edge of the second route, the starting point to get a second route to the termination depth The second route.
Description  translated from Chinese
-种路由遍历搜索方法及装置 - Kind of routes traversing search method and apparatus

技术领域 TECHNICAL FIELD

[0001] 本发明涉及网管技术领域,尤其涉及一种路由遍历搜索方法及装置。 [0001] The present invention relates to the field of network management technology, particularly to a method and apparatus for routing traversal search.

背景技术 Background technique

[0002] 在通信运营商为行业客户开通专线业务时,需要为客户调配一条光纤的通路,通过光纤实现客户点到点的信息通信。 When [0002] In communications operator for the industry to open private line service, customers need to deploy a fiber path to achieve customer point of information and communication through the optical fiber. 在光纤通路的调配过程中,需要根据光纤的类型、必经点、路径的深度来遍历搜索所有的路由,由运营商专业网络管理人员选择其中的一条。 In the deployment of optical fiber path, it is necessary according to the type of fiber, a necessary depth point, the path to traverse the search for all routes, by the operator of professional network managers choose which one. 目前对光路路由的遍历搜索方法是通过单点出发,通过广度优先或深度优先的算法来遍历所有路由。 Currently optical path traversal route search method is through a single point of view, through which all routed through the breadth-first or depth-first algorithm.

[0003] 现有方案主要是在内存中构造光缆网络抽象形成的无向图,对此无向图基于静态最优路由搜索算法如Di jkstra算法、A*算法、Floyd算法等搜索路由,现有方案的缺点是当网络规模庞大时内存中的无向图结构也比较庞大,对内存要求高,算法性能低下,搜索速度慢。 [0003] The existing program is mainly constructed abstract form of non-cable networks in memory to graph, this undirected graph based on the static optimal routing algorithms such as Di jkstra search algorithm, A * algorithm, Floyd algorithm searches the route, existing The disadvantage is that when a large program memory in network size undirected graph structure is relatively large memory requirements, poor performance of the algorithm, the search is slow.

发明内容 SUMMARY OF THE INVENTION

[0004] 为了解决现有技术中路由搜索速度慢、性能低下的技术问题,本发明提出一种路由遍历搜索方法及装置。 [0004] In order to solve the prior art, the route search is slow, poor performance of technical problems, the present invention provides a method and apparatus for routing traversal search.

[0005] 本发明的一个方面,提供一种路由遍历搜索方法,包括: [0005] An aspect of the invention, there is provided a route traversing search method, comprising:

[0006] 搜索与起始点关联的第一路由及与终止点关联的第二路由; [0006] The first route and associated with the termination point associated with the second route search starting point;

[0007] 比较所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节点; [0007] comparing the first route and the starting point and the associated end node associated with the termination point of the second route end node;

[0008] 当所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节点相同时,将所述与起始点关联的第一路由和终止点关联的第二路由组合后形成从起始点到终止点的路由。 [0008] When the first route is associated with the starting point and the end node associated with the termination point of the second route end nodes are the same, the first route is associated with starting and ending points associated route from the starting point to the ending point of the second route is formed after the combination.

[0009] 本发明的另一个方面,提供一种路由遍历搜索装置,包括: [0009] Another aspect of the present invention, there is provided a routing traversal search apparatus comprising:

[0010] 搜索模块,用于搜索与起始点关联的第一路由及与终止点关联的第二路由; [0010] The search module, associated with the first route for the search starting point and end point associated with the second route;

[0011] 比较模块,用于比较所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节点; [0011] comparison module for comparing the tail node associated with the starting point of the route and the first associated with the termination point of the second route end node;

[0012] 组合模块,用于当所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节点相同时,将所述与起始点关联的第一路由和终止点关联的第二路由组合后形成从起始点到终止点的路由。 [0012] The combination of modules for routing when the first associated with the starting point and the end node associated with the termination point of the second route end nodes are the same, the first route is associated with the starting point and after the termination of the associated point routes combined to form a second route from the starting point to the ending point.

[0013] 本发明的路由遍历搜索方法及装置,通过起始点和终止点进行双向路径搜索再合并的方式,从起始点和终止点同时开始遍历,遍历的层数总和为η。 [0013] The present invention is to traverse the route search method and apparatus for two-way route search recombined way through the start and end point, and began to traverse from the starting point and end point, the total number of layers traversal of η. 然后查看两个遍历结果中是否有相同的节点,路由搜索的时间复杂度为降低,可以更快的遍历所有路由,提高业务开通的响应速度。 And then view the results whether the two traverse the same node, the route search time complexity is reduced, you can traverse all routes faster, improve service provisioning response speed.

附图说明 Brief Description

[0014] 图1是本发明路由遍历搜索方法实施例的流程示意图; [0014] FIG. 1 is a route of the present invention, a schematic flow traversal search method according to an embodiment;

[0015] 图2是本发明路由遍历搜索方法另一实施例的流程示意图; [0015] FIG. 2 is a route search method of the present invention to traverse the flow schematic diagram of another embodiment;

[0016] 图3是本发明路由遍历搜索装置实施例的结构示意图; [0016] FIG. 3 is a route searching apparatus of the present invention is to traverse a schematic view of an embodiment of the structure;

[0017] 图4是本发明搜索模块的结构示意图。 [0017] FIG. 4 is a block diagram of the present invention, the search module.

具体实施方式 DETAILED DESCRIPTION

[0018] 本发明实施例通过从起始点和终止点双向搜索路由,再进行路由匹配的方式,利用了计算机的并发处理能力,极大的提高了搜索的效率,降低搜索需要花费的时间成本。 [0018] The embodiment of the invention by a two-way route search from the start and end points, then the route matches the way, take advantage of the parallel processing power of computers, which greatly improves the search efficiency and reduce the time it takes for the cost of the search. 以下结合附图对本发明进行详细说明。 Below in conjunction with the accompanying drawings of the present invention will be described in detail.

[0019] 如图1所示,本发明实施例提供一种路由遍历搜索方法,包括以下步骤: [0019] As shown in Figure 1, the present embodiment of the invention there is provided a route traversing search method, comprising the steps of:

[0020] 步骤101,搜索与起始点关联的第一路由及与终止点关联的第二路由; [0020] Step 101, the first route and the second associated with the termination point associated with the starting point of the route search;

[0021] 步骤102,比较与起始点关联的第一路由的尾节点和与终止点关联的第二路由的尾节点; [0021] Step 102, compared with the starting point of the first route end nodes and associated termination point associated with the second route end node;

[0022] 步骤103,当与起始点关联的第一路由的尾节点和与终止点关联的第二路由的尾节点相同时,将与起始点关联的第一路由和终止点关联的第二路由组合后形成从起始点到终止点的路由。 [0022] Step 103, when the first route associated with the starting and end nodes associated with the termination point of the second route end nodes are the same, the first route and terminate your association with the starting point of the second route is associated route from the starting point to the ending point is formed after the combination.

[0023] 步骤101中,搜索与起始点关联的第一路由包括: [0023] step, the first associated with the starting point of the route searching 101 comprises:

[0024] 搜索第一指定路由深度下所有以起始点起始的第一路由,第一指定路由深度i=l,2, 3. . . (n+l)/2,其中,η为最大路由深度。 [0024] Under the specified routing depth first search route to the starting point of all of the first start, the first specified route depth i = l, 2, 3... (N + l) / 2, where, η is the maximum routes depth.

[0025] 搜索与起始点关联的第一路由还包括:对于第一路由深度下的以起始点起始的第一路由,查找第一路由的尾节点,查找与尾节点关联的所有边("边"指的是连接两个节点的线,即光缆段);将在边上但不在第一路由上的节点加入到第一路由,得到第一路由深度下与起始点起始的第一路由。 [0025] associated with the starting point of the first route searching further comprises: a first starting point for a route to a first depth at the beginning of the route, the route to find a first node of the tail, to find all of the node associated with the end edges (" side "refers to the line connecting the two nodes, i.e. cable section); the nodes on the edge, but not in the first route to the first route was added, to obtain a first route and the starting point of a first route starting depth .

[0026] 步骤101中,搜索与终止点关联的第二路由包括: [0026] step, the search is associated with the termination point of the second route 101 include:

[0027] 搜索第二指定路由深度下所有以起始点起始的第二路由,第二指定路由深度j=n, n-1, n-2. . . η/2,其中,η为最大路由深度。 Under the [0027] second designated route search depth to the starting point of the start of all the second routes, and the second route specified depth j = n, n-1, n-2... Η / 2, where, η is the maximum routes depth.

[0028] 搜索与终止点关联的第二路由还包括:对于第二路由深度下的以终止点起始的第二路由,查找第二路由的尾节点,查找与尾节点关联的所有边;将在边上但不在第二路由上的节点加入到第二路由,得到第二路由深度下与终止点起始的第二路由。 [0028] The search associated with the termination point of the second route also include: depth for a second route to the end point at the start of the second route, find the end of the second routing node, to find all the edges associated with the end node; the nodes on the edge but not the second route is added to the second route to give the second routing depth and the second route starting termination point.

[0029] 以下以具体的实例详细描述本发明实施例的路由遍历搜索方法,如图2所示,该方法包括以下步骤: [0029] In the following detailed description of specific examples of embodiments of the invention traversal route search method, shown in Figure 2, the method comprising the steps of:

[0030] 步骤201,将起始点StartNode放入所有以StartNode起始的路径集合startPaths Φ ; [0030] Step 201, the starting point of a path StartNode StartNode put all initial set startPaths Φ;

[0031] 步骤202,将终止点endNode放入所有以EndNode起始的路径集合endPaths中; [0031] Step 202, the end point of a path EndNode endNode put all starting in the collection endPaths;

[0032] 步骤203,以第一路由深度i=l,2, 3. .. (n+l)/2搜索所有以StartNode起始的路由Path集合; [0032] Step 203, the first routing depth i = l, 2, 3. .. (n + l) / 2 searches for all routes starting StartNode Path set;

[0033] 步骤203a,如i=l,从startPaths 中取出startNode,否则顺序取出startPaths 中所有i-Ι搜索到的Path ; [0033] Step 203a, such as i = l, removed from startPaths startNode, otherwise remove startPaths order all i-Ι searched Path;

[0034] 步骤203b,查找该Path的尾节点,查找与该尾节点相关联的所有的边Edge ; [0034] Step 203b, find the Path of end nodes, edges Edge find all the associated end node;

[0035] 步骤203c,查找与该Edge相关联的首尾节点; [0035] Step 203c, look for inclusive node associated with the Edge;

[0036] 步骤203d,将该Edge但不在原Path上的节点加入到Path上; [0036] Step 203d, the node but not the original Path on the Edge added to the Path;

[0037] 步骤203e,将该Path加到startPaths中,从而得到当前路由深度下的与StartNode相关联的所有Path ; [0037] Step 203e, the Path is added startPaths, whereby all the current route Path associated with StartNode depth under;

[0038] 步骤204,以第二路由深度j=n, n-1, n-2. .. n/2搜索所有以EndNode起始的Path 集合; [0038] step 204, the search for all EndNode starting Path set to the second routing depth j = n, n-1, n-2 .. n / 2.;

[0039] 步骤204a,如j=n,从endPaths中取出endNode,否则顺序取出endPaths中所有j-Ι搜索到的Path ; [0039] Step 204a, such as j = n, taken from endPaths endNode, otherwise remove endPaths order all j-Ι searched Path;

[0040] 步骤204b,查找该Path的最后一个节点,查找与该节点相关联的所有的Edge ; [0040] Step 204b, to find the last node of the Path, and find all the Edge associated with the node;

[0041] 步骤204c,查找与该Edge相关联的首尾节点; [0041] Step 204c, look for inclusive node associated with the Edge;

[0042] 步骤204d,将该Edge和不在原Path上的节点加入到Path上; [0042] Step 204d, the node is not in the original Path on the Edge and added to the Path;

[0043] 步骤204e,将该Path加到endPaths中;从而得到当前深度下的与endNode相关联的所有Path ; [0043] Step 204e, the Path is added endPaths; and to give all the Path associated with endNode under the current depth;

[0044] 步骤205,从与startNode相关联的所有startPaths中,取出一条Pathl [0044] Step 205, from all startPaths startNode associated with the removal of a Pathl

[0045] 步骤206,从与endNode相关联的所有endPaths中,取出一条Path2 ; [0045] Step 206, from all associated with endNode endPaths in, take out a Path2;

[0046] 步骤207,用上述所取出Pathl的最后一个节点与Path2中的最后一个节点相比较,如果两节点相同,则认为Pathl与Path2可以组成一条路由,则算法结束; [0046] Step 207, by removing the last node above Pathl Path2 compared with the last node if the two nodes are the same, think Pathl and Path2 can form a route, the algorithm end;

[0047] 步骤208,如果两节点不相同,贝U从endPahts中取出下一条Path,与Pathl相比较; [0047] Step 208, if the two are not the same node, Tony U Remove from endPahts Path in the next, compared with Pathl;

[0048] 步骤209,如果endPaths中所有Path与Pathl都没有相同的节点,则从startPaths中取出下一条Path,重复步骤206-209。 [0048] Step 209, if all the Path and Pathl endPaths are not the same node, removed from startPaths next Path, repeat steps 206-209.

[0049] 现有方案比如采用Dijkstra算法,从起始点开始遍历,按照要求的路由深度遍历η层,然后去比较这η层中是否包含终止点,时间复杂度为0 (2n)。 [0049] Dijkstra algorithm such as the use of existing programs, traverses from the starting point, in accordance with the requirements of the routing depth traversal η layer, and then to compare this η layer contains the end point, time complexity is 0 (2n).

[0050] 本实施例中,通过起始点和终止点进行双向路径搜索再合并的方式,从起始点和终止点同时开始遍历,起始点遍历加一层,然后终止点遍历加一层,遍历的层数总和为η。 [0050] In this embodiment, two-way route search recombined way through the start and end point, and began to traverse from the starting point and end point, starting traverse add a layer, then add a layer termination point traversal, traversal stratum sum of η. 然后查看两个遍历结果中是否有相同的节点,时间复杂度为〇(; 2 I 由此可见,本实施例的路由搜索方法时间复杂度大大降低了。 And then view the results whether the two traverse the same node, time complexity billion (; 2 I Thus, the time complexity of the route search method of this embodiment is greatly reduced.

[0051] 本实施例的方法,通过从起始点和终止点双向搜索路由,再进行路由匹配的方式, 利用了计算机的并发处理能力,极大的提高了搜索的效率,降低搜索需要花费的时间成本。 Method [0051] The present embodiment, by searching the route from the bidirectional start and end points, then the route matches the way, take advantage of the parallel processing power of computers, which greatly improves the search efficiency and reduce the time it takes to search cost.

[0052] 如图3所示,本发明实施例还提供一种路由遍历搜索装置,包括: [0052] As shown in Figure 3, the embodiment of the present invention also provides a route to traverse the search device, comprising:

[0053] 搜索模块31,用于搜索与起始点关联的第一路由及与终止点关联的第二路由; [0053] The search module 31, associated with the first route for the search starting point and end point associated with the second route;

[0054] 比较模块32,用于比较所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节点; [0054] The comparison module 32 for comparing the tail node associated with the starting point of the route and the first associated with the termination point of the second route end node;

[0055] 组合模块33,用于当所述与起始点关联的第一路由的尾节点和所述与终止点关联的第二路由的尾节点相同时,将所述与起始点关联的第一路由和终止点关联的第二路由组合后形成从起始点到终止点的路由。 [0055] The combination module 33, when the first route for the end node associated with the starting point and the termination point is associated with a second route end nodes are the same, the starting point is associated with a first route from the starting point to the ending point of the route and the associated termination point combined to form after a second route.

[0056] 如图4所示,搜索模块31包括:第一搜索子模块311,用于搜索第一指定路由深度下所有以起始点起始的第一路由,所述第一指定路由深度i=l,2, 3. . . (n+l)/2,其中,η为最大路由深度。 [0056] 4, the search module 31 comprises: a first search sub-module 311 first searches for the next specified route to the starting point of the depth of all of the first route starting, the first specified routing depth i = l, 2, 3... (n + l) / 2, where, η is the maximum depth of routes.

[0057] 第一搜索子模块311,还用于对于第一路由深度下的以起始点起始的第一路由, 查找所述第一路由的尾节点,查找与所述尾节点关联的所有边;将在所述边上但不在所述第一路由上的节点加入到所述第一路由,得到第一路由深度下与所述起始点起始的第一路由。 All sides [0057] The first search sub-module 311 is also used for the first route to the starting point at the start of the first routing depth, look for the first route of egress, associated with the end node lookup ; but the node will not join the first route on the edge to the first route, get a first routing depth and the starting point of the first route starting.

[0058] 如图4所示,搜索模块31包括:第二搜索子模块312,用于搜索第二指定路由深度下所有以起始点起始的第二路由,所述第二指定路由深度j=n, n-1, n-2. . . n/2,其中,η为最大路由深度。 [0058] 4, the search module 31 comprises: a second search sub-module 312, used in the next route search for the second specified depth to the starting point of all the routes starting a second, the second predetermined routing depth j = n, n-1, n-2... n / 2, where, η is the maximum depth of routes.

[0059] 第二搜索子模块312,用于对于第二路由深度下的以终止点起始的第二路由,查找所述第二路由的尾节点,查找与所述尾节点关联的所有边;将在所述边上但不在所述第二路由上的节点加入到所述第二路由,得到第二路由深度下与所述终止点起始的第二路由。 [0059] The second search sub-module 312 for the second routing depth at the starting point to terminate a second route, look for the second route end node, find all the edges associated with the end node; The node but not the second route is added to the side of the second route, get a second routing depth starting with the terminating point of the second route.

[0060] 本实施例的装置,通过起始点和终止点进行双向路径搜索再合并的方式,从起始点和终止点同时开始遍历,遍历的层数总和为η。 [0060] The apparatus of this embodiment, a two-way route search recombined way through the start and end point, and began to traverse from the starting point and end point, the total number of layers traversal of η. 然后查看两个遍历结果中是否有相同的节点,路由搜索的时间复杂度为降低,可以更快的遍历所有路由,提高业务开通的响应速度。 And then view the results whether the two traverse the same node, the route search time complexity is reduced, you can traverse all routes faster, improve service provisioning response speed.

[0061] 应说明的是:以上实施例仅用以说明本发明而非限制,本发明也并不仅限于上述举例,一切不脱离本发明的精神和范围的技术方案及其改进,其均应涵盖在本发明的权利要求范围中。 [0061] It should be noted that: the above embodiments are merely illustrative of the invention rather than limit, the present invention is not limited to the above example, all without departing from the spirit and scope of the present invention, technical solutions and improvements, which should be covered In the claims of the present invention of claim scope.

Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
CN1273005A *7 Aug 19988 Nov 2000西门子公司Method for route searching in telecommunication networks
CN101572647A *30 Apr 20084 Nov 2009华为技术有限公司Method and device for searching data
CN101924697A *30 Jun 201022 Dec 2010北京科技大学Two-way startup recovery method based on link back backtracking strategy
US20120230199 *22 May 201213 Sep 2012Rockstar Bidco LpTie-breaking in shortest path determination
Non-Patent Citations
Reference
1 *戴伏生,刘功亮: "双向搜索多约束路由启发式计算方法", 《哈尔滨工业大学学报》
Classifications
International ClassificationH04L12/701, H04L12/24
Legal Events
DateCodeEventDescription
29 Apr 2015C06Publication
27 May 2015C10Entry into substantive examination