New! View global litigation for patent families

CN103023780B - A route calculation method and apparatus - Google Patents

A route calculation method and apparatus Download PDF

Info

Publication number
CN103023780B
CN103023780B CN 201210519340 CN201210519340A CN103023780B CN 103023780 B CN103023780 B CN 103023780B CN 201210519340 CN201210519340 CN 201210519340 CN 201210519340 A CN201210519340 A CN 201210519340A CN 103023780 B CN103023780 B CN 103023780B
Authority
CN
Grant status
Grant
Patent type
Application number
CN 201210519340
Other languages
Chinese (zh)
Other versions
CN103023780A (en )
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
Grant date

Links

Abstract

本发明提供一种路由计算方法,应用于源节点到目的节点的路由计算中,源节点到目的节点包括多个域,包括:当前域的路径计算单元确定所述当前域到其相邻域的双向标签交换路径;为所述双向标签交换路径进行资源预留,其中,如果各双向标签交换路径中存在重合的路径段,则对各重合的路径段进行资源复用。 The present invention provides a method for route calculation, route calculation applied to the source node to the destination node, the source node to the destination node comprises a plurality of fields, comprising: a current path of the field calculation unit determines the current domain to its neighboring domain bi-directional label switched path; reserve resources for said bi-directional label switched path, wherein, if the path segment is present in each of the bidirectional overlapped label switched path, for each path segment overlap multiplexed resource. 本发明还提供一种路由计算装置。 The present invention also provides a route calculation means. 本发明通过在预留资源时复用资源,可以减少资源浪费。 When the present invention by multiplexing resources reserved resources, waste of resources can be reduced.

Description

一种路由计算方法和装置 A route calculation method and apparatus

技术领域 FIELD

[0001] 本发明涉及通信领域,尤其涉及一种路由计算方法和装置。 [0001] The present invention relates to the field of communications, particularly to a method and apparatus for route calculation.

背景技术 Background technique

[0002] 在采用AS (Autonomous System,自治系统)进行划分的多域网络中,若己经确定了域序列,可以采用BRPC(Backward-Recursive PCE-BasedComputation,反向递归路径算法) 进行跨域路径计算,得到最短约束路径。 [0002] In the multi-domain network using the AS (Autonomous System, AS) for the divided, when the domain sequences have identified, may be employed BRPC (Backward-Recursive PCE-BasedComputation, reverse recursive path algorithm) for cross-domain path calculation, the shortest path constraints.

[0003] RFC5441 (Request For Comments,简称RFC,请求注解)中对BRPC算法进行了描述, 该算法过程依赖于相互协作的PCE (Path Computation Element,路径计算单元)之间的通信。 [0003] In RFC5441 (Request For Comments, referred to as the RFC, Request for Comments) of BRPC algorithm is described, the method relies on the process of cooperating PCE (Path Computation Element, the path calculation unit) communication between. PCC (Path Computation Clients,路径计算客户端)向其域内的PCE发送PCReq (Path Computation Request,路径计算请求)消息。 PCC (Path Computation Clients, path computation client) (calculation request Path Computation Request, path) PCReq message PCE sent to its domain. 该消息在每个域的PCE之间转发,直到请求到达负责计算LSP (Label Switched Path,标签交换路径)目的节点所在域的PCE。 The PCE of each domain between the message forwarding, until the request reaches the PCE domain is responsible for calculating the LSP (Label Switched Path, LSP) the destination node. 目的域中的PCE创建一棵由到达目的节点的潜在路径组成的虚拟最短路径树(VirtualShortest Path Tree,VSPT),并在PCRep (Path Computation Response,路径计算响应)中将此树传递给先前的PCE。 PCE domain object to create a virtual shortest path tree from the route to the destination node of the potential of a composition (VirtualShortest Path Tree, VSPT), and (calculated response Path Computation Response, a path) in the tree PCRep pass this to the previous PCE . 然后每个PCE依次增加VSPT,并将它向回传递,直到源节点所在域的PCE,此PCE使用VSPT选择一条端到端的路径,并将路径发送给PCC。 Each PCE is then sequentially increased VSPT, and pass it back, PCE until the source node domain, the PCE used to select an end VSPT path, and transmits the path to the PCC.

[0004] 如图1所示,BRPC算法做如下约定: [0004] 1, BRPC convention algorithm follows:

[0005] l)BN-en(k,i):域i的一组入口边界节点(连接域(i-1)的边界节点),其中BN-en (k,i)是域i的第k个入口边界节点; [0005] l) BN-en (k, i): a set of ingress border node domain i (connecting domains (i-1) of the boundary node), where BN-en (k, i) is the k field i of entrance boundary node;

[0006] 2)BN-ex(k,i):域i的一组出口边界节点(连接域(i+1)的边界节点),其中BN-ex (k,i)是域i的第k个出口边界节点; [0006] 2) BN-ex (k, i): a set of exit boundary node domain i (connecting domains (i + 1) of the boundary node), where BN-ex (k, i) is the k field i of exit boundary nodes;

[0007] 3) VSPT ⑴:由PCE(i)返回给PCE(il)的多点到一点(Multipoint To Point)的树。 [0007] 3) VSPT ⑴: returned by the PCE (i) to PCE (il) to the multi-point (Multipoint To Point) tree.

[0008] 具体的计算步骤如下: [0008] The specific calculation steps are as follows:

[0009]步骤1: AS (1)域中首节点PCC将路径计算请求发送首域PCE,然后路径计算请求将沿域序列指定的域的顺序沿多个域的PCE传递,直到到达目的节点所在域的PCE(n)。 [0009] Step 1: AS (1) to the first node PCC domain path computation request first PCE domain, and PCE path computation request transmitted sequentially in the temporal domain along a specified sequence of multiple domains, until it reaches the destination node is located domain PCE (n). [0010]步骤i:对于i = n到2:PCE⑴计算VSPT⑴,该树由各个BN-en(j,i)和TE(Traffic Engineering,流量工程)LSP目的节点之间的最短约束路径组成,如图1所示。 [0010] Step i: for i = n to 2: PCE⑴ calculated VSPT⑴, the tree by the respective BN-en (j, i) and constrained shortest path between the TE (Traffic Engineering, TE) composed of the LSP destination node, such as 1 shown in FIG. PCE (i)通过它自己的TED (Traffic Engineering Database, PCE (i) through its own TED (Traffic Engineering Database,

[0011] 流量工程库)、连接域⑴和域(i+1)的Inter-AS链路(i=n时不存在)和VSPT (i+1) (i=n时不存在)中的信息进行计算。 [0011] Traffic Engineering Library), connected to the domain and domain ⑴ (i + 1) of the Inter-AS link (i = n does not exist) and VSPT (i + 1) (i no information) = n in the presence of Calculation.

[0012]步骤n:最后源节点所在域的PCE⑴计算从源节点到目的节点的端到端最短约束路径,并将相应的路径用PCRep返回给请求PCC (源节点),BRPC的跨域路径计算过程结束。 [0012] Step n: PCE⑴ source node domain last calculated end constrained shortest path from the source node to the destination node, and corresponding paths PCRep returned to the requesting PCC (source node), the cross-domain path computation BRPC process ends. [0013]上述过程为BRPC算法计算的一般过程,然而对于每个PCE⑴而言,对应的TED都是不稳定的(即BRPC路径资源可能被其他业务占用),为保证BRPC计算得到的路径建立时资源没有被其他业务所占用,通常需要每个PCE (i)对VSPT (i)中对应本域的资源进行预留。 When [0013] General Procedure for the above-described process BRPC algorithm, whereas for each PCE⑴, the corresponding TED are unstable (i.e. BRPC path resources occupied by other services may be), in order to ensure the establishment of a path calculated BRPC resources are not occupied by other services, generally require each PCE (i) resource VSPT (i) corresponding to the present field is reserved. 由BRPC算法可知,若PCE (i)负责的域有m个入口边界节点,则需要对该域计算广生的m条路径以及最多m条Inter-AS (Inter-Autonomous System,自治系统域间)链路上的资源进彳亍预留。 BRPC seen from the algorithm, if the PCE (i) a domain responsible for the ingress border has m nodes, the domain to be calculated Guangsheng m paths and the m most Inter-AS (Inter-Autonomous System, inter autonomous system domain) resources on the link walk slowly into the reserve. 然而,BRPC计算跨域路由时最后建立使用的仅仅是一条,其他路径的预留资源则是在业务建立或者是某段时间后才得以释放。 However, the cross-domain route calculated BRPC built using only the last one, the other path is reserved resources is established after a certain period of time or to be released in the business. 如图1所示,域(i)存在j个入口边界节点,PCE (i)计算产生的VSPT (i)将由VSPT (i+1)和j条由域(i+1)的入口边界节点到域(i)的入口边界节点的路径组成。 As shown, the presence of the j-th entry border node domain 1 (i), VSPT (i) PCE (i) generated by the calculation VSPT (i + 1) j and a domain boundary strip by an entry node (i + 1) to domain path inlet boundary node (i) a composition. 这j条路径(包括域内路径和域间链路)都将独立的对其所需资源进行预留(当资源预留不成功时,将导致分支失败)。 This path j (including domain and inter-domain link path) are independent of their resource reservation required (when resource reservation is unsuccessful, failure will result in the branch). 在PCE(l)计算完成VSPT (1)(实际上这时候已经是端到端路径),业务建立的PATH信令到达域(i)前,域(i)中j_l条的非最优路径预留资源都将不能被其他业务所使用,这很可能会导致域(i)中某些业务无法正常建立。 In the PCE (l) calculation is done VSPT (1) (which actually has a time-end path), before the service establishment signaling reaches the domain PATH (i), the domain (i) in a non-optimal path section j_l pre stay resources will not be used by other businesses, which is likely to cause the domain (i) certain services can not establish normal.

[0014] 可以看到,为保证BRPC计算得到的路径能够建立成功,BRPC会对域序路径上的每域资源进行预留。 [0014] It can be seen in order to ensure the path BRPC calculated to establish successful, be reserved for each domain resources on the domain sequence will BRPC path. 而这样的预留都将会导致每域的域内和域间资源浪费,影响其他业务的正常建立。 And this will lead to inter-domain are reserved for each domain and domain waste of resources, affecting the normal establishment of other services.

发明内容 SUMMARY

[0015] 本发明要解决的技术问题是提供一种路由计算方法和装置,减少资源浪费。 [0015] The present invention is to solve the technical problem of providing a method and apparatus for route calculation, reduce waste of resources.

[0016] 为了解决上述问题,本发明提供了一种路由计算方法,应用于源节点到目的节点的路由计算中,源节点到目的节点包括多个域,包括: [0016] In order to solve the above problems, the present invention provides a method for route calculation, route calculation applied to the source node to the destination node, the source node to the destination node comprises a plurality of fields, comprising:

[0017] 当前域的路径计算单元确定所述当前域到其相邻域的双向标签交换路径; [0017] The current domain path computation unit determines the current domain to its adjacent domains bidirectional label switched path;

[0018] 为所述双向标签交换路径进行资源预留,其中,如果各双向标签交换路径中存在重合的路径段,则对各重合的路径段进行资源复用。 [0018] The resource reservation for said bidirectional LSP, wherein, if the path segment is present in each of the bidirectional overlapped label switched path, for each path segment overlap multiplexed resource.

[0019] 上述方法还可具有以下特点,所述对各重合的路径段进行资源复用包括: [0019] The method may have the following feature, the resources for each multiplex overlap path segment comprises:

[0020] 如果预留的资源为电层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和己进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的时隙资源。 [0020] If the reserved resource is resource layer, reserve resources for the current bi-directional label switched path LSP if a bidirectional current hexyl and overlap exists for resource reservation bidirectional LSP path segment, the multiplex slot already reserved resources for overlapping path segments.

[0021] 上述方法还可具有以下特点,所述对各重合的路径段进行资源复用包括: [0021] The method may have the following feature, the resources for each multiplex overlap path segment comprises:

[0022] 如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的外部光层链路的波长资源。 [0022] If the reserved resources for an optical layer resources, to reserve resources for the current bi-directional label switched path, if the current and bi-directional label switched path LSP has bidirectional resource reservation path segments exist overlapped, the complex wavelength using an external link resource has been reserved for the light absorbing layer overlaps the path segment.

[0023] 上述方法还可具有以下特点,所述方法还包括:如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和己进行资源预留的双向标签交换路径存在重合的路径段,复用所述重合的路径段上的节点内部的资源。 [0023] The above method may have the following features, the method further comprising: if the reserved resources for the light absorbing layer resources, resource reservation, reservation label switched path if a bidirectional current resources and current has a bidirectional LSP presence bidirectional LSP path segment coincident multiplexing resources on the inside of the path segment coincident nodes.

[0024] 上述方法还可具有以下特点: [0024] The method may have the following feature:

[0025]确定所述当前域到其相邻域的双向标签交换路径时,如果路径约束满足预设条件,选择彼此之间重合路径段最多的双向标签交换路径。 When [0025] the bi-directional label switched path determines the current domain to its neighboring domain, path constraint if the preset condition is satisfied, selecting a maximum bidirectional LSP path segment overlap each other.

[0026] 上述方法还可具有以下特点: [0026] The method may have the following feature:

[0027] 所述预设条件包括:对资源利用率要求高于对路径最优性要求和/或所述当前域的可用资源低于资源阈值。 [0027] The preset condition comprises: higher than optimal path requirements and available resources or the current domain / resource threshold value is lower than the resource utilization requirements.

[0028] 上述方法还可具有以下特点: [0028] The method may have the following feature:

[0029] 确定所述当前域到其相邻域的双向标签交换路径为:确定所述当前域到其下一域的双向标签交换路径,所述下一域为与所述当前域相邻且靠近所述目的节点的域; [0029] determining the current bi-directional LSP domain to its neighboring domain to: determine the current domain LSP to the bidirectional its next field, the next field adjacent to the current domain and close to the destination node domain;

[0030] 当所述当前域为不包括所述源节点的域时,所述方法还包括: [0030] when the current domain does not include the source node domain, the method further comprising:

[0031] 确定所述当前域到其相邻域的双向标签交换路径后,生成虚拟最短路径树; After [0031] the bi-directional label switched path determines the current domain to its neighboring domain, generating a virtual shortest path tree;

[0032] 判断所述虚拟最短路径树的叶子节点是否为所述当前域的节点,如果不是,删除所述虚拟最短路径树中所述非当前域的叶子节点的分支后,将所述虚拟最短路径树发送给所述当前域的前一域的路径计算单元;所述当前域的前一域是与所述当前域相邻且靠近所述源节点的域。 If [0032] Analyzing the virtual shortest path tree leaf node as the node of the current domain, if not, deleting the leaf node of a virtual branch of the shortest path tree in the non-current domain, the virtual shortest the path tree path to a previous domain of the current domain calculation unit; previous field of the current field is adjacent to the current domain, and close to the source node domain.

[0033] 上述方法还可具有以下特点: [0033] The method may have the following feature:

[0034] 所述当前域为不包括所述目的节点的域时,将非所述当前域的叶子节点对应的分支路由发送给所述当前域的下一域的路径计算单元,以使所述下一域的路径计算单元释放所述分支路由对应的预留资源。 [0034] The current domain does not include the time domain to the destination node, non-leaf nodes of the current field corresponds to a branch of the route of the current path of the next domain domain calculation unit, so that the the next field path calculation unit releases the reserved resources corresponding to the branch route.

[0035] 本发明还提供一种路由计算装置,包括: [0035] The present invention also provides a route calculation apparatus, comprising:

[0036] 路径确定模块,用于确定当前域到其相邻域的双向标签交换路径; [0036] The path determining means for determining the current domain to its adjacent domains bidirectional label switched path;

[0037] 资源预留模块,用于为所述双向标签交换路径进行资源预留,其中,如果各双向标签交换路径中存在重合的路径段,则对各重合的路径段进行资源复用。 [0037] The resource reservation module configured to reserve resources for said bi-directional label switched path, wherein, if the path segment is present in each of the bidirectional overlapped label switched path, for each path segment overlap multiplexed resource.

[0038] 上述装置还可具有以下特点,所述资源预留模块对各重合的路径段进行资源复用包括: [0038] The apparatus may be further characterized, for each module the resource reservation path segments overlapped resource reuse comprising:

[0039] 如果预留的资源为电层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的时隙资源。 [0039] If the reserved resource is resource layer, reserve resources for the current bi-directional label switched path, if the label switched path and a bidirectional current path segments bidirectional resource reservation label switched path exists has been overlapping, the complex time slot resources have been reserved for the path segment coincident.

[0040] 上述装置还可具有以下特点,所述资源预留模块对各重合的路径段进行资源复用包括: [0040] The apparatus may be further characterized, for each module the resource reservation path segments overlapped resource reuse comprising:

[0041] 如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的外部光层链路的波长资源。 [0041] If the reserved resources for an optical layer resources, to reserve resources for the current bi-directional label switched path, if the current and bi-directional label switched path LSP has bidirectional resource reservation path segments exist overlapped, the complex wavelength using an external link resource has been reserved for the light absorbing layer overlaps the path segment.

[0042] 上述装置还可具有以下特点,所述资源预留模块还用于:如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和己进行资源预留的双向标签交换路径存在重合的路径段,复用所述重合的路径段上的节点内部的资源。 [0042] The apparatus may be further characterized, the resource reservation module is further configured to: if the reserved resources for an optical layer resources, to reserve resources for the current bi-directional label switched path, if the label switched path and a bidirectional current-hexyl presence overlapping resource reservation bidirectional LSP path section, multiplex on resources within the node coinciding with the path segment.

[0043] 上述装置还可具有以下特点,所述路径确定模块还用于: [0043] The apparatus may be further characterized, the path determination module is further configured to:

[0044] 确定所述当前域到其相邻域的双向标签交换路径时,如果路径约束满足预设条件,选择彼此之间重合的路径段最多的双向标签交换路径。 When [0044] the bi-directional label switched path determines the current domain to its neighboring domain, path constraint if the preset condition is met, most of bi-directional label switched to select paths to coincide with each other path segments.

[0045] 上述装置还可具有以下特点,所述预设条件包括:对资源利用率要求高于对路径最优性要求和/或所述当前域的可用资源低于资源阈值。 [0045] The apparatus may be further characterized, the preset condition comprises: higher than the optimum available resource requirements and / or the current path domain resource threshold value is lower than the resource utilization requirements.

[0046] 上述装置还可具有以下特点,所述装置还包括:路径传输模块,其中: [0046] The device may also have the following characteristics, said apparatus further comprising: a module transmission path, wherein:

[0047] 所述路径确定模块确定所述当前域到其相邻域的双向标签交换路径为:确定所述当前域到其下一域的双向标签交换路径,所述下一域为与所述当前域相邻且靠近所述目的节点的域; [0047] The path determination module determines that the current domain to its adjacent domains bi-directional label switched path: determining the current domain LSP to the bidirectional its next field, the next field is the close to the current field and the adjacent destination node domain;

[0048] 所述路径确定模块还用于,当所述当前域为不包括所述源节点的域时,确定所述当前域到其下一域的双向标签交换路径后,生成虚拟最短路径树; After [0048] The path determining module is further configured, when the current domain does not include the source node domain, determines the current domain LSP to the bidirectional its next field, generating a virtual shortest path tree ;

[0049] 所述路径传输模块用于,当所述当前域为不包括所述源节点的域时,判断所述虚拟最短路径树的叶子节点是否为所述当前域的节点,如果不是,删除所述虚拟最短路径树中所述非当前域的叶子节点的分支后,将所述虚拟最短路径树发送给所述当前域的前一域的路径计算单元;所述当前域的前一域是与所述当前域相邻且靠近所述源节点的域。 [0049] The path for the transmission module, when the current domain does not include the source node domain, determines a virtual shortest path tree node is a leaf node of the current domain, if not, deleting after the branch virtual shortest path tree leaf nodes in the domain of the non-current, the virtual shortest path tree path to a previous domain of the current domain calculation unit; previous field of the current field is adjacent to the current domain, and close to the source node domain.

[0050] 上述装置还可具有以下特点,所述路径传输模块还用于,当所述当前域为不包括所述目的节点的域时,将所述虚拟最短路径树中非所述当前域的叶子节点对应的分支路由发送给所述当前域的下一域的路径计算单元,以使所述下一域的路径计算单元释放所述分支路由对应的预留资源。 [0050] The apparatus may be further characterized, the path transmission module is further configured to, when the current domain does not include the destination node domain, the virtual shortest path tree to the current domain Africa leaf node corresponding to the branch paths routed to the current field to the next calculation unit, so that the path of the next domain calculation unit releases the reserved resources corresponding to the branch route.

[0051] 本申请包括以下优点: [0051] The present application includes the following advantages:

[0052] 1)进行资源预留时,对VSPT⑴中各分支的重合路径段进行资源复用,减少了资源占用。 [0052] 1) When the resource reservation for VSPT⑴ in each branch path segment coincides resource reuse, resource consumption is reduced.

[0053] 2)在计算路径时,在路径约束满足预设条件时,选择彼此之间重合路径段最多的双向LSP。 [0053] 2) when calculating the path, the path when the constraint preset condition is satisfied, selecting the largest overlap each other bidirectional LSP path segment. 预设条件包括:对资源利用率要求高于对路径最优性要求和/或当前域可用资源低于资源阈值。 Preset condition comprising: a path above the optimal requirements and / or below the current threshold domain resources available resources on resource utilization requirements. 该方案使得VSPT (i)中各分支路径尽量重合;由于重合路径段会复用同一份资源,这样就进一步降低了对重复路径上资源数量的要求,提高了计算成功率;同时减少了在各域的预留资源,提高了各域的资源利用率。 This scheme enables VSPT (i) in each branch path as much as possible coincide; as coincident path segment will be multiplexed with a resource, thus further reducing the required number of resources on the repeated route, to improve the calculation of the success rate; while reducing in the reserve resources field, improved resource utilization of each domain.

[0054] 3)由于增加了对VSPT⑴的检查,对于VSPT⑴中的无用分支向上游传递时进行了删减,同时通知无用分支上的PCE释放分支路径上的预留资源,缩短了资源预留时间。 [0054] 3) due to increased inspection VSPT⑴ performs when transmitting upstream branch for VSPT⑴ the deletion of useless, while notifying the PCE branch unwanted release the reserved resources on the branch path, the resource reservation time shortened .

附图说明 BRIEF DESCRIPTION

[0055] 图1是BRPC算法计算过程中的VSPT树示意图; [0055] FIG. 1 is a schematic view of tree BRPC VSPT algorithm processes;

[0056] 图2是本发明所有实施例的域⑴及VSPT (i+1)的拓扑示意图; [0056] FIG. 2 is a ⑴ all domains and VSPT (i + 1) is a schematic view of an embodiment of the invention, topology;

[0057] 图3是实施例一的计算路径示意图; [0057] FIG. 3 is a schematic diagram of a calculation path of the embodiment;

[0058] 图4是实施例一的计算结果VSPT⑴示意图; [0058] FIG. 4 is a diagram of a calculation result of VSPT⑴ schematic embodiment;

[0059] 图5是实施例二的计算路径示意图; [0059] FIG. 5 is a schematic diagram of the computation of a path according to a second embodiment;

[0060] 图6是实施例二未删减叶子节点的VSPT (i)示意图; [0060] FIG. 6 is a deletion of two non-leaf node VSPT (i) a schematic embodiment;

[0061] 图7是实施例二的计算结果VSPT⑴示意图; [0061] FIG. 7 is a schematic view VSPT⑴ calculation result according to the second embodiment;

[0062] 图8是实施例三的计算路径示意图; [0062] FIG. 8 illustrates a calculation of the path according to a third embodiment;

[0063] 图9是实施例三未删减叶子节点的VSPT⑴示意图; [0063] FIG. 9 is a schematic diagram of three VSPT⑴ not cut leaf node embodiment;

[0064] 图10是实施例三的计算结果VSPT⑴示意图; [0064] FIG. 10 is a calculation result according to a third embodiment of a schematic VSPT⑴;

[0065] 图11是本发明实施例路由计算装置框图。 [0065] FIG. 11 is a block diagram of a route calculation apparatus embodiment of the present invention.

具体实施方式 detailed description

[0066] 为使本发明的目的、技术方案和优点更加清楚明白,下文中将结合附图对本发明的实施例进行详细说明。 [0066] To make the objectives, technical solutions, and advantages of the present invention will become apparent from, the accompanying drawings hereinafter in conjunction with embodiments of the present invention will be described in detail. 需要说明的是,在不冲突的情况下,本申请中的实施例及实施例中的特征可以相互任意组合。 Incidentally, in the case of no conflict, embodiments and features of the embodiments of the present application may be arbitrarily combined with each other.

[0067] 另外,虽然在流程图中不出了逻辑顺序,但是在某些情况下,可以以不同于此处的顺序执行所示出或描述的步骤。 [0067] Further, although not the logical order in the flowchart, but in some cases, the steps shown or may be performed in a different order than described herein.

[0068]本发明实施例提供一种路由计算方法,应用于源节点到目的节点的路由计算中, 源节点到目的节点包括多个域,包括: [0068] The embodiments of the present invention provides a method for route calculation, route calculation applied to the source node to the destination node, the source node to the destination node comprises a plurality of fields, comprising:

[0069]当前域的路径计算单元确定所述当前域到其相邻域的双向标签交换路径; [0069] The current domain path computation unit determines the current domain to its adjacent domains bidirectional label switched path;

[0070] 为所述双向标签交换路径进行资源预留,其中,如果各双向标签交换路径中存在重合的路径段,则对各重合的路径段进行资源复用。 [0070] The resource reservation for said bidirectional LSP, wherein, if the path segment is present in each of the bidirectional overlapped label switched path, for each path segment overlap multiplexed resource.

[0071] 在本实施例的一种备选方案中,通过如下方式对各重合的路径段进行资源复用: [0071] In an alternative embodiment according to the present embodiment, the resource multiplex overlap each path segment by:

[0072] 如果预留的资源为电层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和己进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的时隙资源。 [0072] If the reserved resource is resource layer, reserve resources for the current bi-directional label switched path LSP if a bidirectional current hexyl and overlap exists for resource reservation bidirectional LSP path segment, the reuse slot already reserved resources for overlapping path segments.

[0073]在本实施例的一种备选方案中,通过如下方式对各重合的路径段进行资源复用: [0074]如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和己进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的外部光层链路的波长资源。 [0073] In an alternative embodiment according to the present embodiment, the resource multiplex overlap each path segment by: [0074] If the reserved resources for an optical layer resources, the resources for the current bi-directional label switched path when reserving, if the bi-directional label switched path and the current already exist for bidirectional resource reservation overlapping LSP path segment, the wavelength multiplex link layer resources external light has been reserved for the path segment coincident.

[0075] 在本实施例的一种备选方案中,如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,复用所述重合的路径段上的节点内部的资源。 [0075] An alternative embodiment in the present embodiment, the reserved resources if the optical layer resources, to reserve resources for the current bi-directional label switched path, if the current LSP and bidirectional resource reservation has overlap exists bidirectional LSP path section, multiplex on resources within the node coinciding with the path segment.

[0076] 在本实施例的一种备选方案中,确定所述当前域到其相邻域的双向标签交换路径时,如果路径约束满足预设条件,选择彼此之间重合的路径段最多的双向标签交换路径。 [0076] An alternative embodiment of the present embodiment, it is determined when the bidirectional LSP domain to current domain adjacent, path constraint if the preset condition is satisfied, selecting a path between the segments overlap each other the most bi-directional label switched path.

[0077] 其中,所述预设条件包括但不限于:对资源利用率要求高于对路径最优性要求和/ 或所述当前域的可用资源低于资源阈值。 [0077] wherein said predetermined conditions include, but are not limited to: the optimum available resource requirements above and / or below the path of the current domain resource threshold value of resource utilization requirements.

[0078] 在本实施例的一种备选方案中,所述确定所述当前域到其相邻域的双向标签交换路径为:确定所述当前域到其下一域的双向标签交换路径,所述下一域为与所述当前域相邻且靠近所述目的节点的域; [0078] In an alternative embodiment of the present embodiment, the determination of the current domain to its adjacent domains bi-directional label switched path: determining the current domain LSP to the bidirectional its next field, the next field is adjacent to the current domain and adjacent to the destination node domain;

[0079] 当所述当前域为不包括所述源节点的域时,所述方法还包括: [0079] when the current domain does not include the source node domain, the method further comprising:

[0080] 确定所述当前域到其下一域的双向标签交换路径后,生成虚拟最短路径树; [0080] After determining the current domain LSP to the bidirectional its next field, generating a virtual shortest path tree;

[0081] 判断所述虚拟最短路径树的叶子节点是否为所述当前域的节点,如果不是,删除所述虚拟最短路径树中所述非当前域的叶子节点的分支后,将所述虚拟最短路径树发送给所述当前域的前一域的路径计算单元;所述当前域的前一域是与所述当前域相邻且靠近所述源节点的域。 Whether [0,081] Analyzing the virtual shortest path tree leaf node as the node of the current domain, if not, deleting the leaf node of a virtual branch of the shortest path tree in the non-current domain, the virtual shortest the path tree path to a previous domain of the current domain calculation unit; previous field of the current field is adjacent to the current domain, and close to the source node domain.

[0082] 在本实施例的一种备选方案中,所述当前域为不包括所述目的节点的域时,所述方法还包括:将所述虚拟最短路径树中非所述当前域的叶子节点对应的分支路由发送给所述当前域的下一域的路径计算单元,以使所述下一域的路径计算单元释放所述分支路由对应的预留资源。 When [0082] An alternative embodiment of the present embodiment, the current domain is a domain does not include the destination node, the method further comprising: the virtual shortest path tree to the current domain Africa leaf node corresponding to the branch paths routed to the current field to the next calculation unit, so that the path of the next domain calculation unit releases the reserved resources corresponding to the branch route.

[0083] 下面以在现有的RFCS441中定义的BRPC算法中应用本发明为例进一步说明本发明。 [0083] In the following the algorithm defined in BRPC conventional RFCS441 in the present invention is applied as an example to further illustrate the present invention. 但本发明不限于此。 However, the present invention is not limited thereto.

[0084] 下面选择修改完善后的BRPC反向递归计算实施例来具体说明在跨域路径计算中如何应用本发明方法,减少BRPC过程中资源的预留及资源释放。 [0084] Next, the modified selection BRPC improve backward recursion calculation examples are provided to illustrate how to apply the method of the present invention in a cross-domain path computation, the reduction of the reserved resource and releasing resources BRPC process. 本文中实施例仅描述PCE (i)的计算过程,在该计算过程中,域间链路和域内链路拓扑作为一个整体进行计算。 Embodiments described herein, only PCE (i) calculation process, the calculation process, and the inter-domain link within the link topology is calculated as a whole.

[0085] 该方法包括: [0085] the method comprising:

[0086] 步骤101:对于i = n到2,PCE(i)根据计算请求中携带的路径约束(如代价最小、资源利用率等)计算VSPT(i)。 [0086] Step 101: For i = n to 2, PCE (i) is calculated VSPT (i) is calculated according to the path carried in the request constraints (e.g., minimum cost, resource utilization, etc.).

[0087]其中,在路径约束满足预设条件时,: [0087] wherein, in the path constraint satisfies a preset condition:

[0088] 本实施例中,预设条件包括:对资源利用率要求高于对路径最优性要求或者本域可用资源小于资源阈值; [0088] In this embodiment, the predetermined condition comprises: the resource utilization requirements than optimal path requests, or the present field is less than the available resources, resource threshold value;

[0089] 具体的: [0089] Specifically:

[0090]若路径计算请求中携带的路径约束中对资源利用率要求高于对路径最优性要求或者本域可用资源小于资源阈值时,则PCE⑴计算VSPT⑴时,保证VSPT⑴中的各分支的路径的尽量重合(如计算第i条分支路径时采用调整前i-1条路径代价的方式,使得第i条路径与前i-1条路径重合。实现的方式很多,不局限于此例举的方式),执行步骤102; When [0090] If the path computation request carries a path constraint on resource utilization in the above requirements, or requirements for the optimal path according to the present field is less than the available resources, resource threshold value, when the calculated VSPT⑴ PCE⑴, to ensure that the path of each branch VSPT⑴ coincide as much as possible (i-1 before adjustment using the path cost manner when computing the i th branch path, such that the i th path coincident with the path before i-1. manner, many, not limited to this exemplified mode), step 102 is executed;

[0091]若路径计算请求中携带的路径约束中无对资源利用率的要求或者本域可用资源大于资源阈值时,则PCE⑴按照一般BRPC算法过程计算VSPT⑴,执行步骤102; [0091] If the path computation request carrying path constraint is no requirement for resource utilization is greater than the available resources or the domain of resource threshold value, the calculation PCE⑴ VSPT⑴, step 102 is performed following the general procedure BRPC algorithm;

[0092] 步骤102:对计算得到的m条路径进行资源预留; [0092] Step 102: m for the calculated path reserve resources;

[0093]对于路径j = l到m:PCE (i)对第j条分支路径(包括本域域内路径和下游域之间的域间路径)进行资源预留时,需判断第j条分支路径与前j-1条分支是否存在重合路径段。 [0093] For the path j = l to m: when PCE (i) of the j-th branch path (including the inter-domain route path between the domain and the domain of the downstream domain) reserves resources required determines the j-th branch path whether there is a path coincident with the front section of branch j-1. 若存在重合路径段,则根据资源层次分别处理: If the path segments exist overlapped, the process according to the resource level, respectively:

[0094]若为电层资源,则不再对重合路径段进行电层资源(即时隙)的预留,而是复用前面己为该重合路径段预留的时隙资源; [0094] When the reservation is no longer coincide path segment layer dielectric layer resources as resources (time slots), but the complex slot resource overlap with the previously reserved path segment that has;

[0095]若为光层资源,则对外部光层链路的波长资源进行复用(复用前面已为该重合路径段预留的波长资源),同时对节点内部的资源(比如光电转换器,内部光纤、合分波器)也尽量复用,不再对j条分支路径上资源进行预留。 [0095] When a light layer resources, the external light of wavelength resources link layer multiplexing (wavelength multiplexing resources previously reserved for the path segment coincident), while internal node resources (such as photoelectric converter , inner fiber, multiplexing and demultiplexing device) is also possible reuse, j no longer branch paths on resource reservation.

[0096] 步骤103:对于i=n到1: [0096] Step 103: For i = n to 1:

[0097] PCE⑴计算产生VSPT⑴后,对VSPT⑴进行检查,如果VSPT⑴中存在叶子节点为非本域的节点,则将非本域的叶子节点在VSPT⑴上的分支路径通过PCEP协议带回给PCE (i + 1),以通知PCE (i+1)对该分支路径上的预留资源进行释放,同时PCE⑴将此叶子节点对应的分支从VSPT (i)删除,将已删除相关分支的VSPT (i)发送给PCE (i-1)。 [0097] PCE⑴ calculated to produce the VSPT⑴, VSPT⑴ to check if the non-leaf node of the local domain node exists in VSPT⑴, then the non-leaf node of this branch path on VSPT⑴ domain back to the PCE through the PCEP (i + 1), to notify the PCE (i + 1) for the release of reserved resources on a branch path, while the leaf nodes corresponding to this PCE⑴ remove branches from the VSPT (i), the correlation branches VSPT (i deleted) sent to PCE (i-1). 其中,一棵树当中没有子节点(即度为0)的节点,称为叶子节点,简称“叶子”。 Wherein none of the child nodes of a tree (i.e., 0 degrees) and a node, called a leaf node, referred to as "leaves." 叶子是指度为0的节点,又称为终端节点。 It refers leaf node of degree 0, also known as a terminal node.

[0098]下面通过具体实施例进一步说明本发明。 [0098] The present invention is further illustrated by the following specific examples.

[00"]实施例一:无对资源利用率的要求,电层计算 [00 "] Example a: no requirement for resource utilization, the dielectric layer is calculated

[0100]本实施例描述了计算请求中无对资源利用率要求的BRPC计算过程。 [0100] This example describes the calculation process of calculating BRPC no request for resource utilization requirements. 下面参照图2 所示场景(假定此场景下链路均为电层)给出本实施例具体实施过程的描述。 The following (assuming the link layer in this scenario are) given the present description of embodiments with reference to the specific implementation scenario shown in FIG. 2.

[0101]图2中给出了AS ⑴和VSPT (i+1) JN为目的节点,BN-en (1,i+1)、BN-en (2,i+1)和BN-en (3,i+1)为VSPT (i+1)的叶子节点即AS (i+1)的入口边界节点,BN-en (1,i)、BN-en (2, i)和BN-en (3,i)为AS⑴的入口边界节点,BN-ex (1,i)和BN-ex (2,i)为AS⑴的出口边界节点。 In [0101] FIG. 2 shows the AS ⑴ and VSPT (i + 1) JN destination node, BN-en (1, i + 1), BN-en (2, i + 1) and BN-en (3 , i + 1) is VSPT (i + 1) of the leaf nodes i.e. aS (i + 1) of the ingress edge node, BN-en (1, i), BN-en (2, i) and BN-en (3 , i) to the ingress border node AS⑴, BN-ex (1, i) and BN-ex (2, i) for the exit boundary node AS⑴. 现在需要建立从DN到AS⑴入口边界节点的最短路径树,形成VSPT (i),结合BRPC算法和本发明方法,计算过程如下: Now need to build the shortest path tree from the entry border node DN to AS⑴ formed VSPT (i), in conjunction with the present invention, methods and algorithms BRPC, calculated as follows:

[0102] (1) PCE⑴检查域序列,发现本域是中间域。 [0102] (1) PCE⑴ check sequence field, this field is found in the middle of the domain. 检查路径计算请求发现无对资源利用率的要求,PCE⑴通过一般的BRPC算法计算从AS⑴的入口边界节点(BN-en (1,i)、BN-en (2,i)和BN_en (3,i))到AS (i+1)的入口边界节点(BN-en (1,i+1)、BN-en (2, i+1)和BN-en (3, i+1))的双向LSP路径(计算结果如图3所示)。 A path computation request check found no requirement for resource utilization, PCE⑴ BRPC by a general algorithm from the ingress border node AS⑴ (BN-en (1, i), BN-en (2, i), and BN_en (3, i )) entrance boundary node (BN-en (1, i + 1) to AS (i ​​+ 1) is, BN-en (2, i + 1) and BN-en (3, i + 1)) of the bidirectional LSP path (results shown in FIG. 3). 其中入口边界节点BN-en(l,i)、BN-en(2,i)和BN-en (3,i)对应的LSP分别为: Wherein the inlet boundary node BN-en (l, i), BN-en (2, i) and BN-en (3, i) respectively corresponding to the LSP:

[0103] LSP ⑴:BN-en (1,i) -R2-R3-BN-ex (1,i) -BN-en (1,i+1)、 [0103] LSP ⑴: BN-en (1, i) -R2-R3-BN-ex (1, i) -BN-en (1, i + 1),

[0104] LSP ⑵:BN-en (2,i) -R2-R3-BN-ex (1,i) -BN-en (2,i+1)、 [0104] LSP ⑵: BN-en (2, i) -R2-R3-BN-ex (1, i) -BN-en (2, i + 1),

[0105] LSP ⑶:BN-en (3,i) -Rl-BN-ex (2,i) -BN-en (3,i+1) 〇 [0105] LSP ⑶: BN-en (3, i) -Rl-BN-ex (2, i) -BN-en (3, i + 1) square

[0106] (2) PCE⑴对计算出的双向LSP路径进行资源预留。 [0106] (2) PCE⑴ the calculated resource reservation bidirectional LSP path. PCE (i)首先对路径LSP⑴进行资源预留,然后对路径LSP (2)进行资源预留时,先将路径LSP (2)与LSP (1)进行对比,判断两条路径是否存在重合路径。 PCE (i) first LSP⑴ path reserve resources, then the path LSP (2) for resource reservation, the first path LSP (2) to LSP (1) for comparison, it is determined whether or not there are two paths coincide path. 本实施例中路径段R2-R3-BN-ex(l,i)是重合路径,且为电层路径。 Example path segment R2-R3-BN-ex (l, i) of the present embodiment are coincident paths, and the paths for the dielectric layer. PCE (i)对LSP (2)资源预留时只针对非重合路径段进行,不再对路径段R2-R3进行预留, 而是复用LSP (1)中已经预留的电层资源(时隙)iCE (i)对LSP (3)进行电层资源预留,将LSP (3)的路径分别与LSP (1)和LSP (2)进行比对,判断是否存在重合路径,此场景无重合路径, 则无需复用操作; PCE (i) of the LSP (2) only when the resource reservation for a non-coincidence path segments, path segments no longer be reserved R2-R3, but the multiplexing resources dielectric layer LSP (1) has been reserved ( slot) the iCE (I) of the LSP (3) electrically resource reservation layer, LSP (3), respectively, a path for comparison, and determines whether there is a coincident path LSP (1), and LSP (2), this scenario no coincident paths, no multiplexing operation;

[0107] ⑶PCE⑴对VSPT⑴进行检查,发现叶子节点均为本域入边界节点,无需对VSPT (i)进行删减,同时将新生成的VSPT (i)(如图4所示)向前发送给PCE (i-1)。 [0107] ⑶PCE⑴ of VSPT⑴ was discovered leaf node into the domain boundary nodes are present, without the need for VSPT (i) for exclusion, while the newly generated VSPT (i) (FIG. 4) to a forward PCE (i-1).

[0108] 实施例二:有对资源利用率的要求,电层计算 [0108] Second Embodiment: YES requirements of resource utilization, the dielectric layer is calculated

[0109] 本实施例描述了路径计算请求中有对资源利用率要求的BRPC计算过程。 [0109] The present embodiment has been described in the request for resource utilization BRPC path computation requirements of the computing process. 下面参照图2所示场景(假定此场景下链路均为电层)给出本实施例具体实施过程的描述。 The following (assuming the link layer in this scenario are) given the present description of embodiments with reference to the specific implementation scenario shown in FIG. 2.

[0110]图2中给出了AS ⑴和VSPT (i+1) AN为目的节点,BN-en (1,i+1)、BN-en (2,i+1)和BN-en (3,i+1)为VSPT (i+1)的叶子节点即AS (i+1)的入口边界节点,BN-en (1,i)、BN-en (2, i)和BN-en (3,i)为AS⑴的入口边界节点,BN-ex (1,i)和BN-ex (2,i)为AS⑴的出口边界节点。 In [0110] FIG. 2 shows the AS ⑴ and VSPT (i + 1) AN destination node, BN-en (1, i + 1), BN-en (2, i + 1) and BN-en (3 , i + 1) is VSPT (i + 1) of the leaf nodes i.e. aS (i + 1) of the ingress edge node, BN-en (1, i), BN-en (2, i) and BN-en (3 , i) to the ingress border node AS⑴, BN-ex (1, i) and BN-ex (2, i) for the exit boundary node AS⑴. 现在需要建立从DN到AS (i)入口边界节点的最短路径树,形成VSPT (i),结合BRPC算法和本发明方法,计算过程如下: (1) PCE (i)检查域序列,发现本域是中间域。 Now need to establish from DN to AS (i) the shortest path tree entry border node formed VSPT (i), binding BRPC algorithms and methods of the present invention, is calculated as follows: (1) PCE (i) checking domain sequence, found this domain the middle domain. 检查计算请求发现有对资源利用率的要求,PCE⑴计算从AS⑴的入口边界节点(BN-en (1,i)、BN-en (2,i)和BN-en (3,i))到AS (i +1)的入口边界节点(BN-en (1,i+1)、BN-en (2,i+1)和BN-en (3,i+1))的双向LSP路径保证三条LSP尽量重合(计算结果如图5所示)。 Found Check computation request resource utilization requirements, PCE⑴ calculated from the entry border node AS⑴ (BN-en (1, i), BN-en (2, i) and BN-en (3, i)) to the AS (i +1) inlet boundary node (BN-en (1, i + 1), BN-en (2, i + 1) and BN-en (3, i + 1)) to ensure the three bidirectional LSP paths LSP try to coincide (the calculation result shown in FIG. 5). 其中入口边界节点BN-en (l,i)、BN-en (2, i)和BN-en (3,i)对应的LSP分别为: Wherein the inlet boundary node BN-en (l, i), BN-en (2, i) and BN-en (3, i) respectively corresponding to the LSP:

[0112] LSP ⑴:BN-en (1,i) -R2-R3—BN-ex (1,i) 一BN-en (1,i+1)、 [0112] LSP ⑴: BN-en (1, i) -R2-R3-BN-ex (1, i) a BN-en (1, i + 1),

[0113] LSP ⑵:BN-en (2,i) -R2-R3-BN-ex (1,i) -BN-en (1,i+1)、 [0113] LSP ⑵: BN-en (2, i) -R2-R3-BN-ex (1, i) -BN-en (1, i + 1),

[0114] LSP ⑶:BN-en (3,i) -R2-R3-BN-ex (1,i) —BN-en (1,i+1) 〇 [0114] LSP ⑶: BN-en (3, i) -R2-R3-BN-ex (1, i) -BN-en (1, i + 1) square

[0115] ⑵PCE⑴对计算出的双向LSP路径进行资源预留。 [0115] ⑵PCE⑴ the calculated resource reservation bidirectional LSP path.

[0116] PCE⑴首先对路径LSP (1)进行资源预留; [0116] PCE⑴ first path LSP (1) for resource reservation;

[0117] 然后对路径LSP (2)进行资源预留时,先将路径LSP (2)与LSP (1)进行对比,判断两条路径是否存在重合路径。 When [0117] then the path LSP (2) for resource reservation, the first path LSP (2) to LSP (1) for comparison, it is determined whether or not there are two paths coincide path. 在这个实施例中路径段R2-R3-BN-ex (1,i)和域间链路BN-ex (1, i) -BN-en (1,i+1)是重合路径,且为电层资源。 In this embodiment the path segment R2-R3-BN-ex (1, i) and the inter-domain link embodiment BN-ex (1, i) -BN-en (1, i + 1) are coincident paths, and the electrical layer resources. PCE⑴对LSP⑵电层资源(时隙)预留时只针对非重合路径段进行,不再对路径段R2-R3-BN-ex (1,i)和域间链路BN-ex (1,i) -BN-en (1,i +1)进行预留,而是复用LSP (1)中已经预留的资源。 PCE⑴ only when LSP⑵ layer resources (time slots) reserved for non-coincident path segments, no path segment R2-R3-BN-ex (1, i) and the inter-domain link BN-ex (1, i ) -BN-en (1, i +1) for the reservation, but multiplexing LSP (1) has been reserved resources.

[0118] PCE⑴对LSP (3)进行资源预留,将LSP (3)的路径分别与LSP (1)和LSP (2)进行比对,判断是否存在重合路径段,对重合路径段部分复用LSP (1)和LSP (2)的资源; [0118] PCE⑴ of LSP (3) resource reservation, the LSP (3) paths are aligned with each LSP (1), and LSP (2), determines whether the path segments exist overlapped, portion of the multiplex overlap path segment LSP (1), and LSP (2) of the resource;

[0119] ⑶PCE⑴对如图6所示的VSPT⑴进行检查,发现叶子节点BN-en (2, i+1)、BN-en (3,i+1)为非本域节点,将节点BN-en (2,i+1)和BN-en (2,i+1)在VSPT (i)对应的分支路由通过ERO 序列卿ERO:BN-en(2,i+l)_. • DN 和BN-en(3,i+l)-…-…-DN)携带在PCEP消息中发送给PCE (i+1)通知释放对应的预留资源;当然,也可以采用其他方式,通过其他消息将BN-en (2, i+1)和BN-en (2, i+1)在VSPT⑴对应的分支路由发送给PCE (i+1)。 [0119] ⑶PCE⑴ of VSPT⑴ shown in Figure 6, it was discovered leaf nodes BN-en (2, i + 1), BN-en (3, i + 1) of the present non-domain node, the node BN-en (2, i + 1) and BN-en (2, i + 1) in the VSPT (i) routed through the branch corresponding sequence Qing ERO ERO: BN-en (2, i + l) _ • DN and BN-. en (3, i + l) - ... - ... -DN) carried in the PCEP message is sent to PCE (i + 1) corresponding to the notification releasing the reserved resources; of course, can also be used in other ways, by other message BN- en (2, i + 1) and BN-en (2, i + 1) is sent to PCE (i + 1) corresponding to the branch route VSPT⑴.

[0120] ⑷PCE⑴删除VSPT⑴中对应节点BN-en (2, i+1)和BN-en (3, i+1)的分支,将新生成的VSPT(i)(如图7所示)向前发送给PCE(il)。 [0120] ⑷PCE⑴ VSPT⑴ corresponding deletion branch node BN-en (2, i + 1) and BN-en (3, i + 1), the newly generated VSPT (i) (FIG. 7) forward sent to the PCE (il).

[0121]实施例三:有对资源利用率要求、光层计算 [0121] Third Embodiment: YES resource utilization requirements, the optical layer is calculated

[0122] 本实施例描述了计算请求中有对资源利用率要求的BRPC计算过程。 [0122] This example describes the calculation for the request has BRPC resource utilization requirements of the computing process. 下面参照图2 所示场景(假定此场景下链路均为光层)给出本实施例具体实施过程的描述。 The following (assuming the link layer are light in this scenario) given the present description with reference to the specific embodiment of the process embodiment shown in FIG. 2 scenario.

[0123]图2中给出了AS ⑴和VSPT (i+1) JN为目的节点,BN-en (1,i+1)、BN-en (2,i+1)和BN-en (3,i+1)为VSPT (i+1)的叶子节点即AS (i+1)的入口边界节点,BN-en (1,i)、BN-en (2, i)和BN-en (3,i)为AS⑴的入口边界节点,BN-ex (1,i)和BN-ex (2,i)为AS⑴的出口边界节点。 In [0123] FIG. 2 shows the AS ⑴ and VSPT (i + 1) JN destination node, BN-en (1, i + 1), BN-en (2, i + 1) and BN-en (3 , i + 1) is VSPT (i + 1) of the leaf nodes i.e. aS (i + 1) of the ingress edge node, BN-en (1, i), BN-en (2, i) and BN-en (3 , i) to the ingress border node AS⑴, BN-ex (1, i) and BN-ex (2, i) for the exit boundary node AS⑴. 现在需要建立从DN到AS⑴入口边界节点的最短路径树,形成VSPT⑴,结合BRPC算法和本发明方法,计算过程如下: Now we need to build the shortest path tree from the entry border node DN AS⑴ to form VSPT⑴, binding BRPC algorithms and methods of the present invention, calculated as follows:

[0124] ⑴PCE⑴检查域序列,发现本域是中间域。 [0124] ⑴PCE⑴ check sequence field, this field is found in the middle of the domain. 检查计算请求发现有对资源利用率的要求,PCE⑴计算从AS⑴的入口边界节点(BN-en (1,i)、BN-en (2,i)和BN-en (3,i))到AS (i + 1)的入口边界节点(BN-en (1,i+1)、BN-en (2,i+1)和BN-en (3,i+1))的双向LSP路径保证三条LSP尽量重合(计算结果如图8所示)。 Found Check computation request resource utilization requirements, PCE⑴ calculated from the entry border node AS⑴ (BN-en (1, i), BN-en (2, i) and BN-en (3, i)) to the AS (i + 1) inlet boundary node (BN-en (1, i + 1), BN-en (2, i + 1) and BN-en (3, i + 1)) of the bidirectional LSP paths guaranteed three LSP try to coincide (the calculation result shown in FIG. 8). 其中入口边界节点BN-en (1,i)、BN-en (2,i)和BN-en (3,i)对应的LSP分别为: Wherein the inlet boundary node BN-en (1, i), BN-en (2, i) and BN-en (3, i) respectively corresponding to the LSP:

[0125] LSP ⑴:BN-en (1,i) -R2-R3-BN-ex (1,i) -BN-en (1,i+1)、 [0125] LSP ⑴: BN-en (1, i) -R2-R3-BN-ex (1, i) -BN-en (1, i + 1),

[0126] LSP ⑵:BN-en (2, i) -R2-R3-BN-ex (1,i) -BN-en (1,i+1)、 [0126] LSP ⑵: BN-en (2, i) -R2-R3-BN-ex (1, i) -BN-en (1, i + 1),

[0127] LSP ⑶:BN-en (3, i) -R2-R3_BN-ex (1,i) -BN-en (1,i+1) 〇 [0127] LSP ⑶: BN-en (3, i) -R2-R3_BN-ex (1, i) -BN-en (1, i + 1) square

[0128] ⑵PCE⑴对计算出的双向LSP路径进行资源预留。 [0128] ⑵PCE⑴ the calculated resource reservation bidirectional LSP path.

[0129] PCE⑴首先对路径LSP (1)进行资源预留; [0129] PCE⑴ first path LSP (1) for resource reservation;

[0130] 然后对路径LSP (2)进行资源预留时,先将路径LSP (2)与LSP (1)进行对比,判断两条路径是否存在重合路径段。 When [0130] then the path LSP (2) for resource reservation, the first path LSP (2) to LSP (1) for comparison, it is determined whether the two paths coincide path segments exist. 在这个用例中路径段R2-R3-BN-ex (1,i)和域间链路BN-ex (1, i) -BN-en (1,i+1)是重合路径段,且为光层资源。 In this embodiment the path segment with the R2-R3-BN-ex (1, i) and the inter-domain link BN-ex (1, i) -BN-en (1, i + 1) are coincident path segment, and a light layer resources. PCE⑴对LSP⑵外部光层链路资源(波长) 预留时只针对非重合路径段进行,不再对路径段R2-R3-BN-ex (1,i)进行。 PCE⑴ only for the non-coincidence of the path segments when the external light LSP⑵ link layer resources (wavelength) reserved no path segment R2-R3-BN-ex (1, i) for. 进一步,对重合节点内部的资源(如光电转换器等)是否重合也进行判断,尽量复用LSP (1)的资源(如光电转换器等),不再另外进行资源预留。 Further, the internal resources coincides node (e.g., photoelectric conversion, etc.) is also judged whether or overlapped, as far as possible multiplexing resources LSP (1) (e.g., photoelectric conversion, etc.), no additional resource reservation.

[0131] PCE⑴对LSP (3)进行资源预留,将LSP (3)的路径分别与LSP⑴和LSP (2)进行比对,判断是否存在重合路径段,对重合路径段复用LSP (1)和LSP (2)的资源; [0131] PCE⑴ of LSP (3) resource reservation, the LSP (3), respectively, to compare the path with LSP⑴ and LSP (2), determines whether the path segments exist overlapped on superposed path segments multiplex LSP (1) and LSP (2) of the resource;

[0132] (3) PCE⑴对图9所示的VSPT⑴进行检查,发现叶子节点BN-en (2, i+1)、BN-en (3, i+1)为非本域节点,将节点BN-en (2,i + 1)和BN-en (2,i+1)在VSPT⑴对应的分支路由通过已肋序列(即£肋:3}611(2,1+1)-...-...-0~和81611(3,1+1)-...-...-0吣携带在?0£卩消息中发送给PCE (i+1)通知释放对应的预留资源; [0132] (3) PCE⑴ of VSPT⑴ shown in FIG. 9, it was discovered leaf nodes BN-en (2, i + 1), BN-en (3, i + 1) of the present non-domain node, the node BN -en (2, i + 1) and BN-en (2, i + 1) corresponding to the branch route VSPT⑴ by the ribs has a sequence (i.e., the rib £: 3} 611 (2, 1 + 1) -...- ~ ...- 0 and 81611 (3,1 + 1) -...-...- 0 0 £ Qin carried to a (I + 1) corresponding to the reserved resources to release notification of PCE Jie message?;

[0133] ⑷PCE⑴删除VSPT⑴中对应节点BN-en (2, i+1)和BN-en (3, i+1)的分支,将新生成的VSPT(i)(如图10所示)向前发送给PCE(il)。 [0133] ⑷PCE⑴ VSPT⑴ corresponding deletion branch node BN-en (2, i + 1) and BN-en (3, i + 1), the newly generated VSPT (i) (Figure 10) forward sent to the PCE (il).

[0134]本发明实施例还提供一种路由计算装置,如图11所示,包括: [0134] Embodiments of the present invention further provides a route calculation means 11, comprising:

[0135] 路径确定模块,用于确定当前域到其相邻域的双向标签交换路径; [0135] path determining means for determining the current domain to its adjacent domains bidirectional label switched path;

[0136]资源预留模块,用于为所述双向标签交换路径进行资源预留,其中,如果各双向标签交换路径中存在重合的路径段,则对各重合的路径段进行资源复用。 [0136] Resource reservation module configured to reserve resources for said bi-directional label switched path, wherein, if the path segment is present in each of the bidirectional overlapped label switched path, for each path segment overlap multiplexed resource.

[0137]在本实施例的一种备选方案中,所述资源预留模块对各重合的路径段进行资源复用包括: [0137] In an alternative embodiment of the present embodiment, the resource reservation module for each resource multiplex overlap path segment comprises:

[0138] 如果预留的资源为电层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的时隙资源。 [0138] If the reserved resource is resource layer, reserve resources for the current bi-directional label switched path, if the label switched path and a bidirectional current path segments bidirectional resource reservation label switched path exists has been overlapping, the complex time slot resources have been reserved for the path segment coincident.

[0139] 在本实施例的一种备选方案中,所述资源预留模块对各重合的路径段进行资源复用包括: [0139] In an alternative embodiment of the present embodiment, the resource reservation module for each resource multiplex overlap path segment comprises:

[0140]如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,则复用己为该重合的路径段预留的外部光层链路的波长资源。 [0140] If the reserved resources for an optical layer resources, to reserve resources for the current bi-directional label switched path, if the current and bi-directional label switched path LSP has bidirectional resource reservation path segments exist overlapped, the complex It coincides with a path segment that has reserved resources external light wavelength link layer.

[0141] 该备选方案中,所述资源预留模块还用于:如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,复用所述重合的路径段上的节点内部的资源。 [0141] In this alternative embodiment, the resource reservation module is further configured to: if the reserved resources for the light absorbing layer resources, resource reservation, if the current and bi-directional label switched paths have been for the current bidirectional LSP resource reservation overlap exists bidirectional LSP path section, multiplex on resources within the node coinciding with the path segment.

[0142] 在本实施例的一种备选方案中,所述路径确定模块还用于: [0142] In an alternative embodiment of the present embodiment, the path determination module is further configured to:

[0143] 确定所述当前域到其相邻域的双向标签交换路径时,如果路径约束满足预设条件,选择彼此之间重合的路径段最多的双向标签交换路径。 When [0143] the bi-directional label switched path determines the current domain to its neighboring domain, path constraint if the preset condition is met, most of bi-directional label switched to select paths to coincide with each other path segments.

[0144] 所述预设条件包括:对资源利用率要求高于对路径最优性要求和/或所述当前域的可用资源低于资源阈值。 [0144] The preset condition comprises: higher than optimal path requirements and available resources or the current domain / resource threshold value is lower than the resource utilization requirements.

[0145] 在本实施例的一种备选方案中,所述装置还包括:路径传输模块,其中: [0145] In an alternative embodiment of the present embodiment, the apparatus further comprising: a module transmission path, wherein:

[0146] 所述路径确定模块确定所述当前域到其相邻域的双向标签交换路径为:确定所述当前域到其下一域的双向标签交换路径,所述下一域为与所述当前域相邻且靠近所述目的节点的域; [0146] The path determination module determines that the current domain to its adjacent domains bi-directional label switched path: determining the current domain LSP to the bidirectional its next field, the next field is the close to the current field and the adjacent destination node domain;

[0147] 所述路径确定模块还用于,当所述当前域为不包括所述源节点的域时,确定所述当前域到其下一域的双向标签交换路径后,生成虚拟最短路径树; After [0147] The path determining module is further configured, when the current domain does not include the source node domain, determines the current domain LSP to the bidirectional its next field, generating a virtual shortest path tree ;

[0148] 所述路径传输模块用于,当所述当前域为不包括所述源节点的域时,判断所述虚拟最短路径树的叶子节点是否为所述当前域的节点,如果不是,删除所述虚拟最短路径树中所述非当前域的叶子节点的分支后,将所述虚拟最短路径树发送给所述当前域的前一域的路径计算单元;所述当前域的前一域是与所述当前域相邻且靠近所述源节点的域。 [0148] The transmission path module is configured to, when the current domain does not include the source node domain, determines a virtual shortest path tree node is a leaf node of the current domain, if not, deleting after the branch virtual shortest path tree leaf nodes in the domain of the non-current, the virtual shortest path tree path to a previous domain of the current domain calculation unit; previous field of the current field is adjacent to the current domain, and close to the source node domain.

[0149] 该备选方案中,所述路径传输模块还用于,当所述当前域为不包括所述目的节点的域时,将所述虚拟最短路径树中非所述当前域的叶子节点对应的分支路由发送给所述当前域的下一域的路径计算单元,以使所述下一域的路径计算单元释放所述分支路由对应的预留资源。 [0149] In this alternative embodiment, the path transmission module is further configured to, when the current domain does not include the destination node domain, the virtual shortest path tree to the leaf node Africa current domain routing path branch corresponding to a current field of the next calculation unit, so that the path of the next domain calculation unit releases the reserved resources corresponding to the branch route.

[0150] 本发明还提供一种包括上述路由计算装置的设备,该设备可以是PCE。 [0150] The present invention further provides an apparatus comprising the above-described route calculation means, the apparatus may be a PCE.

[0151] 本申请所述方案可以应用到现有的采用BRPC算法计算跨域LSP路由的方案中,但不限于BRPC算法,通过其他算法进行LSP路由时,也可应用本申请。 [0151] The application of the present embodiment can be applied to existing cross-domain LSP routing scheme calculates the BRPC algorithm, but not limited to BRPC algorithm, when LSP routing through other algorithms can also be applied to the present application.

[0152] 本领域普通技术人员可以理解上述方法中的全部或部分步骤可通过程序来指令相关硬件完成,所述程序可以存储于计算机可读存储介质中,如只读存储器、磁盘或光盘等。 [0152] Those of ordinary skill in the art will be appreciated that the above-described method may be all or part of the steps by a program instructing relevant hardware is completed, the program may be stored in a computer-readable storage medium, such as read only memory, etc., magnetic or optical disk. 可选地,上述实施例的全部或部分步骤也可以使用一个或多个集成电路来实现。 Alternatively, all or part of the steps of the above-described embodiments may be implemented using one or more integrated circuits. 相应地,上述实施例中的各模块/单元可以采用硬件的形式实现,也可以采用软件功能模块的形式实现。 Accordingly, each module / unit in the above-described embodiments may be implemented in the form of hardware, software functional modules may also be implemented. 本发明不限制于任何特定形式的硬件和软件的结合。 The present invention is not limited to any specific combination of hardware and software form.

[0153]当然,本发明还可有其它多种实施例,在不背离本发明精神及其实质的情况下,熟悉本领域的技术人员当可根据本发明作出各种相应的改变和变形,但这些相应的改变和变形都应属于本发明所附的权利要求的保护范围。 [0153] Of course, the present invention may have a variety of other embodiments, without departing from the spirit and essence of the present invention, those skilled in the art can make various corresponding modifications and variations according to the present invention, but these corresponding changes and variations should fall within the scope of the appended claims. ~ ~

Claims (16)

  1. 1. —种路由计算方法,应用于源节点到目的节点的路由计算中,源节点到目的节点包括多个域,其特征在于,包括: 当前域的路径计算单元确定所述当前域到其相邻域的双向标签交换路径; 为所述双向标签交换路径进行资源预留,其中,如果各双向标签交换路径中存在重合的路径段,则对各重合的路径段进行资源复用。 1. - route calculation kinds route calculation method applied to the source node to the destination node, the source node to the destination node comprises a plurality of domains, wherein, comprising: a field calculation unit current path of the current domain to determine relative a bidirectional LSP neighborhood; reserve resources for said bi-directional label switched path, wherein, if the path segment is present in each of the bidirectional overlapped label switched path, for each path segment overlap multiplexed resource.
  2. 2. 如权利要求1所述的方法,其特征在于,所述对各重合的路径段进行资源复用包括: 如果预留的资源为电层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的时隙资源。 2. The method according to claim 1, wherein said multiplexing includes resources for each path segment overlap: If the reserved resource is resource layer, the resources for the current bi-directional label switched path reserved , if the presence of the current path segment coincides bidirectional LSP and bidirectional resource reservation has been label switched path, the multiplexing resources have been reserved for the time slot coincides with the path segment.
  3. 3. 如权利要求1所述的方法,其特征在于,所述对各重合的路径段进行资源复用包括: 如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的外部光层链路的波长资源。 3. The method according to claim 1, wherein said multiplexing includes resources for each path segment overlap: If the reserved resource reservation when a light layer resources, the resources for the current bi-directional label switched path If the current and bi-directional label switched path already exists for resource reservation path segment coincides bidirectional LSP, the resource external light wavelength multiplex link layer has been reserved for the path segment coincident.
  4. 4. 如权利要求3所述的方法,其特征在于,所述方法还包括:如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,复用所述重合的路径段上的节点内部的资源。 4. The method according to claim 3, characterized in that the method further comprises: if the resources reserved for the optical layer resources, to reserve resources for the current bi-directional label switched path, if the label switched path and a bidirectional current presence of overlapping resource reservation has bidirectional LSP path section, multiplex on resources within the node coinciding with the path segment.
  5. 5. 如权利要求1所述的方法,其特征在于,所述方法还包括: 确定所述当前域到其相邻域的双向标签交换路径时,如果路径约束满足预设条件,选择彼此之间重合路径段最多的双向标签交换路径。 5. The method according to claim 1, wherein said method further comprises: determining a current time-domain LSP to the bidirectional adjacent domain, path constraint if the preset condition is satisfied, the choice between one another most coincident bidirectional LSP path segment.
  6. 6. 如权利要求5所述的方法,其特征在于,所述预设条件包括:对资源利用率要求高于对路径最优性要求和/或所述当前域的可用资源低于资源阈值。 6. The method according to claim 5, wherein said predetermined condition comprises: the optimum available resource requirements above and / or below the path of the current domain resource threshold value of resource utilization requirements.
  7. 7. 如权利要求1所述的方法,其特征在于, 确定所述当前域到其相邻域的双向标签交换路径为:确定所述当前域到其下一域的双向标签交换路径,所述下一域为与所述当前域相邻且靠近所述目的节点的域; 当所述当前域为不包括所述源节点的域时,所述方法还包括: 确定所述当前域到其相邻域的双向标签交换路径后,生成虚拟最短路径树; 判断所述虚拟最短路径树的叶子节点是否为所述当前域的节点,如果不是,删除所述虚拟最短路径树中非当前域的叶子节点的分支后,将所述虚拟最短路径树发送给所述当前域的前一域的路径计算单元;所述当前域的前一域是与所述当前域相邻且靠近所述源节点的域。 7. The method according to claim 1, wherein determining the current domain to its adjacent domains bi-directional label switched path: determining the current field to the next bi-directional LSP domain thereof, said the next field is adjacent to the current domain and adjacent to the destination node domain; when the current domain does not include the source node domain, the method further comprises: determining the current relative to the field after a bidirectional LSP neighborhood, generating a virtual shortest path tree; determining whether the virtual shortest path tree leaf node as the current node domain, and if not, deleting the virtual shortest path tree leaves current domain Africa the branch node, the shortest path tree to a virtual path to the previous domain to the current domain calculation unit; previous field of the current field is adjacent to the current domain and adjacent to the source node area.
  8. 8. 如权利要求7所述的方法,其特征在于,所述方法还包括:所述当前域为不包括所述目的节点的域时,将非所述当前域的叶子节点对应的分支路由发送给所述当前域的下一域的路径计算单元,以使所述下一域的路径计算单元释放所述分支路由对应的预留资源。 8. The method according to claim 7, wherein said method further comprises: when the current domain does not include the destination node domain, the non-leaf nodes corresponding to the current branch route domain transmission domain to the next path computation domain of the current unit so that the path of the next domain calculation unit releases the reserved resources corresponding to the branch route.
  9. 9. 一种路由计算装置,其特征在于,包括: 路径确定模块,用于确定当前域到其相邻域的双向标签交换路径; 资源预留模块,用于为所述双向标签交换路径进行资源预留,其中,如果各双向标签交换路径中存在重合的路径段,则对各重合的路径段进行资源复用。 A route calculation apparatus, characterized by comprising: path determining means for determining a current bidirectional LSP domain to its neighboring domains; resource reservation module, for resources for the bidirectional LSP reservation, wherein if the presence of each path segment overlap bidirectional label switched path, for each path segment overlap multiplexed resource.
  10. 10. 如权利要求9所述的装置,其特征在于,所述资源预留模块对各重合的路径段进行资源复用包括: 如果预留的资源为电层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和己进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的时隙资源。 10. The apparatus according to claim 9, wherein said resource reservation module for each path segment overlap resource reuse comprising: if the reserved resources for the dielectric layer resources for a bidirectional LSP for the current resource reservation, if the current path and has a bidirectional label switched resource reservation for the presence of overlap bidirectional LSP path segment, the multiplexing resources have been reserved for the slot coincides path segment.
  11. 11. 如权利要求9所述的装置,其特征在于,所述资源预留模块对各重合的路径段进行资源复用包括: 如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和己进行资源预留的双向标签交换路径存在重合的路径段,则复用已为该重合的路径段预留的外部光层链路的波长资源。 11. The apparatus according to claim 9, wherein said resource reservation module for each path segment overlap resource reuse comprising: if the reserved resource for the light absorbing layer resources for a bidirectional LSP for the current resource reservation, if the bi-directional label switched path and the current already exist for bidirectional resource reservation overlapping LSP path segment, the wavelength multiplex link layer resources external light has been reserved for the path segment coincident.
  12. 12. 如权利要求11所述的装置,其特征在于,所述资源预留模块还用于:如果预留的资源为光层资源,为当前双向标签交换路径进行资源预留时,如果当前双向标签交换路径和已进行资源预留的双向标签交换路径存在重合的路径段,复用所述重合的路径段上的节点内部的资源。 12. The apparatus of claim 11, wherein said resource reservation module is further configured to: if the reserved resources for an optical layer resources, to reserve resources for the current bi-directional label switched path, if the bidirectional current overlapped label switched path exists and has to reserve resources bidirectional LSP path section, multiplex on resources within the node coinciding with the path segment.
  13. 13. 如权利要求9所述的装置,其特征在于,所述路径确定模块还用于: 确定所述当前域到其相邻域的双向标签交换路径时,如果路径约束满足预设条件,选择彼此之间重合的路径段最多的双向标签交换路径。 When the bidirectional LSP domain to its neighboring current domain, if the path constraint satisfies a preset condition, choose OK: 13. The apparatus according to claim 9, characterized in that said path determination module is further configured coincide with each other up to the bidirectional path segment label switched path.
  14. 14. 如权利要求13所述的装置,其特征在于,所述预设条件包括:对资源利用率要求高于对路径最优性要求和/或所述当前域的可用资源低于资源阈值。 14. The apparatus according to claim 13, wherein said predetermined condition comprising: a path above the optimal requirements and available resources or the current domain / resource threshold value is lower than the resource utilization requirements.
  15. 15. 如权利要求9所述的装置,其特征在于,所述装置还包括:路径传输模块,其中: 所述路径确定模块确定所述当前域到其相邻域的双向标签交换路径为:确定所述当前域到其下一域的双向标签交换路径,所述下一域为与所述当前域相邻且靠近目的节点的域; & 所述路径确定模块还用于,当所述当前域为不包括源节点的域时,确定所述当前域到其下一域的双向标签交换路径后,生成虚拟最短路径树; 所述路径传输模块用于,当所述当前域为不包括所述源节点的域时,判断所"述最短路径树的叶子节点是否为所述当前域的节点,如果不是,删除所述虚拟最短路径树中非当前域的叶子节点的分支后,将所述虚拟最短路径树发送给所述当前域的前一域的路径i十算单元;所述当前域的前一域是与所述当前域相邻且靠近所述源节点的域。 15. The apparatus according to claim 9, characterized in that said apparatus further comprises: a transmission path module, wherein: the determining module determines that the bidirectional path label switched path adjacent to the current domain is domain: determining the current domain LSP to the bidirectional its next field, the next field adjacent to the current domain and near the destination node domain; & amp; the path determining module is further configured, when the current does not include the time domain to the domain of the source node, after determining that the domain to which the next bi-directional label switched path the current domain, generating a virtual shortest path tree; the transmission path means for, when the current domain does not include the when said source node domain, determines whether the "leaf node of said shortest path tree node whether the current domain, if not, deleting the virtual shortest path tree leaf node of the branch current domain Africa, the virtual shortest path tree to a current field of said previous i + a path calculation unit; previous field of the current field is adjacent to the current domain, and close to the source node domain.
  16. 16. 如权利要求15所述的装置,其特征在于, 所述路径传输模块还用于,当所述当前域为不包括所述目的节点的域时,将所述虚拟最短路径树中非所述当前域的叶子节点对应的分支路由发送给所述当前域的下或1^路径计算单元,以使所述下一域的路径计算单元释放所述分支路由对应的预留资源。 16. The apparatus according to claim 15, wherein the transmission module is further configured to route, when the current domain does not include the destination node domain, the virtual shortest path tree Central Africa leaf node corresponding to said current field is sent to the branch route or the current 1 ^ domain path computation unit, so that the path of the next domain calculation unit releases the reserved resources corresponding to the branch route.
CN 201210519340 2012-12-06 2012-12-06 A route calculation method and apparatus CN103023780B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201210519340 CN103023780B (en) 2012-12-06 2012-12-06 A route calculation method and apparatus

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201210519340 CN103023780B (en) 2012-12-06 2012-12-06 A route calculation method and apparatus

Publications (2)

Publication Number Publication Date
CN103023780A true CN103023780A (en) 2013-04-03
CN103023780B true CN103023780B (en) 2017-11-28

Family

ID=47971925

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201210519340 CN103023780B (en) 2012-12-06 2012-12-06 A route calculation method and apparatus

Country Status (1)

Country Link
CN (1) CN103023780B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015176259A1 (en) * 2014-05-21 2015-11-26 华为技术有限公司 Virtual shortest path tree establishment and processing method, and path computation element
US20170187606A1 (en) * 2015-12-29 2017-06-29 Futurewei Technologies, Inc. Communication Among Network Controllers

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101610432A (en) * 2009-07-10 2009-12-23 北京邮电大学 Signaling realizing method supporting collaborative path computation of cluster computing units
CN102006527A (en) * 2010-11-17 2011-04-06 北京邮电大学 Path calculation method based on PCE in optical network
CN102238443A (en) * 2011-06-01 2011-11-09 电子科技大学 Method for establishing cross-domain path meeting wavelength-continuity constraints
CN102469009A (en) * 2010-11-09 2012-05-23 中兴通讯股份有限公司 Processing method for stateful path computation element, and stateful path computation element

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7496105B2 (en) * 2004-11-05 2009-02-24 Cisco Technology, Inc. System and method for retrieving computed paths from a path computation element using encrypted objects

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101610432A (en) * 2009-07-10 2009-12-23 北京邮电大学 Signaling realizing method supporting collaborative path computation of cluster computing units
CN102469009A (en) * 2010-11-09 2012-05-23 中兴通讯股份有限公司 Processing method for stateful path computation element, and stateful path computation element
CN102006527A (en) * 2010-11-17 2011-04-06 北京邮电大学 Path calculation method based on PCE in optical network
CN102238443A (en) * 2011-06-01 2011-11-09 电子科技大学 Method for establishing cross-domain path meeting wavelength-continuity constraints

Also Published As

Publication number Publication date Type
CN103023780A (en) 2013-04-03 application

Similar Documents

Publication Publication Date Title
US7489695B1 (en) Automatic LSP stitching with protocol signaling
US20150063802A1 (en) Dynamic end-to-end network path setup across multiple network layers
Colle et al. Data-centric optical networks and their survivability
US20080212496A1 (en) Communication network system and signal transmission method between leaf-nodes of multicast tree and node thereof
US20070011284A1 (en) Dynamic distributed method for local protection of a label switching path
US7324453B2 (en) Constraint-based shortest path first method for dynamically switched optical transport networks
JP2003229889A (en) Method for setting path and communication network and node device using the method
Tornatore et al. PHOTO: an efficient shared-path-protection strategy based on connection-holding-time awareness
CN1866852A (en) Method for realizing path computation in network domain
US20120308225A1 (en) Method for Establishing an Inter-Domain Path that Satisfies Wavelength Continuity Constraint
Autenrieth Recovery time analysis of differentiated resilience in MPLS
Casellas et al. Enhanced backwards recursive path computation for multi-area wavelength switched optical networks under wavelength continuity constraint
Aslam et al. Interdomain path computation: Challenges and solutions for label switched networks
Zheng et al. Toward automated provisioning of advance reservation service in next-generation optical Internet
Li et al. Dynamic routing with inaccurate link state information in integrated IP-over-WDM networks
CN101471853A (en) Route calculation method, unit and system
Giorgetti et al. Path state-based update of PCE traffic engineering database in wavelength switched optical networks
Cugini et al. Implementing a Path Computation Element (PCE) to encompass physical impairments in transparent networks
US20090269065A1 (en) Setting Up A Circuit In A Network
CN1870570A (en) Method for solving resource conflict in distribution route counting
WO2013091688A1 (en) Multilayer topology representation for network
Huang et al. A generalized protection framework using a new link-State availability model for reliable optical networks
Sambo et al. GMPLS-controlled dynamic translucent optical networks
US20140010072A1 (en) Signaling co-routed and non co-routed lsps of a bidirectional packet te tunnel
US20080031619A1 (en) Method and device for recovering from inter-domain link failure

Legal Events

Date Code Title Description
C06 Publication
C10 Entry into substantive examination
GR01