WO2013167051A2 - Multi-domain route computation method and device, path computation element, and routing network - Google Patents

Multi-domain route computation method and device, path computation element, and routing network Download PDF

Info

Publication number
WO2013167051A2
WO2013167051A2 PCT/CN2013/079628 CN2013079628W WO2013167051A2 WO 2013167051 A2 WO2013167051 A2 WO 2013167051A2 CN 2013079628 W CN2013079628 W CN 2013079628W WO 2013167051 A2 WO2013167051 A2 WO 2013167051A2
Authority
WO
WIPO (PCT)
Prior art keywords
domain
pce
path
vspt
deployed
Prior art date
Application number
PCT/CN2013/079628
Other languages
French (fr)
Chinese (zh)
Other versions
WO2013167051A3 (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
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to EP13787267.7A priority Critical patent/EP2928125B1/en
Priority to US14/648,835 priority patent/US9712426B2/en
Publication of WO2013167051A2 publication Critical patent/WO2013167051A2/en
Publication of WO2013167051A3 publication Critical patent/WO2013167051A3/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/16Multipoint routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46Interconnection of networks
    • H04L12/4604LAN interconnection over a backbone network, e.g. Internet, Frame Relay
    • H04L12/462LAN interconnection over a bridge based backbone
    • H04L12/4625Single bridge functionality, e.g. connection of two networks over a single bridge
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • H04L45/04Interdomain routing, e.g. hierarchical routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/42Centralised routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/48Routing tree calculation

Definitions

  • Multi-domain routing calculation method and device path calculation unit and routing network
  • the present invention relates to a routing path computing technology, and in particular, to a multi-domain routing calculation method and device, a Path Computation Element (PCE), and a routing network.
  • PCE Path Computation Element
  • GPLS Generalized Multiprotocol Label Switching
  • multiple nodes with different switching capabilities and rates can be divided into different domains or layers. These domains can be router domains and optical.
  • a Routing Controller (RC) or a Path Computation Element (PCE) can be used to calculate the end-to-end across multiple domains. path.
  • the Optical Internetworking Forum is a standards organization that specializes in the interconnection of optical networks.
  • the "E-NNI OSPFv2 -based Routing -2.0 Implementation Agreement" standard was established, and multi-domain interworking using RC and based on Domain to Domain Routing Protocol (DDRP) was proposed.
  • Path calculation method This method abstracts the intra-domain topology of each domain and represents it as an abstract link. It floods the inter-domain topology information of multiple domains through DDRP.
  • the information includes inter-domain links, intra-domain abstract links, and each The boundary node information of each domain is shown in Figure 1.
  • the inter-domain routing is calculated by the RC of the first domain, and then based on the calculated inter-domain paths (including inter-domain links, domain boundary nodes, intra-domain abstract links), and entries in each domain.
  • the boundary node calculates a specific intra-domain route of each domain, and the signaling performs routing according to the calculated path, as shown in FIG. 2 .
  • the Internet Engineering Task Force (IETF) proposed the use of PCE for multi-domain path calculation.
  • RFC5441 proposes a PCE-based Backward-Recursive PCE-Based Computation (BRPC) algorithm.
  • the algorithmic process relies on communication between mutually cooperating PCEs.
  • the Path Computation Client sends a Path Calculation Request PCReq message to the PCE in its domain.
  • the PCReq message is forwarded between the PCEs of each domain until the request reaches the PCE of the domain in which the node responsible for calculating the Label Switching Path (LSP) is located.
  • the PCE in the destination domain creates a virtual shortest path tree (VSPT) consisting of the potential path to the destination node, and sends the path tree to the previous PCE in the path computation response PCRep message. Then each PCE sequentially adds VSPT and sends it back to the PCE of the domain where the source node is located.
  • VSPT virtual shortest path tree
  • This PCE uses VSPT to select an optimal end-to-end path and sends the path to the PCC, as shown in Figure 3.
  • the method shown in Figure 3 requires that all domains participating in the BRPC algorithm support PCE, and each domain PCE supports the RFC5088 flooding automatic discovery function, so that each domain PCE is known to its neighbors.
  • the IETF RFC 5152 also proposes a Per-domain Routing Computation method, the basic principle is similar to the OIF RC method.
  • the segment calculation method determines whether the next domain has PCE by the boundary node of the pre-domain, and if it has PCE, it is calculated according to the first path calculation mode (BRPC algorithm of PCE) (as shown in the autonomous system 1 in FIG. 4); If you do not have a PCE, then Calculated according to the second path calculation method (per-domain path calculation algorithm) (as shown in the autonomous system 2 in Fig. 4). Finally, each domain sequentially calculates a route by using a first path calculation manner or a second path calculation manner, and finally completes signaling establishment according to the calculated route.
  • BRPC algorithm of PCE the first path calculation mode
  • per-domain path calculation algorithm per-domain path calculation algorithm
  • the main object of the present invention is to provide a multi-domain routing calculation method and apparatus, a path calculation unit, and a routing network, which can quickly and efficiently calculate routing paths between different domains in multiple domains.
  • a multi-domain routing calculation method includes:
  • the routing path is calculated by using the extended BRPC mode between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed.
  • Two or more domains outside the domain where PCE is deployed use RC to calculate routing paths.
  • the routing path is calculated by using an extended BRPC mode between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed, including:
  • the PCE After receiving the triggering request of the path calculation, the PCE determines whether the domain in which the PCE is located is a tail domain, and calculates the VSPT of the local domain when the tail domain is the tail domain, and further determines the domain and the downstream of the domain sequence in the domain of the PCE when the non-tail domain is a non-tail domain. If there is a domain in which the PCE is not deployed between the domains of the next deployed PCE, the VSPT of the domain is calculated when the domain is not present, and the domain is not in the domain where the PCE is deployed.
  • the inter-domain link is used as an extended link topology and merged with the link topology of the domain in which the PCE is located to calculate the VSPT after the merged link topology.
  • the method further includes: The corresponding VSPT routing path calculated by the extended link topology and the VSPT corresponding routing path calculated by the domain where the PCE is located are identified as different types of routing paths.
  • the method further includes:
  • the calculated VSPT is sent to the next deployed PCE in the upstream of the domain sequence. Domain PCE.
  • the PCE receives the trigger request of the path calculation, including:
  • the PCE receives the VSPT.
  • the method further includes:
  • the signaling is routed to the VSPT corresponding routing path calculated by the domain in which the PCE is located, the signaling is routed according to the VSPT corresponding routing path;
  • the RC calculates the strict hopping path in the domain corresponding to the loose hopping path of the domain in which the PCE is not deployed, and calculates the strict hop path routing path. Signaling.
  • a multi-domain routing computing device includes a determining unit and a computing unit, wherein:
  • Determining a unit configured to determine that the domain in which the PCE is deployed in the network is two or more, triggering the computing unit;
  • a computing unit configured to calculate a routing path by using an extended BRPC method between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed, where the two or more domains are deployed with PCE
  • the domain uses RC to calculate the routing path.
  • the calculating unit comprises a receiving subunit, a first determining subunit, a second determining subunit, a first calculating subunit and a second calculating subunit, wherein: a receiving subunit configured to receive a trigger request for path calculation;
  • a first determining subunit configured to determine whether a domain in which the PCE to which the computing unit belongs is a tail domain, triggering the first computing subunit when triggered; and triggering the second determining subunit when not a tail domain;
  • a second determining sub-unit configured to determine whether there is a domain in which the PCE is not deployed between the domain where the PCE to which the computing unit belongs and the domain of the next deployed PCE in the downstream of the domain sequence, and the first computing sub-trigger is triggered when not present Unit; triggering the second computing subunit when present;
  • a first computing subunit configured to calculate a VSPT of a domain in which the computing unit belongs to the PCE
  • a second computing sub-unit configured to use an intra-domain abstract link between the domain in which the PCE is not deployed, and an inter-domain link between domains in which the PCE is not deployed as an extended link topology, and where the computing unit belongs to the PCE
  • the link topology of the domain is merged, and the VSPT of the merged link topology is calculated.
  • the calculating unit further includes an identifier subunit configured to: after the VSPT of the merged link topology is calculated by the second calculating subunit, the VSPT corresponding routing path calculated by the extended link topology, The VSPT corresponding routing path identifier calculated by the domain where the computing unit belongs to the PCE is a different type of routing path.
  • the calculating unit further includes a third determining subunit and a sending subunit, where: the third determining subunit is configured to: after calculating the VSPT, determining that the domain where the PCE is located is the two or more deployments When there is a non-first domain in the domain of the PCE, the sending subunit is triggered; the sending subunit is configured to send the calculated VSPT to the PCE of the next domain in which the PCE is deployed upstream in the domain sequence.
  • the receiving subunit is further configured to receive a path calculation request message; or, receive a VSPT.
  • the device further includes a sending unit and a routing unit, where:
  • a sending unit configured to send signaling from the source node to the destination node
  • a routing unit configured to: when the signaling is routed to a VSPT corresponding routing path calculated by a domain where the PCE is located, routing the signaling according to the VSPT corresponding routing path; and routing the signaling to the extended link
  • the RC calculates a strict hop path within the domain corresponding to the loose hop path of the domain in which the PCE is not deployed, and routes the signaling according to the calculated strict hop path.
  • a path calculation unit includes a receiving unit, a first determining unit, a second determining unit, a first calculating unit, and a second calculating unit, where:
  • a receiving unit configured to receive a trigger request for path calculation
  • a first determining unit configured to determine whether the domain in which the path calculation unit is located is a tail domain, triggering the first computing unit when the tail domain is the second determining unit; Configuring to determine whether there is a domain in which the PCE is not deployed between the domain in which the path calculation unit is located and the domain of the next deployed PCE in the domain sequence, and triggering the first computing unit when not present; Second computing unit;
  • a first calculating unit configured to calculate a virtual shortest path tree VSPT of a domain in which the path calculating unit is located;
  • a second computing unit configured to use an intra-domain abstract link of the domain in which the PCE is not deployed, and an inter-domain link between domains in which the PCE is not deployed as an extended link topology, and the domain in which the path calculation unit is located
  • the link topology is merged to calculate the VSPT of the merged link topology.
  • the path calculation unit further includes an identification unit configured to: after the second computing unit calculates the VSPT of the merged link topology, calculate a VSPT corresponding routing path through the extended link topology, by using the The VSPT corresponding routing path calculated by the domain where the path calculation unit is located is identified as a different type of routing path.
  • the path calculation unit further includes a third determining unit and a sending unit, where: the third determining unit is configured to: after calculating the VSPT, determining that the domain in which the PCE is located is the PCE in which the two or more are deployed The sending unit is triggered when the non-first domain in the domain is in the domain; The sending unit is configured to send the calculated VSPT to the PCE of the next domain in which the PCE is deployed upstream in the domain sequence.
  • the receiving unit is further configured to receive a path calculation request message; or, receive the VSPT.
  • a routing network includes more than one routing domain, and the routing domain is provided with the foregoing path computing unit.
  • the reverse recursive path is used to calculate the BRPC mode between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed.
  • the routing path is calculated, and the routing path is calculated by using the inter-domain routing protocol DDRP in the domain other than the two or more domains in which the PCE is deployed.
  • the calculation of the routing path by using the BRPC method is as follows: After receiving the trigger request of the path calculation, the PCE determines whether the domain where the PCE is located is a tail domain, and when the tail domain is a tail domain, the virtual shortest path tree VSPT of the domain is calculated, which is a non-tail domain. Determining whether there is a domain in which the PCE is not deployed between the domain where the PCE is located and the domain of the next deployed PCE in the downstream of the domain sequence. If not, the virtual shortest path tree VSPT of the local domain is calculated.
  • the intra-domain link between the domain of the PCE domain and the inter-domain link between the domains where the PCE is not deployed is used as the extended link topology and merged with the link topology of the domain where the PCE is located to calculate the merged link topology.
  • VSPT The technical solution of the present invention is directed to the hybrid topology of the domain where the PCE is deployed and the domain where the PCE is not deployed.
  • the domain topology of the domain where the PCE is not deployed is used as the extended topology of the inter-domain link in the calculation process of the original BRPC algorithm.
  • Figure 1 is a schematic diagram of DDRP topology generation using RC
  • Figure 2 is a schematic diagram of multi-domain path calculation using RC
  • FIG. 5 is a schematic diagram of multi-domain routing calculation according to the present invention.
  • FIG. 6 is a schematic diagram of multi-domain routing calculation according to Embodiment 1 of the present invention.
  • FIG. 7 is a schematic diagram of multi-domain routing calculation according to Embodiment 2 of the present invention.
  • FIG. 9 is a schematic structural diagram of a multi-domain routing computing device according to an embodiment of the present invention.
  • FIG. 10 is a schematic structural diagram of a computing unit of a multi-domain routing computing device according to an embodiment of the present invention.
  • FIG. 11 is a schematic structural diagram of a path calculation unit according to an embodiment of the present invention. detailed description
  • the present invention is directed to a hybrid network of a domain in which a PCE is deployed in a network and a domain in which a PCE is not deployed.
  • the existing BRPC algorithm is extended, and the domain topology of the domain in which the PCE is not deployed is used as the inter-domain link in the calculation process of the original BRPC algorithm.
  • the extension topology is used, and the topology is used to generate the virtual shortest path tree of the domain in the BRPC calculation of each PCE.
  • the RC DDRP is used for the domain where the PCE is not deployed, and the domain topology is flooded, including the information of the inter-domain link, the intra-domain abstract link, and the domain boundary node.
  • the cross-domain path calculation is started. If the domain of the PCE has not been configured, the path calculation method of each domain is always used until the signaling reaches the domain where the PCE is configured.
  • the domain PCE is the first domain PCE of the BRPC algorithm.
  • the domain sequence sends a path computation request until the PCE of the domain of the last configured PCE in the domain sequence ends, and the domain PCE acts as the tail domain PCE of the BRPC algorithm.
  • the BRPC algorithm is used between the first domain PCE and the tail domain PCE.
  • the domain topology of the domain where the PCE is not configured it is used as the extended topology of the inter-domain link. Its nearest upstream domain PCE is used in BRPC calculations.
  • the path segment in the domain where the PCE is deployed is represented as a strict hop path
  • the path segment in the domain where the PCE is not deployed is represented as a loose hop path.
  • the route establishment signaling calculated along the BRPC can be directly established for the strict hop path.
  • the path calculation in the specific domain is completed in each domain, and signaling is established. If there is a domain in which the PCE is not deployed after the last domain in which the PCE is deployed, the per-domain path calculation algorithm is used to calculate the route until the destination node is reached, and the multi-domain routing interworking calculation is completed.
  • the present invention extends the use scenario of the BRPC algorithm so that only a minimum of two domains in the domain sequence can be deployed to deploy the PCE to use the BRPC algorithm, and there is no limit to the relative positions of the domains of the two deployed PCEs in the domain sequence.
  • the technical solution of the present invention can also complete the calculation by using only one BRPC calculation process to ensure the path optimality to the greatest extent.
  • the technical solution of the present invention has no limitation on the designation or calculation of the domain sequence, and the domain in which the PCE is deployed and the domain in which the PCE is not deployed may be arbitrarily arranged in the domain sequence. Moreover, the inter-domain topology flooding of the domain where the PCE is not deployed and the neighbor discovery of the PCE are both prior art and need not be extended for the method of the present invention.
  • AS ( i-1 ) indicates the domain in which the PCE is deployed in the nearest upstream domain of the AS (i) domain;
  • AS ( i+1 ) indicates the domain in which the PCE is deployed in the nearest downstream domain of the AS (i) domain;
  • SN, DN respectively represent the source node in AS ( 0 ) and the destination node in AS ( N );
  • SN, DN' an ingress boundary node indicating the arrival of the signaling of AS (1) and an egress boundary node leaving the signaling of AS (n);
  • BN-en, BN-ex respectively represent the inbound and outbound nodes in each domain
  • Al, A2, A3, A4, Bl, B2, B3, B4, Cl, C2 represent the boundary nodes of AS ( i-1 ), AS (i), AS (i+1 ).
  • Step 1 Each domain uses DDRP to advertise its inter-domain topology information, including domain border nodes, inter-domain links, and intra-domain abstract links, as shown in Figure 1.
  • Step 2 The PCEs of each domain that has a PCE are automatically discovered by flooding the PCE to obtain the neighbor relationship of the PCE.
  • PCE auto-discovery information is not flooded for domains that do not have a PCE deployed.
  • Use SN or BN-en to find the PCE auto discovery information in this domain to determine whether PCE is deployed in the domain.
  • Step 3 As shown in Figure 5 (a), starting from AS (0), along the domain sequence, SN or BN-en determines whether the domain is a domain where PCE is deployed:
  • the domain path calculation method is used to calculate the domain route (the local domain BN-en to the local domain BN-ex), and the domain BN-ex is selected. BN-en of the next domain. Route signaling to the BN-en. Repeat step 3;
  • step 4 If it is a domain where PCE is deployed, go to step 4;
  • the domain path calculation method is used to calculate the domain route (the local domain BN-en to DN), and the signaling is routed to the DN, and step 8 is performed;
  • Step 4 PCE (1) uses AS ( 1 ) as the first domain of BRPC calculation, and according to the neighbor relationship of PCE, finds the domain AS (n) of the last deployed PCE in the domain sequence, and uses it as the tail domain of BRPC calculation.
  • AS (1) uses the inbound boundary node of the current signaling to the local domain as the source node of the BRPC algorithm, and according to the DDRP inter-domain topology, selects the exit boundary node of AS (n) as the destination node of the BRPC algorithm.
  • PCE (1) sends a BRPC path calculation request message along the PCE sequence until PCE (n), as shown in Figure 5 (a);
  • A-1 PCE of AS (i) (i) Calculate the local VSPT (i) tree according to the intermediate domain calculation method of the general BRPC, and insert the VSPT (i) tree into the route calculation response message, by PCE (i) ) sent to the upstream domain PCE processing, repeat step 5;
  • PCE (i+1) transmits VSPT (i+1) to PCE (i-1) through a path calculation response message.
  • PCE (i-1) needs to calculate the VSPT tree from A1 and A2 to the destination node DN.
  • the AS(i) domain topology is an inter-domain link (A3-B1, A4-B2).
  • PCE (i-1) regards the domain topology of AS (i) as the local (AS (i-1)) outbound node (A3/A4) to the downstream
  • the domain (AS ( i+1 )) enters the inter-domain link extension topology of the border node C1/C2, and the intra-domain actual topology (A1/A2 to A3/4) in AS (il) is merged as the local domain BRPC calculation.
  • PCE (i-1) calculates the shortest path from A1/A2 to C1/C2 and splices it with the downstream domain VSPT (i+1) tree to calculate the local VSPT (i -1) Tree, where, in particular, the path of VSPT (i-1) in AS ( i ) is represented by a loose hop path, while in AS ( i-1 ) the path is represented by a strict hop path.
  • the PCE (i-1) carries the VSPT (i-1) tree in the route calculation response message, and sends it to the upstream domain PCE for processing by the PCE (i-1), and repeats step 5;
  • Step 6 Signaling starts from the SN, and routes along the calculated SN, to DN, path. Further, in the route, the route represented by the strict hop path is directly routed; for the path represented by the loose hop path, the intra-domain calculation process between the two loose hop paths is initiated in the domain, and the calculation mode and the general order are The calculation process in the domain is consistent, and step 7 is performed;
  • Step 7 The signaling arrives at the DN', and the subsequent domains are all domains in which the PCE is not deployed.
  • the general path calculation method is used to calculate the route, and the signaling is routed until the signaling reaches the DN, and step 8 is performed;
  • Step 8 The multi-domain routing interworking calculation is completed.
  • the application scenario of this example is as follows:
  • the first domain and the tail domain are the domains where the PCE is deployed, and the intermediate domain is the domain where the PCE is not deployed.
  • AS (1), AS (2), AS (3), AS (4) deploy PCE (respectively PCE (1) and PCE (4)), while AS (2) and AS (3) did not deploy PCE.
  • Rl and R15 are source nodes and destinations for multi-domain path computation Node.
  • the link cost in the topology is 1.
  • the inter-domain topology of each domain has been flooded by DDRP, and the automatic discovery information of PCE is also flooded according to the requirements of RFC5088.
  • PCE (1) and PCE (4) can see the inter-domain topology and establish the neighbor relationship of PCE.
  • the multi-domain routing calculation process is as follows:
  • the path calculation request message is sent from R1 to PCE (1), requiring PCE (1) calculation
  • PCE (1) determines the last PCE in the domain sequence as PCE (4) according to the domain sequence and the neighbor relationship of PCE in the automatic discovery information of PCE, and the corresponding domain is AS (4), and forwards to PCE (4).
  • PCE (4) calculates the VSPT tree of this domain, denoted as VSPT (4), and carries VSPT(4) in the path calculation response message and returns it to PCE (1);
  • PCE ( 1 ) After receiving the VSPT ( 4 ) of PCE ( 4 ), PCE ( 1 ) will inter-domain link and intra-domain abstract link in AS ( 2 ) and AS ( 3 ) in the inter-domain topology (shown by dashed line) As an inter-domain link extension topology between PCE (1) and PCE (4), then PCE (1) merges its local domain topology and inter-domain link extension topology to calculate R1 to The optimal path of R13 and R1 to R14, and spliced with the path in VSPT (4) to form VSPT (1), that is, the end-to-end path, expressed as ERO (display routing object): R 1 -R2-R4- R7-R9-R 11 -R 13 -R 15;
  • ERO display routing object
  • R4-R7 is a loose hop path.
  • the R4 to R7 domain path is calculated at R4, which is R4-R6-R7, and the extended ERO is R4-R6-R7-R9-R11-R13-R15, which is routed along the ERO to R9.
  • ER0 R9-R11-R13-R15;
  • R9-R11 is a loose hop path.
  • R11-R13-R15 are strict hop paths, routing signaling in sequence, signaling reaches R15, and the multi-domain path calculation process from R1 to R15 ends.
  • the application scenario of this example is as follows:
  • the intermediate domain is the domain where PCE is deployed, and the first domain and the tail domain are domains where PCE is not deployed.
  • ASs AS (1), AS (2), AS (3), AS (4)
  • AS (2) and AS (3) deploy PCE (respectively PCE (2) and PCE (3)), while AS (1) and AS (4) do not deploy PCE.
  • Rl and R15 are the source and destination nodes for multi-domain path computation.
  • the link cost in the topology is 1.
  • the inter-domain topology of each domain has been flooded by DDRP, and the automatic discovery information of PCE is also flooded according to the requirements of RFC5088.
  • PCE (2) and PCE (3) can see the inter-domain topology and establish the neighbor relationship of PCE.
  • the multi-domain routing calculation process is as follows:
  • R1 finds that PCE is not deployed in this domain.
  • the path calculation method is used for each domain.
  • the path from R1 to R2 is calculated as R1-R2, and the signaling is routed to R2.
  • the entry boundary node of the next domain is selected by R2.
  • R4 the signaling arrives at the inbound boundary node R4 of the AS (2) along the route;
  • PCE (2) determines the last PCE in the domain sequence as PCE (3) according to the domain sequence and the neighbor relationship of PCE in the automatic discovery information of PCE, and the corresponding domain is AS (3).
  • PCE (2) uses R4 as the source node for BRPC calculation, and selects the exit boundary node R11 of PCE (3) as the destination node for BRPC calculation, and forwards the path calculation request message to PCE (3);
  • PCE (3) calculates the VSPT tree of this domain, denoted as VSPT (3), and returns VSPT(3) to the path computation response message and returns it to PCE (2);
  • PCE (2) returns the path calculation response message to the R3 node, and the path ERO is: R4-R6-R7--R9-R11, and the ERO is a strict hop path;
  • the signaling is routed to Rll along the strict hop path in the ERO, and the ingress node of the next domain is selected by R11 as R13; (7) If R3 of AS (4) finds that PCE is not deployed in this domain, the path calculation method of each domain is used to calculate the local route, select the path of R13-R15, and route the signaling to R15. Then the multi-domain path calculation process End.
  • the application scenario of this example is as follows: Deploy the domain of the PCE and the domain spacing of the Deployed PCE. As shown in Figure 8, five ASs (AS (1), AS (2), AS (3), AS (4), AS (5)) are shown, where AS (1), AS (3), AS (5) deployed PCE (PCE (1), PCE (3), PCE (5)), while AS (2) and AS (4) did not deploy PCE. Rl and R19 are source and destination nodes for multi-domain path computation. The link cost in the topology is 1. The inter-domain topology of each domain has been flooded by DDRP, and the automatic discovery information of PCE has also been flooded according to the requirements of RFC5088. PCE (1), PCE (3), and PCE (5) can see the inter-domain topology and establish a PCE neighbor relationship.
  • the multi-domain routing calculation process is as follows:
  • R1 finds that the domain deploys PCE and requests multi-domain path calculation from the domain PCE (1).
  • PCE (1) determines that the last PCE in the domain sequence is PCE (5) according to the domain sequence and the neighbor relationship of PCE in the automatic discovery information of PCE, and the domain is AS (5).
  • PCE (1) uses R1 as the source node for BRPC calculation, and R19 is the destination node for BRPC calculation, and forwards the path calculation request message to the downstream domain PCE;
  • PCE (3) receives the path calculation request message and continues to forward to the PCE (5);
  • PCE (5) judges that R19 is the domain node, calculates the local VSPT (5) tree (ERO 1: R17-R19, ER02: R18-R19), and returns it to PCE through the path calculation response message (3) ;
  • the PCE (3) After receiving the VSPT (5) of the PCE (5), the PCE (3) uses the inter-domain link of the AS ( 4 ) in the inter-domain topology and the intra-domain abstract link (shown by the dotted line) as the PCE ( 3 ) Inter-domain link extension topology with PCE (5), then PCE (3) merges its local domain topology and inter-domain link extension topology to calculate R9/R10 to R17/R18
  • the optimal path is spliced with the path in VSPT ( 5 ) to form VSPT ( 3 ), denoted as ERO (display route object): R9-R11-R13-R15-R17-R19 and R10-R11-R13-R15-R17-R19, and return to PCE (1) by path calculation response message;
  • PCE ( 1 ) After receiving the VSPT ( 3 ) of PCE ( 3 ), PCE ( 1 ) takes the inter-domain link of AS ( 2 ) in the inter-domain topology and the intra-domain abstract link (shown by dashed line) as PCE ( 1 ) Inter-domain link extension topology with PCE (3), then PCE (1) merges its local domain topology and inter-domain link extension topology to calculate the optimal R1 to R9/R10
  • the path is spliced with the path in VSPT ( 3 ) to form VSPT ( 1 ), which is the end-to-end path, denoted as ERO (display routing object): R1-R2-R4-R7-R9-R11-R13-R15 -R17-R19, and return to R1 through the path calculation response message;
  • R1 routes to R4 along the ERO path, and ERO is: R4-R7-R9-R11-R13-R15-R17-R19;
  • R4 finds that R4-R7 is a loose hopping path, initiates the intra-domain calculation process of the domain, obtains the R4-R6-R7 path, and routes the signaling to R7.
  • the ERO is: R7-R9-R11-R13-R15- R17-R19;
  • the R7 signaling continues to be routed to R13 along the strict hop path.
  • the ERO is: R13-R15-R17-R19;
  • R13 finds that R13-R15 is a loose hopping path, initiates the intra-domain calculation process of the local domain, obtains the R13-R15 path, and routes the signaling to R17.
  • the ERO is: R17-R19;
  • R17 continues the path signaling to R19 according to the strict hop path, and the multi-domain path calculation process ends.
  • FIG. 9 is a schematic structural diagram of a multi-domain routing computing device according to an embodiment of the present invention.
  • the multi-domain routing computing device of the embodiment of the present invention includes a determining unit 90 and a computing unit 91, where:
  • the determining unit 90 is configured to determine that when the domain in which the PCE is deployed in the network is two or more, Sending the calculation unit 90;
  • the calculating unit 91 is configured to calculate a routing path by using a BRPC method between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed, where the two or more domains with the PCE are deployed.
  • the domain uses the inter-domain routing protocol DDRP to calculate the routing path.
  • the computing unit 91 of the embodiment of the present invention includes a receiving subunit 910, a first determining subunit 911, and a first The second determining subunit 912, the first calculating subunit 913 and the second calculating subunit 914, wherein:
  • the receiving subunit 910 is configured to receive a trigger request for path calculation
  • the first determining subunit 911 is configured to determine whether the domain in which the PCE to which the computing unit 91 belongs is a tail domain, when the first computing subunit 913 is triggered, and the second determining subunit is triggered when it is a non-tailing domain. 912;
  • the second determining sub-unit 912 is configured to determine whether there is a domain in which the PCE is not deployed between the domain where the PCE to which the computing unit 91 belongs and the domain of the next deployed PCE in the downstream of the domain sequence.
  • a first computing sub-unit 913 configured to calculate a virtual shortest path tree VSPT of a domain in which the PCE to which the computing unit 91 belongs;
  • the second computing sub-unit 914 is configured to use an intra-domain abstract link of the domain in which the PCE is not deployed, and an inter-domain link between domains in which the PCE is not deployed as an extended link topology, and belong to the computing unit 91.
  • the link topology of the domain where the PCE is located is merged, and the VSPT of the merged link topology is calculated.
  • the calculation unit 91 of the present embodiment further includes an identification subunit (not shown in FIG. 10) configured to calculate the merged link extension in the second calculation subunit 914. After the VSPT, the VSPT corresponding routing path calculated by the extended link topology and the VSPT corresponding routing path calculated by the domain in which the computing unit 91 belongs are identified as different types of routing paths. On the basis of the calculation unit 91 shown in FIG. 10, the calculation unit 91 further includes a third determination subunit (not shown in FIG. 10) and a transmission subunit (not shown in FIG. 10), wherein:
  • a third determining subunit configured to: after the VSPT is calculated, determine that the domain where the PCE is located is a non-first domain in the domain in which the two or more PCEs are deployed, triggering the sending subunit; And configured to send the calculated VSPT to the PCE of the next deployed PCE domain upstream of the domain sequence.
  • the receiving subunit 910 is further configured to receive a path calculation request message; or, receive the VSPT.
  • the multi-domain routing computing device of this embodiment further includes a transmitting unit (not shown in FIG. 9) and a routing unit (not shown in FIG. 9), where: a sending unit, configured to send signaling from the source node to the destination node;
  • a routing unit configured to: when the signaling is routed to a VSPT corresponding routing path, routing the signaling according to the VSPT corresponding routing path; and routing the signaling to a VSPT corresponding routing path calculated by using the extended link topology
  • the intra-domain strict hop path corresponding to the loose hop path of the domain in which the PCE is not deployed is further calculated, and the signaling is routed according to the calculated strict hop path.
  • FIG. 11 is a schematic structural diagram of a path calculation unit according to an embodiment of the present invention.
  • a path calculation unit according to an embodiment of the present invention includes a receiving unit 1110, a first determining unit 1111, a second determining unit 1112, and a first calculation.
  • Unit 1113 and second computing unit 1114 wherein:
  • the receiving unit 1110 is configured to receive a trigger request for path calculation
  • the first determining unit 1111 is configured to determine whether the domain where the path calculation unit is located is a tail domain, The first computing unit 1113 is triggered when the first computing unit 1113 is triggered; the second determining unit 1112 is triggered when it is a non-tailing domain; the second determining unit 1112 is configured to determine the next deployment of the domain and the downstream of the domain sequence in which the path computing unit is located. Whether there is a domain in which the PCE is not deployed between the domains of the PCE, the first computing unit 1113 is triggered when not present; and the second computing unit is triggered when it exists;
  • the first calculating unit 1113 is configured to calculate a virtual shortest path tree VSPT of the domain in which the path calculating unit is located;
  • the second computing unit 1114 is configured to use an intra-domain abstract link of the domain in which the PCE is not deployed, and an inter-domain link between domains in which the PCE is not deployed as an extended link topology, and the domain in which the path calculation unit is located
  • the link topology is merged to calculate the VSPT of the merged link topology.
  • the path calculation unit of this embodiment further includes an identification unit (not shown in FIG. 11) configured to calculate the merged link topology in the second calculation unit 1114.
  • the VSPT corresponding routing path calculated by the extended link topology and the VSPT corresponding routing path calculated by the domain in which the path calculating unit belongs are identified as different types of routing paths.
  • the path calculation unit of this embodiment further includes a third determination unit (not shown in FIG. 11) and a transmission unit (not shown in FIG. 11), wherein:
  • a third determining unit configured to: after the VSPT is calculated, determine that the domain where the PCE is located is a non-first domain in the domain where the two or more PCEs are deployed, triggering the sending unit; The calculated VSPT is sent to the PCE of the next PCE-provisioned domain upstream of the domain sequence.
  • the receiving unit 1110 is further configured to receive a path calculation request message; or, receive the VSPT.
  • the invention also describes a routing network comprising more than one routing domain, wherein the routing domain is provided with the path computation unit described above.
  • the above various processing units or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed among multiple computing devices.
  • the network may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device, or they may be separately fabricated into individual integrated circuit modules, or they may be Multiple modules or steps in the fabrication are implemented as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the domain topology of the domain in which the PCE is not deployed is used as the extension of the inter-domain link in the calculation process of the original BRPC algorithm for the hybrid networking of the domain where the PCE is deployed and the domain where the PCE is not deployed.
  • Park and use the topology to generate the virtual shortest path tree of the domain in the calculation of the BRPC of each PCE, thereby solving the problem that the BRPC algorithm cannot be implemented due to the existence of the domain without deploying the PCE, and improving the optimality of the path. .

Abstract

Disclosed is a multi-domain route computation method, comprising: when it is determined that two or more domains deployed with a path computation element (PCE) exist in a network, computing a routing path between a first domain PCE and a tail domain PCE in the two or more domains deployed with a PCE by means of extended backward recursive path computation (BRPC), and computing a routing path in a domain except the two or more domains deployed with a PCE by using an RC. Also disclosed are a multi-domain route computation device, a PCE, and a routing network. The present invention can improve the path computation optimality to a great extent, and the path computation efficiency is pretty high.

Description

多域路由计算方法及装置、 路径计算单元及路由网络 技术领域  Multi-domain routing calculation method and device, path calculation unit and routing network
本发明涉及路由路径计算技术, 尤其涉及一种多域路由计算方法及装 置、 路径计算单元 ( PCE, Path Computation Element )及路由网络。 背景技术  The present invention relates to a routing path computing technology, and in particular, to a multi-domain routing calculation method and device, a Path Computation Element (PCE), and a routing network. Background technique
在使用通用多协议标签交换协议 ( GMPLS , Generalized Multiprotocol Label Switching )的多层多域网络中, 多种具有不同交换能力和速率的节点 可以划分为不同域或层,这些域可以是路由器域、光传送网络(OTN, Optical Transport Network )域或者分组传送网络 ( PTN, Packet Transport Network ) 域等。在采用自治系统( AS, Autonomous System )进行划分的多域网络中, 可以采用路由控制器( RC, Routing Controller )或路径计算单元( PCE, Path Computation Element )来计算跨越多个域的端到端路径。  In a multi-layer multi-domain network using Generalized Multiprotocol Label Switching (GMPLS), multiple nodes with different switching capabilities and rates can be divided into different domains or layers. These domains can be router domains and optical. An OTN (Optical Transport Network) domain or a Packet Transport Network (PTN) domain. In a multi-domain network divided by an autonomous system (AS), a Routing Controller (RC) or a Path Computation Element (PCE) can be used to calculate the end-to-end across multiple domains. path.
光互联论坛(OIF, Optical Internetworking Forum )是专门研究光网络 互联的标准组织。 为了解决多域网络之间的互通, 制定了 " E-NNI OSPFv2 -based Routing -2.0 Implementation Agreement" 标准, 提出了采用 RC并基于域间路由协议 ( DDRP, Domain to Domain Routing Protocol ) 的 多域互通路径计算方法。 这种方法将每个域的域内拓朴进行抽象, 并表示 为抽象链路, 通过 DDRP将多域的域间拓朴信息洪泛出来, 这些信息包括 域间链路、 域内抽象链路和每个域的边界节点信息, 如图 1 所示。 基于该 域间拓朴, 由首域的 RC进行域间路由的计算, 然后基于计算出的域间路径 (包括域间链路、 域边界节点、 域内抽象链路), 在每个域的入边界节点计 算出每个域的具体的域内路由, 并且, 信令按照该计算出的路径进行路由, 如图 2所示。 互联网工程任务组 ( IETF, The Internet Engineering Task Force )提出采 用 PCE进行多域路径的计算。其中, RFC5441提出了一种基于 PCE的反向 递归路径计算( BRPC, Backward-Recursive PCE-Based Computation )算法。 该算法过程依赖于相互协作的 PCE之间的通信。 路径计算客户端 (PCC, Path Computation Client ) 向其域内的 PCE发送路径计算请求 PCReq消息。 该 PCReq消息在每个域的 PCE之间转发,直到请求到达负责计算标签交换 路径( LSP, Label Switching Path )目的节点所在域的 PCE。目的域中的 PCE, 创建一棵由到达目的节点的潜在路径组成的虚拟最短路径树( VSPT, Virtual Shortest Path Tree ), 并在路径计算响应 PCRep消息中将此路径树发送给先 前的 PCE。 然后每个 PCE依次增加 VSPT, 并将其向回发送, 直到源节点 所在域的 PCE, 此 PCE使用 VSPT选择一条最优端到端的路径, 并将路径 发送给 PCC, 如图 3所示。 图 3所示的方法需要参与 BRPC算法计算的各 域均支持 PCE, 并且各域 PCE均支持 RFC5088洪泛自动发现功能,使得各 域 PCE均对其邻居可知。 当然 IETF的 RFC5152也还提出了每域路径计算 ( Per-domain Routing Computation )方法, 其基本原理与 OIF的 RC方式类 似。 The Optical Internetworking Forum (OIF) is a standards organization that specializes in the interconnection of optical networks. In order to solve the interworking between multi-domain networks, the "E-NNI OSPFv2 -based Routing -2.0 Implementation Agreement" standard was established, and multi-domain interworking using RC and based on Domain to Domain Routing Protocol (DDRP) was proposed. Path calculation method. This method abstracts the intra-domain topology of each domain and represents it as an abstract link. It floods the inter-domain topology information of multiple domains through DDRP. The information includes inter-domain links, intra-domain abstract links, and each The boundary node information of each domain is shown in Figure 1. Based on the inter-domain topology, the inter-domain routing is calculated by the RC of the first domain, and then based on the calculated inter-domain paths (including inter-domain links, domain boundary nodes, intra-domain abstract links), and entries in each domain. The boundary node calculates a specific intra-domain route of each domain, and the signaling performs routing according to the calculated path, as shown in FIG. 2 . The Internet Engineering Task Force (IETF) proposed the use of PCE for multi-domain path calculation. Among them, RFC5441 proposes a PCE-based Backward-Recursive PCE-Based Computation (BRPC) algorithm. The algorithmic process relies on communication between mutually cooperating PCEs. The Path Computation Client (PCC) sends a Path Calculation Request PCReq message to the PCE in its domain. The PCReq message is forwarded between the PCEs of each domain until the request reaches the PCE of the domain in which the node responsible for calculating the Label Switching Path (LSP) is located. The PCE in the destination domain creates a virtual shortest path tree (VSPT) consisting of the potential path to the destination node, and sends the path tree to the previous PCE in the path computation response PCRep message. Then each PCE sequentially adds VSPT and sends it back to the PCE of the domain where the source node is located. This PCE uses VSPT to select an optimal end-to-end path and sends the path to the PCC, as shown in Figure 3. The method shown in Figure 3 requires that all domains participating in the BRPC algorithm support PCE, and each domain PCE supports the RFC5088 flooding automatic discovery function, so that each domain PCE is known to its neighbors. Of course, the IETF RFC 5152 also proposes a Per-domain Routing Computation method, the basic principle is similar to the OIF RC method.
目前, 在实际应用中, 存在三种场景: 1 )如果域序列中各域均不支持 PCE, 则采用 OIF RC计算方式; 2 )如果域序列中各域均支持 PCE, 则采 用 IETF PCE BRPC的计算方式; 3 )如果域序列中存在有的域支持 PCE, 有的不支持, 则需要进行互通计算。  At present, in practical applications, there are three scenarios: 1) If each domain in the domain sequence does not support PCE, the OIF RC calculation mode is adopted; 2) If each domain in the domain sequence supports PCE, the IETF PCE BRPC is adopted. Calculation method; 3) If there are domains in the domain sequence that support PCE, and some do not support, interworking calculation is required.
对于第 3 )种场景, 目前采用的典型方法如中国专利申请专利公开号为 CN101296178A,公开日期为 2008年 10月 29日的专利申请中所述的方法, 即采用每域路径计算和 BRPC各自分段计算的方式, 由前域的边界节点判 断下一个域是否具备 PCE,如果具备 PCE, 则按照第一路径计算方式(PCE 的 BRPC算法)计算(如图 4中自治系统 1中所示); 如果不具备 PCE, 则 按照第二路径计算方式(每域路径计算算法)计算(如图 4 中自治系统 2 中所示)。 最后, 各域依次采用第一路径计算方式或第二路径计算方式计算 路由, 并最终按照计算出的路由完成信令的建立。 这种方法虽然部分解决 了互通计算的问题,但还存在以下缺陷:对于应用 PCE的 BRPC计算的域, 仍然需要连续的域均部署 PCE, 如果在两个部署了 PCE的域之间存在有未 部署 PCE的域, 则不能采用 BRPC算法, 仍然只能采用每域路径计算的方 法, 这将会大大降低路径计算的最优性, 并且导致路径计算的效率低下。 发明内容 For the third scenario, the typical method currently used is as described in the Chinese Patent Application Publication No. CN101296178A, the disclosure of which is incorporated herein by reference. The segment calculation method determines whether the next domain has PCE by the boundary node of the pre-domain, and if it has PCE, it is calculated according to the first path calculation mode (BRPC algorithm of PCE) (as shown in the autonomous system 1 in FIG. 4); If you do not have a PCE, then Calculated according to the second path calculation method (per-domain path calculation algorithm) (as shown in the autonomous system 2 in Fig. 4). Finally, each domain sequentially calculates a route by using a first path calculation manner or a second path calculation manner, and finally completes signaling establishment according to the calculated route. Although this method partially solves the problem of interworking calculation, it still has the following defects: For the domain of BRPC calculation using PCE, it is still necessary to deploy PCE in consecutive domains, if there is any between two domains where PCE is deployed. If you deploy a PCE domain, you cannot use the BRPC algorithm. You can only use the path calculation method for each domain. This will greatly reduce the optimality of path calculation and result in inefficient path calculation. Summary of the invention
有鉴于此, 本发明的主要目的在于提供一种多域路由计算方法及装置、 路径计算单元及路由网络, 能快速高效地计算出多域中的不同域之间的路 由路径。  In view of this, the main object of the present invention is to provide a multi-domain routing calculation method and apparatus, a path calculation unit, and a routing network, which can quickly and efficiently calculate routing paths between different domains in multiple domains.
为达到上述目的, 本发明的技术方案是这样实现的:  In order to achieve the above object, the technical solution of the present invention is achieved as follows:
一种多域路由计算方法, 包括:  A multi-domain routing calculation method includes:
确定网络中部署有 PCE的域为两个及以上时, 在所述两个及以上部署 有 PCE的域中的首域 PCE和尾域 PCE之间采用扩展的 BRPC方式计算路 由路径,在所述两个以上部署有 PCE的域之外的域采用 RC计算路由路径。  When the number of domains in which the PCE is deployed in the network is two or more, the routing path is calculated by using the extended BRPC mode between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed. Two or more domains outside the domain where PCE is deployed use RC to calculate routing paths.
优选地,在所述两个及以上部署有 PCE的域中的首域 PCE和尾域 PCE 之间采用扩展的 BRPC方式计算路由路径, 包括:  Preferably, the routing path is calculated by using an extended BRPC mode between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed, including:
PCE接收到路径计算的触发请求后, 确定所述 PCE所在的域是否为尾 域, 为尾域时计算本域的 VSPT, 为非尾域时进一步确定所述 PCE所在的 域与域序列中下游的下一部署 PCE的域之间是否存在未部署 PCE的域,不 存在时计算本域的 VSPT, 存在时将所述未部署 PCE的域的域内抽象链路、 未部署 PCE的域之间的域间链路作为扩展链路拓朴,并与所述 PCE所在的 域的链路拓朴合并, 计算合并链路拓朴后的 VSPT。  After receiving the triggering request of the path calculation, the PCE determines whether the domain in which the PCE is located is a tail domain, and calculates the VSPT of the local domain when the tail domain is the tail domain, and further determines the domain and the downstream of the domain sequence in the domain of the PCE when the non-tail domain is a non-tail domain. If there is a domain in which the PCE is not deployed between the domains of the next deployed PCE, the VSPT of the domain is calculated when the domain is not present, and the domain is not in the domain where the PCE is deployed. The inter-domain link is used as an extended link topology and merged with the link topology of the domain in which the PCE is located to calculate the VSPT after the merged link topology.
优选地, 计算合并链路拓朴后的 VSPT之后, 所述方法还包括: 将通过扩展链路拓朴计算的 VSPT对应路由路径、 通过 PCE所在的域 计算的 VSPT对应路由路径标识为不同类型的路由路径。 Preferably, after the VSPT after the merged link topology is calculated, the method further includes: The corresponding VSPT routing path calculated by the extended link topology and the VSPT corresponding routing path calculated by the domain where the PCE is located are identified as different types of routing paths.
优选地, 所述方法还包括:  Preferably, the method further includes:
计算出 VSPT之后, 确定所述 PCE所在的域为所述两个及以上部署有 PCE的域中的非首域时, 将所计算出的 VSPT发送给域序列中上游的下一 部署有 PCE的域的 PCE。  After the VSPT is calculated, when the domain where the PCE is located is the non-first domain in the domain where the two or more PCEs are deployed, the calculated VSPT is sent to the next deployed PCE in the upstream of the domain sequence. Domain PCE.
优选地, 所述 PCE接收到路径计算的触发请求, 包括:  Preferably, the PCE receives the trigger request of the path calculation, including:
所述 PCE接收到路径计算请求消息;  Receiving, by the PCE, a path calculation request message;
或者, 所述 PCE接收到 VSPT。  Alternatively, the PCE receives the VSPT.
优选地, 所述两个及以上部署有 PCE的域中的首域 PCE和尾域 PCE 之间采用扩展 BRPC方式计算路由路径之后, 所述方法还包括:  Preferably, after the routing path is calculated by using the extended BRPC mode between the first domain PCE and the tail domain PCE in the domain where the PCE is deployed, the method further includes:
从源节点向目的节点发送信令;  Sending signaling from the source node to the destination node;
所述信令路由至通过 PCE所在的域计算的 VSPT对应路由路径时, 按 所述 VSPT对应路由路径路由所述信令;  When the signaling is routed to the VSPT corresponding routing path calculated by the domain in which the PCE is located, the signaling is routed according to the VSPT corresponding routing path;
所述信令路由至通过扩展链路拓朴计算的 VSPT对应路由路径时, 进 一步由 RC计算未部署 PCE的域的松散跳路径对应的域内严格跳路径, 并 按计算出的严格跳路径路由所述信令。  When the signaling is routed to the VSPT corresponding routing path calculated by the extended link topology, the RC calculates the strict hopping path in the domain corresponding to the loose hopping path of the domain in which the PCE is not deployed, and calculates the strict hop path routing path. Signaling.
一种多域路由计算装置, 包括确定单元和计算单元, 其中:  A multi-domain routing computing device includes a determining unit and a computing unit, wherein:
确定单元, 配置为确定网络中部署有 PCE的域为两个及以上时, 触发 所述计算单元;  Determining a unit, configured to determine that the domain in which the PCE is deployed in the network is two or more, triggering the computing unit;
计算单元,配置为在所述两个及以上部署有 PCE的域中的首域 PCE和 尾域 PCE之间采用扩展 BRPC方式计算路由路径, 在所述两个及以上部署 有 PCE的域之外的域采用 RC计算路由路径。  a computing unit configured to calculate a routing path by using an extended BRPC method between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed, where the two or more domains are deployed with PCE The domain uses RC to calculate the routing path.
优选地, 所述计算单元包括接收子单元、 第一确定子单元、 第二确定 子单元、 第一计算子单元和第二计算子单元, 其中: 接收子单元, 配置为接收路径计算的触发请求; Preferably, the calculating unit comprises a receiving subunit, a first determining subunit, a second determining subunit, a first calculating subunit and a second calculating subunit, wherein: a receiving subunit configured to receive a trigger request for path calculation;
第一确定子单元, 配置为确定所述计算单元所属 PCE所在的域是否为 尾域, 是时触发所述第一计算子单元; 为非尾域时触发所述第二确定子单 元;  a first determining subunit, configured to determine whether a domain in which the PCE to which the computing unit belongs is a tail domain, triggering the first computing subunit when triggered; and triggering the second determining subunit when not a tail domain;
第二确定子单元, 配置为确定所述计算单元所属 PCE所在的域与域序 列中下游的下一部署 PCE的域之间是否存在未部署 PCE的域,不存在时触 发所述第一计算子单元; 存在时触发所述第二计算子单元;  a second determining sub-unit, configured to determine whether there is a domain in which the PCE is not deployed between the domain where the PCE to which the computing unit belongs and the domain of the next deployed PCE in the downstream of the domain sequence, and the first computing sub-trigger is triggered when not present Unit; triggering the second computing subunit when present;
第一计算子单元, 配置为计算所述计算单元所属 PCE 所在的域的 VSPT;  a first computing subunit configured to calculate a VSPT of a domain in which the computing unit belongs to the PCE;
第二计算子单元, 配置为将所述未部署 PCE的域的域内抽象链路、 未 部署 PCE的域之间的域间链路作为扩展链路拓朴, 并与所述计算单元所属 PCE所在的域的链路拓朴合并, 计算合并后链路拓朴的 VSPT。  a second computing sub-unit, configured to use an intra-domain abstract link between the domain in which the PCE is not deployed, and an inter-domain link between domains in which the PCE is not deployed as an extended link topology, and where the computing unit belongs to the PCE The link topology of the domain is merged, and the VSPT of the merged link topology is calculated.
优选地, 所述计算单元还包括标识子单元, 配置为在所述第二计算子 单元计算合并后链路拓朴的 VSPT之后,将通过扩展链路拓朴计算的 VSPT 对应路由路径、 通过所述计算单元所属 PCE所在的域计算的 VSPT对应路 由路径标识为不同类型的路由路径。  Preferably, the calculating unit further includes an identifier subunit configured to: after the VSPT of the merged link topology is calculated by the second calculating subunit, the VSPT corresponding routing path calculated by the extended link topology, The VSPT corresponding routing path identifier calculated by the domain where the computing unit belongs to the PCE is a different type of routing path.
优选地, 所述计算单元还包括第三确定子单元和发送子单元, 其中: 第三确定子单元, 配置为在计算出 VSPT之后, 确定所述 PCE所在的 域为所述两个及以上部署有 PCE的域中的非首域时,触发所述发送子单元; 发送子单元, 配置为将所计算出的 VSPT发送给域序列中上游的下一 部署有 PCE的域的 PCE。  Preferably, the calculating unit further includes a third determining subunit and a sending subunit, where: the third determining subunit is configured to: after calculating the VSPT, determining that the domain where the PCE is located is the two or more deployments When there is a non-first domain in the domain of the PCE, the sending subunit is triggered; the sending subunit is configured to send the calculated VSPT to the PCE of the next domain in which the PCE is deployed upstream in the domain sequence.
优选地, 所述接收子单元还配置为, 接收到路径计算请求消息; 或者, 接收到 VSPT。  Preferably, the receiving subunit is further configured to receive a path calculation request message; or, receive a VSPT.
优选地, 所述装置还包括发送单元和路由单元, 其中:  Preferably, the device further includes a sending unit and a routing unit, where:
发送单元, 配置为从源节点向目的节点发送信令; 路由单元, 配置为在所述信令路由至通过 PCE所在的域计算的 VSPT 对应路由路径时, 按所述 VSPT对应路由路径路由所述信令; 在所述信令 路由至通过扩展链路拓朴计算的 VSPT对应路由路径时,进一步由 RC计算 未部署 PCE的域的松散跳路径对应的域内严格跳路径, 并按计算出的严格 跳路径路由所述信令。 a sending unit, configured to send signaling from the source node to the destination node; a routing unit, configured to: when the signaling is routed to a VSPT corresponding routing path calculated by a domain where the PCE is located, routing the signaling according to the VSPT corresponding routing path; and routing the signaling to the extended link When the VSPT corresponding routing path is calculated, the RC calculates a strict hop path within the domain corresponding to the loose hop path of the domain in which the PCE is not deployed, and routes the signaling according to the calculated strict hop path.
一种路径计算单元, 包括接收单元、 第一确定单元、 第二确定单元、 第一计算单元和第二计算单元, 其中:  A path calculation unit includes a receiving unit, a first determining unit, a second determining unit, a first calculating unit, and a second calculating unit, where:
接收单元, 配置为接收路径计算的触发请求;  a receiving unit configured to receive a trigger request for path calculation;
第一确定单元, 配置为确定所述路径计算单元所在的域是否为尾域, 为尾域时触发所述第一计算单元; 为非尾域时触发所述第二确定单元; 第二确定单元, 配置为确定所述路径计算单元所在的域与域序列中下 游的下一部署 PCE的域之间是否存在未部署 PCE的域,不存在时触发所述 第一计算单元; 存在时触发所述第二计算单元;  a first determining unit, configured to determine whether the domain in which the path calculation unit is located is a tail domain, triggering the first computing unit when the tail domain is the second determining unit; Configuring to determine whether there is a domain in which the PCE is not deployed between the domain in which the path calculation unit is located and the domain of the next deployed PCE in the domain sequence, and triggering the first computing unit when not present; Second computing unit;
第一计算单元, 配置为计算所述路径计算单元所在的域的虚拟最短路 径树 VSPT;  a first calculating unit, configured to calculate a virtual shortest path tree VSPT of a domain in which the path calculating unit is located;
第二计算单元, 配置为将所述未部署 PCE的域的域内抽象链路、 未部 署 PCE的域之间的域间链路作为扩展链路拓朴, 并与所述路径计算单元所 在的域的链路拓朴合并, 计算合并后链路拓朴的 VSPT。  a second computing unit, configured to use an intra-domain abstract link of the domain in which the PCE is not deployed, and an inter-domain link between domains in which the PCE is not deployed as an extended link topology, and the domain in which the path calculation unit is located The link topology is merged to calculate the VSPT of the merged link topology.
优选地, 所述路径计算单元还包括标识单元, 配置为在所述第二计算 单元计算合并后链路拓朴的 VSPT之后,将通过扩展链路拓朴计算的 VSPT 对应路由路径、 通过所述路径计算单元所在的域计算的 VSPT对应路由路 径标识为不同类型的路由路径。  Preferably, the path calculation unit further includes an identification unit configured to: after the second computing unit calculates the VSPT of the merged link topology, calculate a VSPT corresponding routing path through the extended link topology, by using the The VSPT corresponding routing path calculated by the domain where the path calculation unit is located is identified as a different type of routing path.
优选地, 所述路径计算单元还包括第三确定单元和发送单元, 其中: 第三确定单元, 配置为在计算出 VSPT之后, 确定所述 PCE所在的域 为所述两个及以上部署有 PCE的域中的非首域时, 触发所述发送单元; 发送单元, 配置为将所计算出的 VSPT发送给域序列中上游的下一部 署有 PCE的域的 PCE。 Preferably, the path calculation unit further includes a third determining unit and a sending unit, where: the third determining unit is configured to: after calculating the VSPT, determining that the domain in which the PCE is located is the PCE in which the two or more are deployed The sending unit is triggered when the non-first domain in the domain is in the domain; The sending unit is configured to send the calculated VSPT to the PCE of the next domain in which the PCE is deployed upstream in the domain sequence.
优选地, 所述接收单元还配置为, 接收路径计算请求消息; 或者, 接 收 VSPT。  Preferably, the receiving unit is further configured to receive a path calculation request message; or, receive the VSPT.
一种路由网络, 包括有一个以上的路由域, 所述路由域中设置有前述 的路径计算单元。  A routing network includes more than one routing domain, and the routing domain is provided with the foregoing path computing unit.
本发明中, 确定网络中部署有 PCE的域为两个及以上时, 在所述两个 及以上部署有 PCE的域中的首域 PCE和尾域 PCE之间采用反向递归路径 计算 BRPC方式计算路由路径, 在所述两个及以上部署有 PCE的域之外的 域采用域间路由协议 DDRP计算路由路径。 采用 BRPC方式计算路由路径 具体为: PCE接收到路径计算的触发请求后, 确定所述 PCE所在的域是否 为尾域, 为尾域时计算本域的虚拟最短路径树 VSPT, 为非尾域时进一步确 定所述 PCE所在的域与域序列中下游的下一部署 PCE的域之间是否存在未 部署 PCE的域, 不存在时计算本域的虚拟最短路径树 VSPT, 存在时将所 述未部署 PCE的域的域内抽象链路、未部署 PCE的域之间的域间链路作为 扩展链路拓朴, 并与所述 PCE所在的域的链路拓朴合并, 计算合并后链路 拓朴的 VSPT。本发明的技术方案针对网络中已部署 PCE的域和未部署 PCE 的域的混合组网情况, 将未部署 PCE的域的域拓朴作为原 BRPC算法计算 过程中域间链路的扩展拓朴, 并在每个 PCE的 BRPC计算时使用该拓朴生 成本域的虚拟最短路径树, 从而解决了由于未部署 PCE的域的存在造成无 法实施 BRPC算法的问题, 改善了路径的最优性。 附图说明  In the present invention, when it is determined that the domain in which the PCE is deployed in the network is two or more, the reverse recursive path is used to calculate the BRPC mode between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed. The routing path is calculated, and the routing path is calculated by using the inter-domain routing protocol DDRP in the domain other than the two or more domains in which the PCE is deployed. The calculation of the routing path by using the BRPC method is as follows: After receiving the trigger request of the path calculation, the PCE determines whether the domain where the PCE is located is a tail domain, and when the tail domain is a tail domain, the virtual shortest path tree VSPT of the domain is calculated, which is a non-tail domain. Determining whether there is a domain in which the PCE is not deployed between the domain where the PCE is located and the domain of the next deployed PCE in the downstream of the domain sequence. If not, the virtual shortest path tree VSPT of the local domain is calculated. The intra-domain link between the domain of the PCE domain and the inter-domain link between the domains where the PCE is not deployed is used as the extended link topology and merged with the link topology of the domain where the PCE is located to calculate the merged link topology. VSPT. The technical solution of the present invention is directed to the hybrid topology of the domain where the PCE is deployed and the domain where the PCE is not deployed. The domain topology of the domain where the PCE is not deployed is used as the extended topology of the inter-domain link in the calculation process of the original BRPC algorithm. And use the topology to generate the virtual shortest path tree of the domain in the calculation of the BRPC of each PCE, thereby solving the problem that the BRPC algorithm cannot be implemented due to the existence of the domain in which the PCE is not deployed, and improving the optimality of the path. DRAWINGS
图 1为采用 RC的 DDRP拓朴生成示意图;  Figure 1 is a schematic diagram of DDRP topology generation using RC;
图 2为采用 RC的多域路径计算示意图;  Figure 2 is a schematic diagram of multi-domain path calculation using RC;
图 3为采用 PCE的多域路径计算示意图; 图 4为多域路由互通计算示意图; 3 is a schematic diagram of multi-domain path calculation using PCE; 4 is a schematic diagram of multi-domain routing interworking calculation;
图 5为本发明的多域路由计算示意图;  FIG. 5 is a schematic diagram of multi-domain routing calculation according to the present invention; FIG.
图 6为本发明实施例一的多域路由计算示意图;  6 is a schematic diagram of multi-domain routing calculation according to Embodiment 1 of the present invention;
图 7为本发明实施例二的多域路由计算示意图;  7 is a schematic diagram of multi-domain routing calculation according to Embodiment 2 of the present invention;
图 8为本发明实施例三的多域路由计算示意图;  8 is a schematic diagram of multi-domain routing calculation according to Embodiment 3 of the present invention;
图 9为本发明实施例的多域路由计算装置的组成结构示意图; 图 10为本发明实施例的多域路由计算装置的计算单元的组成结构示意 图;  9 is a schematic structural diagram of a multi-domain routing computing device according to an embodiment of the present invention; FIG. 10 is a schematic structural diagram of a computing unit of a multi-domain routing computing device according to an embodiment of the present invention;
图 11为本发明实施例的路径计算单元的组成结构示意图。 具体实施方式  FIG. 11 is a schematic structural diagram of a path calculation unit according to an embodiment of the present invention. detailed description
为使本发明的目的, 技术方案和优点更加清楚明白, 以下举实施例并 参照附图, 对本发明进一步详细说明。  The present invention will be further described in detail below with reference to the accompanying drawings.
本发明针对网络中已部署 PCE的域和未部署 PCE的域的混合组网,对 现有 BRPC算法进行扩展, 将未部署 PCE的域的域拓朴作为原 BRPC算法 计算过程中域间链路的扩展拓朴, 并在每个 PCE的 BRPC计算时使用该拓 朴生成本域的虚拟最短路径树。 首先, 在实施跨域路径计算之前, 对于未 部署 PCE的域, 采用 RC的 DDRP, 洪泛各自的域拓朴, 包括域间链路、 域内抽象链路和域边界节点的信息。 对于部署 PCE的域则需要配置其 PCE 邻居信息或采用 RFC5088的要求洪泛 PCE的自动发现信息以便自动获得 PCE邻居信息。 然后, 开始实施跨域路径计算, 如果尚未到配置 PCE的域, 则一直采用每域路径计算方法算路, 直到信令到达配置 PCE的域, 则该域 PCE作为 BRPC算法的首域 PCE, 沿域序列, 依次发送路径计算请求, 直 到域序列中最后一个配置 PCE的域的 PCE结束, 该域 PCE作为 BRPC算 法的尾域 PCE。在该首域 PCE和尾域 PCE之间采用 BRPC算法计算,对于 其中存在的未配置 PCE的域的域拓朴, 将其作为域间链路的扩展拓朴, 由 其最邻近的上游域 PCE在 BRPC计算时使用。 当整个 BRPC过程完成时, 部署 PCE的域中路径段表示为严格跳路径,而未部署 PCE的域中路径段表 示为松散跳路径。 最后, 沿 BRPC计算出的路由建立信令, 对于严格跳路 径, 直接建立信令即可。 对于松散跳路径, 则在每个域内完成具体域内路 径算路, 并建立信令。 如果域序列中在最后一个部署 PCE的域后还存在未 部署 PCE的域, 则继续采用每域路径计算算法计算路由, 直到到达目的节 点, 则本次多域路由互通计算完成。 The present invention is directed to a hybrid network of a domain in which a PCE is deployed in a network and a domain in which a PCE is not deployed. The existing BRPC algorithm is extended, and the domain topology of the domain in which the PCE is not deployed is used as the inter-domain link in the calculation process of the original BRPC algorithm. The extension topology is used, and the topology is used to generate the virtual shortest path tree of the domain in the BRPC calculation of each PCE. First, before the cross-domain path calculation is implemented, the RC DDRP is used for the domain where the PCE is not deployed, and the domain topology is flooded, including the information of the inter-domain link, the intra-domain abstract link, and the domain boundary node. For the domain where the PCE is deployed, you need to configure its PCE neighbor information or use the automatic discovery information of RFC5088 to flood the PCE to automatically obtain PCE neighbor information. Then, the cross-domain path calculation is started. If the domain of the PCE has not been configured, the path calculation method of each domain is always used until the signaling reaches the domain where the PCE is configured. The domain PCE is the first domain PCE of the BRPC algorithm. The domain sequence, in turn, sends a path computation request until the PCE of the domain of the last configured PCE in the domain sequence ends, and the domain PCE acts as the tail domain PCE of the BRPC algorithm. The BRPC algorithm is used between the first domain PCE and the tail domain PCE. For the domain topology of the domain where the PCE is not configured, it is used as the extended topology of the inter-domain link. Its nearest upstream domain PCE is used in BRPC calculations. When the entire BRPC process is complete, the path segment in the domain where the PCE is deployed is represented as a strict hop path, and the path segment in the domain where the PCE is not deployed is represented as a loose hop path. Finally, the route establishment signaling calculated along the BRPC can be directly established for the strict hop path. For the loose hop path, the path calculation in the specific domain is completed in each domain, and signaling is established. If there is a domain in which the PCE is not deployed after the last domain in which the PCE is deployed, the per-domain path calculation algorithm is used to calculate the route until the destination node is reached, and the multi-domain routing interworking calculation is completed.
本发明扩展了 BRPC算法的使用场景, 使得域序列中仅需最少两个域 部署 PCE就能使用 BRPC算法,并且对这两个部署 PCE的域在域序列中的 相对位置没有限制。 当然, 二者越靠近两端, 则本发明方法的优势越明显。 并且,对于部署 PCE的域和未部署 PCE的域在域序列中相互间隔的情况下, 本发明的技术方案也可以仅采用一次 BRPC计算过程完成计算, 最大程度 地保证路径最优性。  The present invention extends the use scenario of the BRPC algorithm so that only a minimum of two domains in the domain sequence can be deployed to deploy the PCE to use the BRPC algorithm, and there is no limit to the relative positions of the domains of the two deployed PCEs in the domain sequence. Of course, the closer the two are to the ends, the more obvious the advantages of the method of the invention. Moreover, in the case that the domain in which the PCE is deployed and the domain in which the PCE is deployed are spaced apart from each other in the domain sequence, the technical solution of the present invention can also complete the calculation by using only one BRPC calculation process to ensure the path optimality to the greatest extent.
本发明的技术方案对域序列的指定或计算没有限制, 已部署 PCE的域 和未部署 PCE的域可以在域序列中任意排列。 并且, 对于未部署 PCE的域 的域间拓朴洪泛和 PCE的邻居发现均为现有技术, 无需针对本发明方法进 行扩展。  The technical solution of the present invention has no limitation on the designation or calculation of the domain sequence, and the domain in which the PCE is deployed and the domain in which the PCE is not deployed may be arbitrarily arranged in the domain sequence. Moreover, the inter-domain topology flooding of the domain where the PCE is not deployed and the neighbor discovery of the PCE are both prior art and need not be extended for the method of the present invention.
如图 5 ( a )所示, 假定需要计算从 SN (源节点 )到 DN (目的节点 ) 的多域路由, 其中经过的域存在部署了 PCE的域, 以及未部署 PCE的域。 下面将采用本发明方法描述其计算过程。  As shown in Figure 5 (a), it is assumed that multi-domain routing from SN (source node) to DN (destination node) needs to be calculated, where the domain that passes through exists has a domain in which PCE is deployed, and a domain in which PCE is not deployed. The calculation process will be described below using the method of the present invention.
本发明中, 作如下约定:  In the present invention, the following convention is made:
1 ) AS ( 0 )、 AS ( N ): 分别表示多域路由互通计算的源节点所在域和 目的节点所在域;  1) AS ( 0 ), AS ( N ): respectively represent the domain of the source node and the domain of the destination node for multi-domain routing interworking calculation;
2 ) AS ( 1 )、 AS ( n ): 表示多域路由域序列中第一个部署 PCE的域和 最后一个部署了 PCE的域; 3) AS (i): 表示多域路由域序列中某个未部署 PCE的域;2) AS ( 1 ), AS ( n ): indicates the first domain in the multi-domain routing domain to deploy the PCE and the last domain in which the PCE is deployed; 3) AS (i): indicates a domain of a multi-domain routing domain sequence in which no PCE is deployed;
4) AS ( i-1 ): 表示 AS (i)域的最临近的上游域中部署了 PCE的域;4) AS ( i-1 ): indicates the domain in which the PCE is deployed in the nearest upstream domain of the AS (i) domain;
5) AS ( i+1 ): 表示 AS (i)域的最临近的下游域中部署了 PCE的域;5) AS ( i+1 ): indicates the domain in which the PCE is deployed in the nearest downstream domain of the AS (i) domain;
6 ) PCE ( 1 )、 PCE ( n)、 PCE ( i-1 )、 PCE ( i+1 ): 分别表示 AS ( 1 )、 AS (n)、 AS (i-l)、 AS (i+1 )所对应的 PCE单元; 6) PCE ( 1 ), PCE ( n), PCE ( i-1 ), PCE ( i+1 ): represent AS ( 1 ), AS (n), AS (il), AS (i+1) Corresponding PCE unit;
7 ) SN、 DN: 分别表示 AS ( 0 )中的源节点和 AS ( N )中的目的节点; 7) SN, DN: respectively represent the source node in AS ( 0 ) and the destination node in AS ( N );
8 ) SN,、 DN': 表示 AS ( 1 ) 的信令到达的入口边界节点和 AS ( n) 的信令离开的出口边界节点; 8) SN, DN': an ingress boundary node indicating the arrival of the signaling of AS (1) and an egress boundary node leaving the signaling of AS (n);
9 ) BN-en, BN-ex: 分别表示各域中的入边界节点和出边界节点; 9) BN-en, BN-ex: respectively represent the inbound and outbound nodes in each domain;
10) Al、 A2、 A3、 A4、 Bl、 B2、 B3、 B4、 Cl、 C2: 表示 AS ( i-1 )、 AS (i)、 AS (i+1 ) 的边界节点。 10) Al, A2, A3, A4, Bl, B2, B3, B4, Cl, C2: represent the boundary nodes of AS ( i-1 ), AS (i), AS (i+1 ).
上述约定仅为方便描述本发明方法所使用, 并不限定本发明的组网的 方式。 由于本发明的方法不涉及域序列的确定, 因此, 所有本发明方法均 基于给定的域序列 (域经过序列, 如 AS1 _ >AS2 - >AS3 )。  The above conventions are only used to facilitate the description of the method of the present invention, and do not limit the manner in which the network of the present invention is networked. Since the method of the invention does not involve the determination of domain sequences, all methods of the invention are based on a given domain sequence (domain-passing sequences, such as AS1_>AS2 ->AS3).
本发明多域路由互通计算的过程描述如下:  The process of multi-domain routing interworking calculation of the present invention is described as follows:
步骤 1: 各域均采用 DDRP通告其域间拓朴信息, 包括域边界节点、 域间链路和域内抽象链路, 如采用图 1所示方式。  Step 1: Each domain uses DDRP to advertise its inter-domain topology information, including domain border nodes, inter-domain links, and intra-domain abstract links, as shown in Figure 1.
步骤 2: 各部署有 PCE的域的 PCE均通过洪泛 PCE自动发现信息, 获 得 PCE的邻居关系。 对于没有部署 PCE的域则不会洪泛 PCE 自动发现信 息。 通过 SN或 BN-en查找本域 PCE自动发现信息来判断本域是否部署了 PCE。  Step 2: The PCEs of each domain that has a PCE are automatically discovered by flooding the PCE to obtain the neighbor relationship of the PCE. PCE auto-discovery information is not flooded for domains that do not have a PCE deployed. Use SN or BN-en to find the PCE auto discovery information in this domain to determine whether PCE is deployed in the domain.
步骤 3: 如图 5 (a)所示, 从 AS (0)开始依次沿域序列, 由 SN或 BN-en判断本域是否是部署 PCE的域:  Step 3: As shown in Figure 5 (a), starting from AS (0), along the domain sequence, SN or BN-en determines whether the domain is a domain where PCE is deployed:
1)如果不是部署 PCE的域, 并且没有到达 AS (N), 则采用每域路径 计算方法计算该域路由(本域 BN-en到本域 BN-ex ), 并由该域 BN-ex选择 下一个域的 BN-en。 并将信令路由到该 BN-en。 重复执行步骤 3; 1) If the domain of the PCE is not deployed, and the AS (N) is not reached, the domain path calculation method is used to calculate the domain route (the local domain BN-en to the local domain BN-ex), and the domain BN-ex is selected. BN-en of the next domain. Route signaling to the BN-en. Repeat step 3;
2 )如果是部署 PCE的域, 执行步骤 4;  2) If it is a domain where PCE is deployed, go to step 4;
3)如果不是部署 PCE的域, 并且已经到达 AS (N), 则采用每域路径 计算方法计算该域路由 (本域 BN-en到 DN ), 并将信令路由到 DN, 执行 步骤 8;  3) If the domain of the PCE is not deployed, and the AS (N) has been reached, the domain path calculation method is used to calculate the domain route (the local domain BN-en to DN), and the signaling is routed to the DN, and step 8 is performed;
步骤 4: PCE ( 1 )将 AS ( 1 )作为 BRPC计算的首域, 并根据 PCE的 邻居关系, 查找到域序列中最后一个部署 PCE的域 AS (n), 并作为 BRPC 计算的尾域。 AS ( 1 )将目前信令到达本域的入边界节点作为 BRPC算路的 源节点,并且根据 DDRP域间拓朴,选择 AS ( n )的出口边界节点作为 BRPC 算路的目的节点。 PCE ( 1 )沿 PCE序列发送 BRPC路径计算请求消息, 直 到 PCE (n), 如图 5 (a)所示;  Step 4: PCE (1) uses AS ( 1 ) as the first domain of BRPC calculation, and according to the neighbor relationship of PCE, finds the domain AS (n) of the last deployed PCE in the domain sequence, and uses it as the tail domain of BRPC calculation. AS (1) uses the inbound boundary node of the current signaling to the local domain as the source node of the BRPC algorithm, and according to the DDRP inter-domain topology, selects the exit boundary node of AS (n) as the destination node of the BRPC algorithm. PCE (1) sends a BRPC path calculation request message along the PCE sequence until PCE (n), as shown in Figure 5 (a);
步骤 5: 在 BRPC的处理过程中, 对于 i = n到 1, AS ( i ) 如下处理: Step 5: During the processing of the BRPC, for i = n to 1, AS ( i ) is handled as follows:
1 )如果 i = n, AS (n) 的 PCE (n)按照一般 BRPC的尾域计算方法, 计算本域 VSPT (n)树, 并将 VSPT (n)树承载于路由计算响应消息中发 送给上游域 PCE, 重复执行步骤 5; 1) If i = n, the PCE (n) of AS (n) calculates the local VSPT (n) tree according to the general BRPC tail domain calculation method, and sends the VSPT (n) tree to the route calculation response message. The upstream domain PCE, repeat step 5;
2)如果 l<i<n, 对于每个 AS (i), 进一步的, 根据 AS (i)是否部署 PCE, 分别按照方法 A和方法 B处理:  2) If l<i<n, for each AS (i), further, according to AS (i) whether to deploy PCE, according to Method A and Method B respectively:
方法 A (已部署 PCE):  Method A (Deployed PCE):
A-1: AS (i) 的 PCE (i)按照一般 BRPC的中间域计算方法, 计算本 域 VSPT (i)树, 并将 VSPT (i)树插入到路由计算响应消息中, 由 PCE (i)发送给上游域 PCE处理, 重复执行步骤 5;  A-1: PCE of AS (i) (i) Calculate the local VSPT (i) tree according to the intermediate domain calculation method of the general BRPC, and insert the VSPT (i) tree into the route calculation response message, by PCE (i) ) sent to the upstream domain PCE processing, repeat step 5;
方法 B (未部署 PCE):  Method B (PCE not deployed):
B-1: 如图 5 (b)所示, PCE (i+1 )将 VSPT ( i+1 )通过路径计算响 应消息发送给 PCE ( i-1 )。 PCE ( i-1 )根据 BRPC算法, 需计算 A1和 A2 到目的节点 DN的 VSPT树。其中 AS( i )域拓朴为域间链路( A3-B1、 A4-B2、 B3-C1、 B4-C2)、 域内抽象链路(Bl-B3、 Bl-B4、 B2-B3、 B2-B4 ); B-1: As shown in FIG. 5(b), PCE (i+1) transmits VSPT (i+1) to PCE (i-1) through a path calculation response message. According to the BRPC algorithm, PCE (i-1) needs to calculate the VSPT tree from A1 and A2 to the destination node DN. The AS(i) domain topology is an inter-domain link (A3-B1, A4-B2). B3-C1, B4-C2), intra-domain abstract links (Bl-B3, Bl-B4, B2-B3, B2-B4);
B-2: 如图 5 (c)所示, PCE (i-1 )将 AS (i)的域拓朴视为本域(AS (i-1 )) 出边界节点( A3/A4 )到下游域( AS ( i+1 ) )入边界节点 C1/C2的 域间链路扩展拓朴, 和 AS (i-l )中的域内实际拓朴(A1/A2到 A3/4)合并 作为本域 BRPC计算使用的拓朴;  B-2: As shown in Figure 5 (c), PCE (i-1) regards the domain topology of AS (i) as the local (AS (i-1)) outbound node (A3/A4) to the downstream The domain (AS ( i+1 )) enters the inter-domain link extension topology of the border node C1/C2, and the intra-domain actual topology (A1/A2 to A3/4) in AS (il) is merged as the local domain BRPC calculation. Topology used;
B-3: 如图 5 (c)所示, PCE ( i-1 )计算 A1/A2到 C1/C2的最短路径, 并与下游域 VSPT ( i+1 )树拼接, 计算本域 VSPT ( i-1 )树, 其中, 特别的, VSPT ( i-1 )在 AS ( i ) 中的路径采用松散跳路径方式表示, 而在 AS ( i-1 ) 中路径采用严格跳路径方式表示。 PCE ( i-1 )将 VSPT ( i-1 )树承载于路由 计算响应消息中, 由 PCE ( i-1 )发送给上游域 PCE处理, 重复执行步骤 5;  B-3: As shown in Figure 5 (c), PCE (i-1) calculates the shortest path from A1/A2 to C1/C2 and splices it with the downstream domain VSPT (i+1) tree to calculate the local VSPT (i -1) Tree, where, in particular, the path of VSPT (i-1) in AS ( i ) is represented by a loose hop path, while in AS ( i-1 ) the path is represented by a strict hop path. The PCE (i-1) carries the VSPT (i-1) tree in the route calculation response message, and sends it to the upstream domain PCE for processing by the PCE (i-1), and repeats step 5;
3 )如果 i = 1, AS ( 1 ) 的 PCE ( 1 )按照一般 BRPC的首域计算方法, 计算本域 VSPT ( 1 )树, 并生成 SN, 到 DN, 的最终路径, 执行步骤 6;  3) If i = 1, AS ( 1 ) PCE ( 1 ) according to the general BRPC first domain calculation method, calculate the domain VSPT ( 1 ) tree, and generate the final path to SN, to DN, go to step 6;
步骤 6: 信令从 SN, 开始, 沿计算出的 SN, 到 DN, 路径进行路由。 进一步的, 对于路由中对于以严格跳路径方式表示的路径直接进行路由; 对于以松散跳路径方式表示的路径则在该域发起两个松散跳路径之间的域 内计算过程, 计算方式与一般单域中计算过程一致, 并执行步骤 7;  Step 6: Signaling starts from the SN, and routes along the calculated SN, to DN, path. Further, in the route, the route represented by the strict hop path is directly routed; for the path represented by the loose hop path, the intra-domain calculation process between the two loose hop paths is initiated in the domain, and the calculation mode and the general order are The calculation process in the domain is consistent, and step 7 is performed;
步骤 7: 信令到达 DN', 后续各域均为未部署 PCE的域, 采用一般每 域路径计算方法计算路由, 并路由信令, 直到信令到达 DN, 执行步骤 8;  Step 7: The signaling arrives at the DN', and the subsequent domains are all domains in which the PCE is not deployed. The general path calculation method is used to calculate the route, and the signaling is routed until the signaling reaches the DN, and step 8 is performed;
步骤 8: 多域路由互通计算完成。  Step 8: The multi-domain routing interworking calculation is completed.
实施例一  Embodiment 1
本示例的应用场景为: 首域和尾域为部署 PCE的域, 中间域为未部署 PCE的域。  The application scenario of this example is as follows: The first domain and the tail domain are the domains where the PCE is deployed, and the intermediate domain is the domain where the PCE is not deployed.
如图 6所示, 示出了四个 AS ( AS ( 1 )、 AS (2)、 AS ( 3 )、 AS (4)), 其中 AS ( 1 )和 AS (4)部署了 PCE (分别为 PCE ( 1 )和 PCE (4)), 而 AS ( 2 )和 AS ( 3 )未部署 PCE。 Rl和 R15为多域路径计算的源节点和目 的节点。 拓朴中链路代价均为 1。 各域的域间拓朴已经通过 DDRP洪泛, 并且 PCE的自动发现信息也按照 RFC5088的要求洪泛出来。 PCE ( 1 )和 PCE ( 4 )可以看到域间拓朴, 并且建立了 PCE的邻居关系。 多域路由计算 过程如下: As shown in Figure 6, four ASs (AS (1), AS (2), AS (3), AS (4)) are shown, where AS (1) and AS (4) deploy PCE (respectively PCE (1) and PCE (4)), while AS (2) and AS (3) did not deploy PCE. Rl and R15 are source nodes and destinations for multi-domain path computation Node. The link cost in the topology is 1. The inter-domain topology of each domain has been flooded by DDRP, and the automatic discovery information of PCE is also flooded according to the requirements of RFC5088. PCE (1) and PCE (4) can see the inter-domain topology and establish the neighbor relationship of PCE. The multi-domain routing calculation process is as follows:
( 1 )路径计算请求消息从 R1发送到 PCE ( 1 ), 要求 PCE ( 1 )计算 (1) The path calculation request message is sent from R1 to PCE (1), requiring PCE (1) calculation
R1到 R15的多域路径; Multi-domain path from R1 to R15;
( 2 ) PCE ( 1 )根据域序列, 以及 PCE的自动发现信息中 PCE的邻居 关系, 确定域序列中最后一个 PCE为 PCE ( 4 ), 对应域为 AS ( 4 ), 向 PCE ( 4 )转发路径计算请求消息;  (2) PCE (1) determines the last PCE in the domain sequence as PCE (4) according to the domain sequence and the neighbor relationship of PCE in the automatic discovery information of PCE, and the corresponding domain is AS (4), and forwards to PCE (4). Path calculation request message;
( 3 ) PCE ( 4 )计算本域的 VSPT树, 记为 VSPT ( 4 ), 并将 VSPT ( 4 ) 承载于路径计算响应消息中返回给 PCE ( 1 );  (3) PCE (4) calculates the VSPT tree of this domain, denoted as VSPT (4), and carries VSPT(4) in the path calculation response message and returns it to PCE (1);
( 4 ) PCE ( 1 )收到 PCE ( 4 )的 VSPT ( 4 )后, 将域间拓朴中 AS ( 2 ) 和 AS ( 3 ) 中的域间链路、 域内抽象链路(虚线所示 )作为 PCE ( 1 )和 PCE ( 4 )之间的域间链路扩展拓朴, 然后, 由 PCE ( 1 )将其本域域内拓 朴,以及域间链路扩展拓朴合并,计算 R1到 R13和 R1到 R14的最优路径, 并和 VSPT ( 4 )中路径进行拼接, 形成 VSPT ( 1 ), 也即端到端路径, 表示 为 ERO (显示路由对象): R 1 -R2-R4-R7-R9-R 11 -R 13 -R 15;  (4) After receiving the VSPT ( 4 ) of PCE ( 4 ), PCE ( 1 ) will inter-domain link and intra-domain abstract link in AS ( 2 ) and AS ( 3 ) in the inter-domain topology (shown by dashed line) As an inter-domain link extension topology between PCE (1) and PCE (4), then PCE (1) merges its local domain topology and inter-domain link extension topology to calculate R1 to The optimal path of R13 and R1 to R14, and spliced with the path in VSPT (4) to form VSPT (1), that is, the end-to-end path, expressed as ERO (display routing object): R 1 -R2-R4- R7-R9-R 11 -R 13 -R 15;
( 5 )信令沿 ERO路由到 R4, ERO= R4-R7-R9-R11-R13-R15;  (5) The signaling is routed along the ERO to R4, ERO= R4-R7-R9-R11-R13-R15;
( 6 ) R4-R7 为松散跳路径, 在 R4 计算 R4 到 R7 的域内路径, 为 R4-R6-R7, 扩展 ERO为 R4-R6-R7-R9-R11-R13-R15, 沿 ERO路由到 R9, ER0=R9-R11-R13-R15;  (6) R4-R7 is a loose hop path. The R4 to R7 domain path is calculated at R4, which is R4-R6-R7, and the extended ERO is R4-R6-R7-R9-R11-R13-R15, which is routed along the ERO to R9. , ER0=R9-R11-R13-R15;
( 7 )R9-R11为松散跳路径,在 R9计算 R9-R11的域内路径,为 R9-R11, 扩展 ERO为 R9-R11-R13-R15 , 沿 ERO路由到 Rl l, ER0=R11-R13-R15;  (7) R9-R11 is a loose hop path. The intra-domain path of R9-R11 is calculated by R9, which is R9-R11, and the extended ERO is R9-R11-R13-R15, which is routed along the ERO to Rl l, ER0=R11-R13- R15;
( 8 ) R11-R13-R15均为严格跳路径, 依次路由信令, 信令到达 R15, R1到 R15的多域路径计算过程结束。 实施例二 (8) R11-R13-R15 are strict hop paths, routing signaling in sequence, signaling reaches R15, and the multi-domain path calculation process from R1 to R15 ends. Embodiment 2
本示例的应用场景为: 中间域为部署 PCE的域, 首域和尾域为未部署 PCE的域。  The application scenario of this example is as follows: The intermediate domain is the domain where PCE is deployed, and the first domain and the tail domain are domains where PCE is not deployed.
如图 7所示, 示出了四个 AS ( AS ( 1 )、 AS (2)、 AS ( 3 )、 AS (4)), 其中 AS (2)和 AS (3)部署了 PCE (分别为 PCE (2)和 PCE (3)), 而 AS ( 1 )和 AS ( 4 )未部署 PCE。 Rl和 R15为多域路径计算的源节点和目 的节点。 拓朴中链路代价均为 1。 各域的域间拓朴已经通过 DDRP洪泛, 并且 PCE的自动发现信息也按照 RFC5088的要求洪泛出来。 PCE (2)和 PCE (3 )可以看到域间拓朴, 并且建立了 PCE的邻居关系。 则多域路由计 算过程如下:  As shown in Figure 7, four ASs (AS (1), AS (2), AS (3), AS (4)) are shown, where AS (2) and AS (3) deploy PCE (respectively PCE (2) and PCE (3)), while AS (1) and AS (4) do not deploy PCE. Rl and R15 are the source and destination nodes for multi-domain path computation. The link cost in the topology is 1. The inter-domain topology of each domain has been flooded by DDRP, and the automatic discovery information of PCE is also flooded according to the requirements of RFC5088. PCE (2) and PCE (3) can see the inter-domain topology and establish the neighbor relationship of PCE. The multi-domain routing calculation process is as follows:
( 1 ) R1 发现本域没有部署 PCE, 采用每域路径计算方法, 计算得到 R1到 R2的路径为 R1-R2, 并将信令路由到 R2, 并由 R2选择下一个域的 入口边界节点为 R4, 信令沿路由到达 AS (2) 的入边界节点 R4;  (1) R1 finds that PCE is not deployed in this domain. The path calculation method is used for each domain. The path from R1 to R2 is calculated as R1-R2, and the signaling is routed to R2. The entry boundary node of the next domain is selected by R2. R4, the signaling arrives at the inbound boundary node R4 of the AS (2) along the route;
( 2 ) AS ( 2 )的 R4发现本域部署了 PCE, 则向 PCE ( 2 )发起 BRPC 路径计算请求消息;  (2) R4 of AS (2) finds that the PCE is deployed in this domain, and then initiates a BRPC path calculation request message to PCE (2);
( 3 ) PCE ( 2 )根据域序列以及 PCE的自动发现信息中 PCE的邻居关 系, 确定域序列中最后一个 PCE为 PCE ( 3 ), 对应域为 AS ( 3 )。 PCE ( 2 ) 以 R4为 BRPC计算的源节点, 并选择 PCE (3 ) 的出口边界节点 R11作为 BRPC计算的目的节点, 向 PCE ( 3 )转发路径计算请求消息;  (3) PCE (2) determines the last PCE in the domain sequence as PCE (3) according to the domain sequence and the neighbor relationship of PCE in the automatic discovery information of PCE, and the corresponding domain is AS (3). PCE (2) uses R4 as the source node for BRPC calculation, and selects the exit boundary node R11 of PCE (3) as the destination node for BRPC calculation, and forwards the path calculation request message to PCE (3);
(4) PCE ( 3 )计算本域的 VSPT树, 记为 VSPT ( 3 ), 并将 VSPT ( 3 ) 承载于路径计算响应消息中返回给 PCE (2);  (4) PCE (3) calculates the VSPT tree of this domain, denoted as VSPT (3), and returns VSPT(3) to the path computation response message and returns it to PCE (2);
(5) PCE (2) 返回路径计算响应消息给 R3 节点, 路径 ERO 为: R4-R6-R7- -R9-R11, 该 ERO中均为严格跳路径;  (5) PCE (2) returns the path calculation response message to the R3 node, and the path ERO is: R4-R6-R7--R9-R11, and the ERO is a strict hop path;
(6)信令沿 ERO中的严格跳路径路由到 Rll, 并由 R11选择下一个 域的入口节点为 R13; ( 7 ) AS ( 4 )的 R13发现本域未部署 PCE, 则采用每域路径计算方法, 计算本域路由, 选择 R13-R15的路径, 并将信令路由到 R15, 则多域路径 计算过程结束。 (6) The signaling is routed to Rll along the strict hop path in the ERO, and the ingress node of the next domain is selected by R11 as R13; (7) If R3 of AS (4) finds that PCE is not deployed in this domain, the path calculation method of each domain is used to calculate the local route, select the path of R13-R15, and route the signaling to R15. Then the multi-domain path calculation process End.
实施例三  Embodiment 3
本示例的应用场景为: 部署 PCE的域和未部署 PCE的域间隔排列。 如图 8所示, 示出了五个 AS (AS ( 1)、 AS (2)、 AS ( 3 )、 AS ( 4 )、 AS (5)), 其中 AS ( 1 )、 AS (3)、 AS ( 5 )部署了 PCE (分别为 PCE ( 1 )、 PCE ( 3 )、 PCE (5)), 而 AS ( 2 )和 AS ( 4 )未部署 PCE。 Rl和 R19为多 域路径计算的源节点和目的节点。拓朴中链路代价均为 1。各域的域间拓朴 已经通过 DDRP洪泛,并且 PCE的自动发现信息也按照 RFC5088的要求洪 泛出来。 PCE ( 1)、 PCE (3)、 PCE (5)可以看到域间拓朴, 并且建立了 PCE的邻居关系。 则多域路由计算过程如下:  The application scenario of this example is as follows: Deploy the domain of the PCE and the domain spacing of the Deployed PCE. As shown in Figure 8, five ASs (AS (1), AS (2), AS (3), AS (4), AS (5)) are shown, where AS (1), AS (3), AS (5) deployed PCE (PCE (1), PCE (3), PCE (5)), while AS (2) and AS (4) did not deploy PCE. Rl and R19 are source and destination nodes for multi-domain path computation. The link cost in the topology is 1. The inter-domain topology of each domain has been flooded by DDRP, and the automatic discovery information of PCE has also been flooded according to the requirements of RFC5088. PCE (1), PCE (3), and PCE (5) can see the inter-domain topology and establish a PCE neighbor relationship. The multi-domain routing calculation process is as follows:
( 1 ) R1发现本域部署了 PCE, 向本域 PCE ( 1 )请求多域路径计算。  (1) R1 finds that the domain deploys PCE and requests multi-domain path calculation from the domain PCE (1).
( 2 ) PCE ( 1 )根据域序列以及 PCE的自动发现信息中的 PCE的邻居 关系, 确定域序列中最后一个 PCE为 PCE (5), 对于域为 AS (5)。 PCE ( 1 ) 以 Rl为 BRPC计算的源节点, R19为 BRPC计算的目的节点, 向下 游域 PCE转发路径计算请求消息;  (2) PCE (1) determines that the last PCE in the domain sequence is PCE (5) according to the domain sequence and the neighbor relationship of PCE in the automatic discovery information of PCE, and the domain is AS (5). PCE (1) uses R1 as the source node for BRPC calculation, and R19 is the destination node for BRPC calculation, and forwards the path calculation request message to the downstream domain PCE;
(3) PCE (3)收到路径计算请求消息, 并继续转发给 PCE (5);  (3) PCE (3) receives the path calculation request message and continues to forward to the PCE (5);
( 4 ) PCE ( 5 )判断 R19即为本域节点,计算本域 VSPT ( 5 )树( ERO 1: R17-R19, ER02: R18-R19), 并通过路径计算响应消息返回给 PCE ( 3 );  (4) PCE (5) judges that R19 is the domain node, calculates the local VSPT (5) tree (ERO 1: R17-R19, ER02: R18-R19), and returns it to PCE through the path calculation response message (3) ;
(5) PCE (3)收到 PCE (5)的 VSPT (5)后, 将域间拓朴中 AS ( 4 ) 的域间链路、 域内抽象链路 (虚线所示 )作为 PCE ( 3 )和 PCE ( 5 )之间 的域间链路扩展拓朴, 然后, 由 PCE (3 )将其本域域内拓朴, 以及域间链 路扩展拓朴合并, 计算 R9/R10到 R17/R18的最优路径, 并和 VSPT ( 5 ) 中路径进行拼接, 形成 VSPT ( 3 ), 表示为 ERO (显示路由对象): R9-R11-R13-R15-R17-R19和 R10-R11-R13-R15-R17-R19, 并通过路径计算 响应消息返回给 PCE ( 1 ); (5) After receiving the VSPT (5) of the PCE (5), the PCE (3) uses the inter-domain link of the AS ( 4 ) in the inter-domain topology and the intra-domain abstract link (shown by the dotted line) as the PCE ( 3 ) Inter-domain link extension topology with PCE (5), then PCE (3) merges its local domain topology and inter-domain link extension topology to calculate R9/R10 to R17/R18 The optimal path is spliced with the path in VSPT ( 5 ) to form VSPT ( 3 ), denoted as ERO (display route object): R9-R11-R13-R15-R17-R19 and R10-R11-R13-R15-R17-R19, and return to PCE (1) by path calculation response message;
( 6 ) PCE ( 1 )收到 PCE ( 3 )的 VSPT ( 3 )后, 将域间拓朴中 AS ( 2 ) 的域间链路、 域内抽象链路 (虚线所示 )作为 PCE ( 1 )和 PCE ( 3 )之间 的域间链路扩展拓朴, 然后, 由 PCE ( 1 )将其本域域内拓朴, 以及域间链 路扩展拓朴合并, 计算 R1到 R9/R10的最优路径, 并和 VSPT ( 3 ) 中路径 进行拼接, 形成 VSPT ( 1 ), 即为端到端路径, 表示为 ERO (显示路由对 象): R1-R2-R4-R7-R9-R11-R13-R15-R17-R19, 并通过路径计算响应消息返 回给 R1 ;  (6) After receiving the VSPT ( 3 ) of PCE ( 3 ), PCE ( 1 ) takes the inter-domain link of AS ( 2 ) in the inter-domain topology and the intra-domain abstract link (shown by dashed line) as PCE ( 1 ) Inter-domain link extension topology with PCE (3), then PCE (1) merges its local domain topology and inter-domain link extension topology to calculate the optimal R1 to R9/R10 The path is spliced with the path in VSPT ( 3 ) to form VSPT ( 1 ), which is the end-to-end path, denoted as ERO (display routing object): R1-R2-R4-R7-R9-R11-R13-R15 -R17-R19, and return to R1 through the path calculation response message;
( 7 ) R1接收到路径计算响应消息后, 沿 ERO路径路由到 R4, ERO 为: R4-R7-R9-R11-R13-R15-R17-R19;  (7) After receiving the path calculation response message, R1 routes to R4 along the ERO path, and ERO is: R4-R7-R9-R11-R13-R15-R17-R19;
( 8 ) R4发现 R4-R7为松散跳路径, 发起本域的域内计算过程, 得到 R4-R6-R7路径,并将信令路由到 R7, ERO为: R7-R9-R11-R13-R15-R17-R19;  (8) R4 finds that R4-R7 is a loose hopping path, initiates the intra-domain calculation process of the domain, obtains the R4-R6-R7 path, and routes the signaling to R7. The ERO is: R7-R9-R11-R13-R15- R17-R19;
( 9 ) R7 信令沿严格跳路径继续路由到 R13, ERO 为: R13-R15-R17-R19;  (9) The R7 signaling continues to be routed to R13 along the strict hop path. The ERO is: R13-R15-R17-R19;
( 10 ) R13发现 R13-R15为松散跳路径, 发起本域的域内计算过程, 得到 R13-R15路径, 并将信令路由到 R17, ERO为: R17-R19;  (10) R13 finds that R13-R15 is a loose hopping path, initiates the intra-domain calculation process of the local domain, obtains the R13-R15 path, and routes the signaling to R17. The ERO is: R17-R19;
( 11 ) R17根据严格跳路径继续路信令到 R19, 则多域路径计算过程结 束。  (11) R17 continues the path signaling to R19 according to the strict hop path, and the multi-domain path calculation process ends.
由于多域路由互通计算中部署 PCE的域和未部署 PCE的域存在很多种 组合, 本发明的技术方案不限于上述实施例。  Since there are many combinations of the domain in which the PCE is deployed and the domain in which the PCE is not deployed in the multi-domain routing interworking calculation, the technical solution of the present invention is not limited to the above embodiment.
图 9 为本发明实施例的多域路由计算装置的组成结构示意图, 如图 9 所示, 本发明实施例的多域路由计算装置包括确定单元 90和计算单元 91, 其中:  FIG. 9 is a schematic structural diagram of a multi-domain routing computing device according to an embodiment of the present invention. As shown in FIG. 9, the multi-domain routing computing device of the embodiment of the present invention includes a determining unit 90 and a computing unit 91, where:
确定单元 90, 配置为确定网络中部署有 PCE的域为两个及以上时, 触 发所述计算单元 90; The determining unit 90 is configured to determine that when the domain in which the PCE is deployed in the network is two or more, Sending the calculation unit 90;
计算单元 91,配置为在所述两个及以上部署有 PCE的域中的首域 PCE 和尾域 PCE之间采用 BRPC方式计算路由路径, 在所述两个及以上部署有 PCE的域之外的域采用域间路由协议 DDRP计算路由路径。  The calculating unit 91 is configured to calculate a routing path by using a BRPC method between the first domain PCE and the tail domain PCE in the domain where the two or more PCEs are deployed, where the two or more domains with the PCE are deployed. The domain uses the inter-domain routing protocol DDRP to calculate the routing path.
图 10为本发明实施例的多域路由计算装置的计算单元 91 的组成结构 示意图, 如图 10所示, 本发明实施例的计算单元 91包括接收子单元 910、 第一确定子单元 911、 第二确定子单元 912、 第一计算子单元 913和第二计 算子单元 914, 其中:  10 is a schematic structural diagram of a computing unit 91 of a multi-domain routing computing device according to an embodiment of the present invention. As shown in FIG. 10, the computing unit 91 of the embodiment of the present invention includes a receiving subunit 910, a first determining subunit 911, and a first The second determining subunit 912, the first calculating subunit 913 and the second calculating subunit 914, wherein:
接收子单元 910, 配置为接收路径计算的触发请求;  The receiving subunit 910 is configured to receive a trigger request for path calculation;
第一确定子单元 911, 配置为确定所述计算单元 91所属 PCE所在的域 是否为尾域,是时触发所述第一计算子单元 913; 为非尾域时触发所述第二 确定子单元 912;  The first determining subunit 911 is configured to determine whether the domain in which the PCE to which the computing unit 91 belongs is a tail domain, when the first computing subunit 913 is triggered, and the second determining subunit is triggered when it is a non-tailing domain. 912;
第二确定子单元 912, 配置为确定所述计算单元 91所属 PCE所在的域 与域序列中下游的下一部署 PCE的域之间是否存在未部署 PCE的域,不存 在时触发所述第一计算子单元 913 ; 存在时触发所述第二计算子单元;  The second determining sub-unit 912 is configured to determine whether there is a domain in which the PCE is not deployed between the domain where the PCE to which the computing unit 91 belongs and the domain of the next deployed PCE in the downstream of the domain sequence. a calculating subunit 913; triggering the second calculating subunit when present;
第一计算子单元 913, 配置为计算所述计算单元 91所属 PCE所在的域 的虚拟最短路径树 VSPT;  a first computing sub-unit 913, configured to calculate a virtual shortest path tree VSPT of a domain in which the PCE to which the computing unit 91 belongs;
第二计算子单元 914, 配置为将所述未部署 PCE的域的域内抽象链路、 未部署 PCE的域之间的域间链路作为扩展链路拓朴, 并与所述计算单元 91 所属 PCE所在的域的链路拓朴合并, 计算合并后链路拓朴的 VSPT。  The second computing sub-unit 914 is configured to use an intra-domain abstract link of the domain in which the PCE is not deployed, and an inter-domain link between domains in which the PCE is not deployed as an extended link topology, and belong to the computing unit 91. The link topology of the domain where the PCE is located is merged, and the VSPT of the merged link topology is calculated.
在图 10所示的计算单元 91的基础上, 本实施例的计算单元 91还包括 标识子单元(图 10未示出), 配置为在所述第二计算子单元 914计算合并 后链路拓朴的 VSPT之后,将通过扩展链路拓朴计算的 VSPT对应路由路径、 通过所述计算单元 91所属 PCE所在的域计算的 VSPT对应路由路径标识为 不同类型的路由路径。 在图 10所示的计算单元 91的基础上, 计算单元 91还包括第三确定子 单元(图 10未示出)和发送子单元(图 10未示出), 其中: On the basis of the calculation unit 91 shown in FIG. 10, the calculation unit 91 of the present embodiment further includes an identification subunit (not shown in FIG. 10) configured to calculate the merged link extension in the second calculation subunit 914. After the VSPT, the VSPT corresponding routing path calculated by the extended link topology and the VSPT corresponding routing path calculated by the domain in which the computing unit 91 belongs are identified as different types of routing paths. On the basis of the calculation unit 91 shown in FIG. 10, the calculation unit 91 further includes a third determination subunit (not shown in FIG. 10) and a transmission subunit (not shown in FIG. 10), wherein:
第三确定子单元, 配置为在计算出 VSPT之后, 确定所述 PCE所在的 域为所述两个及以上部署有 PCE的域中的非首域时,触发所述发送子单元; 发送子单元, 配置为将所计算出的 VSPT发送给域序列中上游的下一 部署有 PCE的域的 PCE。  a third determining subunit, configured to: after the VSPT is calculated, determine that the domain where the PCE is located is a non-first domain in the domain in which the two or more PCEs are deployed, triggering the sending subunit; And configured to send the calculated VSPT to the PCE of the next deployed PCE domain upstream of the domain sequence.
上述接收子单元 910还配置为, 接收路径计算请求消息; 或者, 接收 VSPT。  The receiving subunit 910 is further configured to receive a path calculation request message; or, receive the VSPT.
在图 9所示的多域路由计算装置的基础上, 本实施例的多域路由计算 装置还包括发送单元(图 9中未示出)和路由单元(图 9中未示出), 其中: 发送单元, 配置为从源节点向目的节点发送信令;  Based on the multi-domain routing computing device shown in FIG. 9, the multi-domain routing computing device of this embodiment further includes a transmitting unit (not shown in FIG. 9) and a routing unit (not shown in FIG. 9), where: a sending unit, configured to send signaling from the source node to the destination node;
路由单元, 配置为在所述信令路由至 VSPT对应路由路径时, 按所述 VSPT对应路由路径路由所述信令;在所述信令路由至通过扩展链路拓朴计 算的 VSPT对应路由路径时, 进一步计算未部署 PCE的域的松散跳路径对 应的域内严格跳路径, 并按计算的严格跳路径路由所述信令。  a routing unit, configured to: when the signaling is routed to a VSPT corresponding routing path, routing the signaling according to the VSPT corresponding routing path; and routing the signaling to a VSPT corresponding routing path calculated by using the extended link topology The intra-domain strict hop path corresponding to the loose hop path of the domain in which the PCE is not deployed is further calculated, and the signaling is routed according to the calculated strict hop path.
本领域技术人员应当理解, 图 9 中所示的多域路由计算装置中的各处 理单元、 处理子单元的实现功能可参照前述多域路由计算方法的相关描述 而理解。 本领域技术人员应当理解, 图 9所示的多域路由计算装置中各处 理单元、 处理子单元的功能可通过运行于处理器上的程序而实现, 也可通 过具体的逻辑电路而实现。  Those skilled in the art should understand that the implementation functions of the various units and processing subunits in the multi-domain routing computing device shown in FIG. 9 can be understood by referring to the related description of the foregoing multi-domain routing calculation method. It should be understood by those skilled in the art that the functions of the various units and processing subunits in the multi-domain routing computing device shown in FIG. 9 can be implemented by a program running on a processor, or can be implemented by a specific logic circuit.
图 11 为本发明实施例的路径计算单元的组成结构示意图, 如图 11所 示,本发明实施例的路径计算单元包括接收单元 1110、第一确定单元 1111、 第二确定单元 1112、 第一计算单元 1113和第二计算单元 1114, 其中:  FIG. 11 is a schematic structural diagram of a path calculation unit according to an embodiment of the present invention. As shown in FIG. 11, a path calculation unit according to an embodiment of the present invention includes a receiving unit 1110, a first determining unit 1111, a second determining unit 1112, and a first calculation. Unit 1113 and second computing unit 1114, wherein:
接收单元 1110, 配置为接收路径计算的触发请求;  The receiving unit 1110 is configured to receive a trigger request for path calculation;
第一确定单元 1111,配置为确定该路径计算单元所在的域是否为尾域, 是时触发所述第一计算单元 1113 ;为非尾域时触发所述第二确定单元 1112; 第二确定单元 1112, 配置为确定该路径计算单元所在的域与域序列中 下游的下一部署 PCE的域之间是否存在未部署 PCE的域,不存在时触发所 述第一计算单元 1113 ; 存在时触发所述第二计算单元; The first determining unit 1111 is configured to determine whether the domain where the path calculation unit is located is a tail domain, The first computing unit 1113 is triggered when the first computing unit 1113 is triggered; the second determining unit 1112 is triggered when it is a non-tailing domain; the second determining unit 1112 is configured to determine the next deployment of the domain and the downstream of the domain sequence in which the path computing unit is located. Whether there is a domain in which the PCE is not deployed between the domains of the PCE, the first computing unit 1113 is triggered when not present; and the second computing unit is triggered when it exists;
第一计算单元 1113, 配置为计算该路径计算单元所在的域的虚拟最短 路径树 VSPT;  The first calculating unit 1113 is configured to calculate a virtual shortest path tree VSPT of the domain in which the path calculating unit is located;
第二计算单元 1114, 配置为将所述未部署 PCE的域的域内抽象链路、 未部署 PCE的域之间的域间链路作为扩展链路拓朴, 并与该路径计算单元 所在的域的链路拓朴合并, 计算合并后链路拓朴的 VSPT。  The second computing unit 1114 is configured to use an intra-domain abstract link of the domain in which the PCE is not deployed, and an inter-domain link between domains in which the PCE is not deployed as an extended link topology, and the domain in which the path calculation unit is located The link topology is merged to calculate the VSPT of the merged link topology.
在图 11所示的路径计算单元的基础上, 本实施例的路径计算单元还包 括标识单元(图 11未示出), 配置为在所述第二计算单元 1114计算合并后 链路拓朴的 VSPT之后, 将通过扩展链路拓朴计算的 VSPT对应路由路径、 通过所述路径计算单元所属 PCE所在的域计算的 VSPT对应路由路径标识 为不同类型的路由路径。  On the basis of the path calculation unit shown in FIG. 11, the path calculation unit of this embodiment further includes an identification unit (not shown in FIG. 11) configured to calculate the merged link topology in the second calculation unit 1114. After the VSPT, the VSPT corresponding routing path calculated by the extended link topology and the VSPT corresponding routing path calculated by the domain in which the path calculating unit belongs are identified as different types of routing paths.
在图 11所示的路径计算单元的基础上, 本实施例的路径计算单元还包 括第三确定单元(图 11未示出 )和发送单元(图 11未示出), 其中:  On the basis of the path calculation unit shown in FIG. 11, the path calculation unit of this embodiment further includes a third determination unit (not shown in FIG. 11) and a transmission unit (not shown in FIG. 11), wherein:
第三确定单元, 配置为在计算出 VSPT之后, 确定所述 PCE所在的域 为所述两个及以上部署有 PCE的域中的非首域时, 触发所述发送单元; 发送单元, 配置为将所计算出的 VSPT发送给域序列中上游的下一部 署有 PCE的域的 PCE。  a third determining unit, configured to: after the VSPT is calculated, determine that the domain where the PCE is located is a non-first domain in the domain where the two or more PCEs are deployed, triggering the sending unit; The calculated VSPT is sent to the PCE of the next PCE-provisioned domain upstream of the domain sequence.
上述接收单元 1110 还配置为, 接收路径计算请求消息; 或者, 接收 VSPT。  The receiving unit 1110 is further configured to receive a path calculation request message; or, receive the VSPT.
本领域技术人员应当理解, 图 11中所示的路径计算单元中的各处理单 元的实现功能可参照前述多域路由计算方法的相关描述而理解。 本领域技 术人员应当理解, 图 11所示的路径计算单元中各处理单元的功能可通过运 行于处理器上的程序而实现, 也可通过具体的逻辑电路而实现。 Those skilled in the art should understand that the implementation functions of the processing units in the path calculation unit shown in FIG. 11 can be understood by referring to the related description of the foregoing multi-domain route calculation method. Those skilled in the art should understand that the functions of each processing unit in the path calculation unit shown in FIG. 11 can be transported. It is implemented by a program running on a processor, and can also be implemented by a specific logic circuit.
本发明还记载了一种路由网络, 包括有一个以上的路由域, 所述路由 域中设置有上述的路径计算单元。  The invention also describes a routing network comprising more than one routing domain, wherein the routing domain is provided with the path computation unit described above.
显然, 本领域的技术人员应该明白, 上述的本发明的各处理单元或各 步骤可以用通用的计算装置来实现, 其可以集中在单个的计算装置上, 或 者分布在多个计算装置所组成的网络上, 可选地, 其可以用计算装置可执 行的程序代码来实现, 从而, 可以将它们存储在存储装置中由计算装置来 执行, 或者将它们分别制作成各个集成电路模块, 或者将它们中的多个模 块或步骤制作成单个集成电路模块来实现。 这样, 本发明不限制于任何特 定的硬件和软件结合。  Obviously, those skilled in the art should understand that the above various processing units or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed among multiple computing devices. Alternatively, the network may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device, or they may be separately fabricated into individual integrated circuit modules, or they may be Multiple modules or steps in the fabrication are implemented as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software.
以上所述, 仅为本发明的较佳实施例而已, 并非用于限定本发明的保 护范围。  The above is only the preferred embodiment of the present invention and is not intended to limit the scope of the present invention.
工业实用性  Industrial applicability
本发明的技术方案,针对网络中已部署 PCE的域和未部署 PCE的域的 混合组网情况, 将未部署 PCE的域的域拓朴作为原 BRPC算法计算过程中 域间链路的扩展拓朴, 并在每个 PCE的 BRPC计算时使用该拓朴生成本域 的虚拟最短路径树, 从而解决了由于未部署 PCE的域的存在造成无法实施 BRPC算法的问题, 改善了路径的最优性。  In the technical solution of the present invention, the domain topology of the domain in which the PCE is not deployed is used as the extension of the inter-domain link in the calculation process of the original BRPC algorithm for the hybrid networking of the domain where the PCE is deployed and the domain where the PCE is not deployed. Park, and use the topology to generate the virtual shortest path tree of the domain in the calculation of the BRPC of each PCE, thereby solving the problem that the BRPC algorithm cannot be implemented due to the existence of the domain without deploying the PCE, and improving the optimality of the path. .

Claims

权利要求书 claims
1、 一种多域路由计算方法, 包括: 1. A multi-domain routing calculation method, including:
确定网络中部署有路径计算单元 PCE的域为两个及以上时, 在所述两 个及以上部署有 PCE的域中的首域 PCE和尾域 PCE之间采用扩展的反向 递归路径计算 BRPC方式计算路由路径, 在所述两个及以上部署有 PCE的 域之外的域采用 RC计算路由路径。 When it is determined that there are two or more domains in the network where the path calculation unit PCE is deployed, an extended reverse recursive path is used to calculate the BRPC between the first domain PCE and the tail domain PCE in the two or more domains where the PCE is deployed. The routing path is calculated by using RC in domains other than the domains where the two or more PCEs are deployed.
2、 根据权利要求 1 所述的方法, 其中, 在所述两个以上部署有 PCE 的域中的首域 PCE和尾域 PCE之间采用扩展的 BRPC方式计算路由路径, 包括: 2. The method according to claim 1, wherein the extended BRPC method is used to calculate the routing path between the first domain PCE and the tail domain PCE in the two or more domains where PCE is deployed, including:
PCE接收到路径计算的触发请求后, 确定所述 PCE所在的域是否为尾 域, 为尾域时计算本域的虚拟最短路径树 VSPT, 为非尾域时进一步确定所 述 PCE所在的域与域序列中下游的下一部署 PCE的域之间是否存在未部署 PCE的域, 不存在时计算本域的 VSPT, 存在时将所述未部署 PCE的域的 域内抽象链路、 未部署 PCE的域之间的域间链路作为扩展链路拓朴, 并与 所述 PCE所在的域的链路拓朴合并, 计算合并链路拓朴后的 VSPT。 After the PCE receives the trigger request for path calculation, it determines whether the domain where the PCE is located is a tail domain. If it is a tail domain, it calculates the virtual shortest path tree VSPT of the local domain. If it is a non-tail domain, it further determines whether the domain where the PCE is located is the same as the tail domain. Whether there is a domain without PCE deployed between the next downstream domain in the domain sequence in which PCE is deployed. If it does not exist, calculate the VSPT of this domain. If it exists, the intra-domain abstract link of the domain without PCE deployed, the intra-domain abstract link of the domain where PCE is not deployed, and the domain where PCE is not deployed. The inter-domain link between domains is used as the extended link topology and merged with the link topology of the domain where the PCE is located, and the VSPT after the merged link topology is calculated.
3、 根据权利要求 2所述的方法, 其中, 计算合并链路拓朴后的 VSPT 之后, 所述方法还包括: 3. The method according to claim 2, wherein after calculating the VSPT after the merged link topology, the method further includes:
将通过扩展链路拓朴计算的 VSPT对应路由路径、 通过 PCE所在的域 计算的 VSPT对应路由路径标识为不同类型的路由路径。 The routing path corresponding to the VSPT calculated through the extended link topology and the routing path corresponding to the VSPT calculated through the domain where the PCE is located are identified as different types of routing paths.
4、 根据权利要求 2所述的方法, 其中, 所述方法还包括: 4. The method according to claim 2, wherein the method further includes:
计算出 VSPT之后,确定所述 PCE所在的域为所述两个以上部署有 PCE 的域中的非首域时, 将所计算出的 VSPT发送给域序列中上游的下一部署 有 PCE的域的 PCE。 After calculating the VSPT, when it is determined that the domain where the PCE is located is a non-first domain among the two or more domains where the PCE is deployed, the calculated VSPT is sent to the next upstream domain in the domain sequence where the PCE is deployed. PCE.
5、根据权利要求 4所述的方法, 其中, 所述 PCE接收到路径计算的触 发请求, 包括: 所述 PCE接收到路径计算请求消息; 5. The method according to claim 4, wherein the PCE receives a trigger request for path calculation, including: The PCE receives the path calculation request message;
或者, 所述 PCE接收到 VSPT。 Or, the PCE receives the VSPT.
6、 根据权利要求 3 所述的方法, 其中, 所述两个及以上部署有 PCE 后, 所述方法还包括: 6. The method according to claim 3, wherein after the two or more PCEs are deployed, the method further includes:
从源节点向目的节点发送信令; Send signaling from the source node to the destination node;
所述信令路由至通过 PCE所在的域计算的 VSPT对应路由路径时, 按 所述 VSPT对应路由路径路由所述信令; When the signaling is routed to the VSPT corresponding routing path calculated through the domain where the PCE is located, the signaling is routed according to the VSPT corresponding routing path;
所述信令路由至通过扩展链路拓朴计算的 VSPT对应路由路径时, 进 一步计算未部署 PCE的域的松散跳路径对应的域内严格跳路径, 并按计算 出的严格跳路径路由所述信令。 When the signaling is routed to the routing path corresponding to the VSPT calculated through the extended link topology, the intra-domain strict hop path corresponding to the loose hop path of the domain where PCE is not deployed is further calculated, and the signaling is routed according to the calculated strict hop path. make.
7、 一种多域路由计算装置, 包括确定单元和计算单元, 其中: 确定单元, 配置为确定网络中部署有路径计算单元 PCE的域为两个及 以上时, 触发所述计算单元; 7. A multi-domain route calculation device, including a determination unit and a calculation unit, wherein: the determination unit is configured to determine that the path calculation unit PCE is deployed in the network and trigger the calculation unit when there are two or more domains;
计算单元,配置为在所述两个及以上部署有 PCE的域中的首域 PCE和 尾域 PCE之间采用扩展的反向递归路径计算 BRPC方式计算路由路径, 在 所述两个及以上部署有 PCE的域之外的域采用 RC计算路由路径。 The computing unit is configured to use the extended reverse recursive path calculation BRPC method to calculate the routing path between the first domain PCE and the tail domain PCE in the two or more domains where PCEs are deployed. Domains outside the domain with PCE use RC to calculate routing paths.
8、根据权利要求 7所述的装置, 其中, 所述计算单元包括接收子单元、 第一确定子单元、 第二确定子单元、 第一计算子单元和第二计算子单元, 其中: 8. The device according to claim 7, wherein the calculation unit includes a receiving sub-unit, a first determining sub-unit, a second determining sub-unit, a first calculating sub-unit and a second calculating sub-unit, wherein:
接收子单元, 配置为接收路径计算的触发请求; The receiving subunit is configured to receive a trigger request for path calculation;
第一确定子单元, 配置为确定所述计算单元所属 PCE所在的域是否为 尾域, 是时触发所述第一计算子单元; 为非尾域时触发所述第二确定子单 元; The first determination subunit is configured to determine whether the domain where the PCE of the computing unit belongs is a tail domain, and trigger the first computing subunit when it is; when it is a non-tail domain, the second determination subunit is triggered;
第二确定子单元, 配置为确定所述计算单元所属 PCE所在的域与域序 列中下游的下一部署 PCE的域之间是否存在未部署 PCE的域,不存在时触 发所述第一计算子单元; 存在时触发所述第二计算子单元; The second determination subunit is configured to determine the domain and domain sequence of the PCE to which the computing unit belongs. Whether there is a domain in which PCE is not deployed between the next downstream domains in the column in which PCE is deployed. If it does not exist, the first computing subunit is triggered; if it exists, the second computing subunit is triggered;
第一计算子单元, 配置为计算所述计算单元所属 PCE所在的域的虚拟 最短路径树 VSPT; The first calculation subunit is configured to calculate the virtual shortest path tree VSPT of the domain where the PCE to which the calculation unit belongs is located;
第二计算子单元, 配置为将所述未部署 PCE的域的域内抽象链路、 未 部署 PCE的域之间的域间链路作为扩展链路拓朴, 并与所述计算单元所属 PCE所在的域的链路拓朴合并, 计算合并后链路拓朴的 VSPT。 The second computing subunit is configured to use the intra-domain abstract link of the domain where the PCE is not deployed and the inter-domain link between the domains where the PCE is not deployed as the extended link topology, and connect it to the location of the PCE to which the computing unit belongs. The link topologies of the domains are merged, and the VSPT of the merged link topology is calculated.
9、 根据权利要求 8所述的装置, 其中, 所述计算单元还包括标识子单 元, 配置为在所述第二计算子单元计算合并后链路拓朴的 VSPT之后, 将 通过扩展链路拓朴计算的 VSPT对应路由路径、通过所述计算单元所属 PCE 所在的域计算的 VSPT对应路由路径标识为不同类型的路由路径。 9. The apparatus according to claim 8, wherein the calculation unit further includes an identification subunit configured to, after the second calculation subunit calculates the VSPT of the merged link topology, the extended link topology. The routing path corresponding to the VSPT calculated by PC and the routing path corresponding to the VSPT calculated through the domain where the PCE to which the computing unit belongs is identified as different types of routing paths.
10、 根据权利要求 8所述的装置, 其中, 所述计算单元还包括第三确 定子单元和发送子单元, 其中: 10. The device according to claim 8, wherein the calculation unit further includes a third determining subunit and a sending subunit, wherein:
第三确定子单元, 配置为在计算出 VSPT之后, 确定所述 PCE所在的 域为所述两个以上部署有 PCE的域中的非首域时, 触发所述发送子单元; 发送子单元, 配置为将所计算出的 VSPT发送给域序列中上游的下一 部署有 PCE的域的 PCE。 The third determination subunit is configured to trigger the sending subunit when, after calculating the VSPT, it is determined that the domain where the PCE is located is a non-first domain among the two or more domains where the PCE is deployed; the sending subunit, The PCE is configured to send the calculated VSPT to the next upstream domain in the domain sequence in which the PCE is deployed.
11、 根据权利要求 10所述的装置, 其中, 所述接收子单元还配置为, 接收到路径计算请求消息; 或者, 接收到 VSPT。 11. The device according to claim 10, wherein the receiving subunit is further configured to receive a path calculation request message; or, receive a VSPT.
12、 根据权利要求 9所述的装置, 其中, 所述装置还包括发送单元和 路由单元, 其中: 12. The device according to claim 9, wherein the device further includes a sending unit and a routing unit, wherein:
发送单元, 配置为从源节点向目的节点发送信令; A sending unit configured to send signaling from the source node to the destination node;
路由单元, 配置为在所述信令路由至通过 PCE所在的域计算的 VSPT 对应路由路径时, 按所述 VSPT对应路由路径路由所述信令; 在所述信令 路由至通过扩展链路拓朴计算的 VSPT对应路由路径时,进一步采用 RC计 算未部署 PCE的域的松散跳路径对应的域内严格跳路径, 并按计算出的严 格跳路径路由所述信令。 The routing unit is configured to route the signaling according to the VSPT corresponding routing path when the signaling is routed to the VSPT corresponding routing path calculated through the domain where the PCE is located; when the signaling is routed to the extended link topology When the VSPT calculated by Piao corresponds to the routing path, RC calculation is further used. Calculate the intra-domain strict hop path corresponding to the loose hop path of the domain where PCE is not deployed, and route the signaling according to the calculated strict hop path.
13、 一种路径计算单元, 包括接收单元、 第一确定单元、 第二确定单 元、 第一计算单元和第二计算单元, 其中: 13. A path calculation unit, including a receiving unit, a first determination unit, a second determination unit, a first calculation unit and a second calculation unit, wherein:
接收单元, 配置为接收路径计算的触发请求; a receiving unit configured to receive a trigger request for path calculation;
第一确定单元, 配置为确定所述路径计算单元所在的域是否为尾域, 为尾域时触发所述第一计算单元; 为非尾域时触发所述第二确定单元; 第二确定单元, 配置为确定所述路径计算单元所在的域与域序列中下 游的下一部署 PCE的域之间是否存在未部署 PCE的域,不存在时触发所述 第一计算单元; 存在时触发所述第二计算单元; The first determination unit is configured to determine whether the domain where the path calculation unit is located is a tail domain, triggering the first calculation unit when it is a tail domain; triggering the second determination unit when it is a non-tail domain; the second determination unit , configured to determine whether there is a domain in which PCE is not deployed between the domain where the path calculation unit is located and the next downstream domain in the domain sequence in which PCE is deployed, and trigger the first calculation unit when it does not exist; trigger the first calculation unit when it does exist; second computing unit;
第一计算单元, 配置为计算所述路径计算单元所在的域的虚拟最短路 径树 VSPT; The first calculation unit is configured to calculate the virtual shortest path tree VSPT of the domain where the path calculation unit is located;
第二计算单元, 配置为将所述未部署 PCE的域的域内抽象链路、 未部 署 PCE的域之间的域间链路作为扩展链路拓朴, 并与所述路径计算单元所 在的域的链路拓朴合并, 计算合并后链路拓朴的 VSPT。 The second calculation unit is configured to use the intra-domain abstract link of the domain where PCE is not deployed and the inter-domain link between domains where PCE is not deployed as an extended link topology, and compare it with the domain where the path calculation unit is located. The link topologies are merged, and the VSPT of the merged link topology is calculated.
14、 根据权利要求 13所述的路径计算单元, 其中, 所述路径计算单元 还包括标识单元,配置为在所述第二计算单元计算合并后链路拓朴的 VSPT 之后, 将通过扩展链路拓朴计算的 VSPT对应路由路径、 通过所述路径计 算单元所在的域计算的 VSPT对应路由路径标识为不同类型的路由路径。 14. The path calculation unit according to claim 13, wherein the path calculation unit further includes an identification unit configured to, after the second calculation unit calculates the VSPT of the merged link topology, pass the extended link The routing path corresponding to the VSPT calculated by the topology and the routing path corresponding to the VSPT calculated through the domain where the path calculation unit is located are identified as different types of routing paths.
15、 根据权利要求 14所述的路径计算单元, 其中, 所述路径计算单元 还包括第三确定单元和发送单元, 其中: 15. The path calculation unit according to claim 14, wherein the path calculation unit further includes a third determination unit and a sending unit, wherein:
第三确定单元, 配置为在计算出 VSPT之后, 确定所述 PCE所在的域 为所述两个以上部署有 PCE的域中的非首域时, 触发所述发送单元; The third determination unit is configured to trigger the sending unit after calculating the VSPT and determining that the domain where the PCE is located is a non-first domain among the two or more domains where the PCE is deployed;
发送单元, 配置为将所计算出的 VSPT发送给域序列中上游的下一部 署有 PCE的域的 PCE。 The sending unit is configured to send the calculated VSPT to the PCE of the next upstream domain in the domain sequence in which the PCE is deployed.
16、 根据权利要求 15所述的路径计算单元, 其中, 所述接收单元还配 置为, 接收路径计算请求消息; 或者, 接收 VSPT。 16. The path calculation unit according to claim 15, wherein the receiving unit is further configured to receive a path calculation request message; or, receive a VSPT.
17、 一种路由网络, 包括有一个以上的路由域, 所述路由域中设置有 权利要求 13至 16任一项所述的路径计算单元。 17. A routing network including more than one routing domain, the routing domain being provided with the path calculation unit according to any one of claims 13 to 16.
PCT/CN2013/079628 2012-11-30 2013-07-18 Multi-domain route computation method and device, path computation element, and routing network WO2013167051A2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP13787267.7A EP2928125B1 (en) 2012-11-30 2013-07-18 Multi-domain route computation method and device, path computation element, and routing network
US14/648,835 US9712426B2 (en) 2012-11-30 2013-07-18 Multi-domain routing computation method and device, path computation element and routing network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210505161.7A CN103023774B (en) 2012-11-30 2012-11-30 Multi-domain routing computation method and apparatus, path computation unit and routing network
CN201210505161.7 2012-11-30

Publications (2)

Publication Number Publication Date
WO2013167051A2 true WO2013167051A2 (en) 2013-11-14
WO2013167051A3 WO2013167051A3 (en) 2014-01-03

Family

ID=47971919

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2013/079628 WO2013167051A2 (en) 2012-11-30 2013-07-18 Multi-domain route computation method and device, path computation element, and routing network

Country Status (4)

Country Link
US (1) US9712426B2 (en)
EP (1) EP2928125B1 (en)
CN (1) CN103023774B (en)
WO (1) WO2013167051A2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016180068A1 (en) * 2015-05-11 2016-11-17 中兴通讯股份有限公司 Multi-domain controller, single-domain controller, and software-defined optical network system and method

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103023774B (en) 2012-11-30 2015-07-22 中兴通讯股份有限公司 Multi-domain routing computation method and apparatus, path computation unit and routing network
WO2015176259A1 (en) 2014-05-21 2015-11-26 华为技术有限公司 Virtual shortest path tree establishment and processing method, and path computation element
CN106717084B (en) * 2014-09-15 2020-02-14 华为技术有限公司 Apparatus and method for overlapping rate partition
JP6443925B2 (en) * 2015-03-20 2018-12-26 日本電気株式会社 Control device, communication system, control method, and program
EP3139548B1 (en) * 2015-09-04 2018-04-11 Airbus Operations High assurance segregated gateway interconnecting different domains
CN106817306B (en) * 2015-11-27 2019-12-27 中国移动通信集团设计院有限公司 Method and device for determining target route
US10728098B2 (en) 2016-07-06 2020-07-28 Futurewei Technologies, Inc. Connections and accesses for hierarchical path computation element (PCE)
CN107959681B (en) * 2017-12-06 2019-04-30 中盈优创资讯科技有限公司 Access path determines method and device to IP network end to end
CN112702263B (en) * 2019-10-22 2023-12-19 华为技术有限公司 Method and device for forwarding message
US11252082B1 (en) 2020-11-13 2022-02-15 Juniper Networks, Inc. Filtering topologies for path computation in massively scaled networks
CN112491605B (en) * 2020-11-18 2023-02-17 中国联合网络通信集团有限公司 Route simulation method and device

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101296178A (en) 2007-04-29 2008-10-29 华为技术有限公司 Inter-domain flux engineering route computing method and route computing device

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7599349B2 (en) * 2004-01-29 2009-10-06 Cisco Technology, Inc. Computing inter-autonomous system MPLS traffic engineering LSP paths
US8131873B2 (en) 2004-11-05 2012-03-06 Cisco Technology, Inc. Technique for selecting a path computation element
CN100454841C (en) * 2006-06-02 2009-01-21 华为技术有限公司 Multi-domain routing computation method and system
CN101163105B (en) * 2007-11-26 2011-06-01 华为技术有限公司 Method of obtaining path information and path computing node
US20110044352A1 (en) * 2008-03-04 2011-02-24 France Telecom Technique for determining a point-to-multipoint tree linking a root node to a plurality of leaf nodes
WO2010096552A1 (en) * 2009-02-19 2010-08-26 Futurewei Technologies, Inc. System and method for point to multipoint inter-domain multiprotocol label switching traffic engineering path calculation
EP2409459A1 (en) * 2009-03-16 2012-01-25 Telefonaktiebolaget L M Ericsson (PUBL) Inter-domain advertisements in multi-domain networks
WO2011044925A1 (en) * 2009-10-12 2011-04-21 Nokia Siemens Networks Oy Method and device for processing data across several domains of a network
CN101714953A (en) * 2009-12-15 2010-05-26 中兴通讯股份有限公司 Method and device for obtaining traffic engineering label switched path (TE LSP)
US8681634B2 (en) * 2010-03-31 2014-03-25 Fujitsu Limited Systems and methods for determining protection paths in a multi-domain network
US8750127B2 (en) * 2010-03-31 2014-06-10 Fujitsu Limited Systems and methods for multi-domain routing
US8837292B2 (en) * 2010-09-21 2014-09-16 Telefonaktiebolaget L M Ericsson (Publ) Relayed CSPF computation for multiple areas and multiple autonomous systems
CN102469009B (en) * 2010-11-09 2015-06-03 中兴通讯股份有限公司 Processing method for stateful path computation element, and stateful path computation element
US9231851B2 (en) * 2011-01-31 2016-01-05 Futurewei Technologies, Inc. System and method for computing point-to-point label switched path crossing multiple domains
CN102238443B (en) * 2011-06-01 2013-11-20 电子科技大学 Method for establishing cross-domain path meeting wavelength-continuity constraints
US8854956B2 (en) * 2011-08-02 2014-10-07 Futurewei Technologies, Inc. System and method for finding segments of path for label switched path crossing multiple domains
WO2013023508A1 (en) * 2011-08-16 2013-02-21 Huawei Technologies Co., Ltd. Method of communicating in path computation element communication protocol and network apparatus
US20130070752A1 (en) * 2011-09-20 2013-03-21 Huawei Technologies Co., Ltd. System and method for computing inter-domain shortest constrained path in a computer network
US9071532B2 (en) * 2011-10-24 2015-06-30 Ciena Corporation Method for discovery and load balancing of path computation elements based on transport plane link metrics
CN103023774B (en) * 2012-11-30 2015-07-22 中兴通讯股份有限公司 Multi-domain routing computation method and apparatus, path computation unit and routing network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101296178A (en) 2007-04-29 2008-10-29 华为技术有限公司 Inter-domain flux engineering route computing method and route computing device

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016180068A1 (en) * 2015-05-11 2016-11-17 中兴通讯股份有限公司 Multi-domain controller, single-domain controller, and software-defined optical network system and method
US10805203B2 (en) 2015-05-11 2020-10-13 Zte Corporation Multi-domain controller, single-domain controller, software defined optical network system and method

Also Published As

Publication number Publication date
CN103023774B (en) 2015-07-22
EP2928125A2 (en) 2015-10-07
US20150341255A1 (en) 2015-11-26
CN103023774A (en) 2013-04-03
EP2928125A4 (en) 2015-12-09
EP2928125B1 (en) 2016-11-02
US9712426B2 (en) 2017-07-18
WO2013167051A3 (en) 2014-01-03

Similar Documents

Publication Publication Date Title
WO2013167051A2 (en) Multi-domain route computation method and device, path computation element, and routing network
ES2732864T3 (en) Procedure for obtaining segment routing information and procedure for establishing segment routing network
US9178798B2 (en) Fast reroute using loop free alternate next hops for multipoint label switched paths
US9088485B2 (en) System, method and apparatus for signaling and responding to ERO expansion failure in inter-domain TE LSP
JP2022078251A (en) Method and node for transmitting packet in network
KR102055714B1 (en) Mpls fast re-route using ldp (ldp-frr)
US8174967B2 (en) Method to reduce routing convergence at the edge
Raj et al. A survey of IP and multiprotocol label switching fast reroute schemes
US20070019646A1 (en) Method and apparatus for constructing a repair path for multicast data
KR20140015401A (en) Mpls fast re-route using ldp (ldp-frr)
WO2006007769A1 (en) Pseudo wire label reflector, edge apparatus, two-layer virtual private network, and the method to provide pseudo wire service
JP4971496B2 (en) Ethernet spanning tree provision
EP2342864A1 (en) Provider link state bridging (plsb) computation method
WO2007013935A2 (en) Method and apparatus for updating label-switched paths
WO2012097624A1 (en) Method for processing information about inter-domain links and path computation element
WO2008098452A1 (en) A method, system and network device for performing path computation between autonomous systems
WO2012058911A1 (en) Method and system for computing multi-domain bidirectional label switch path
US7801048B1 (en) Concurrent path computation using virtual shortest path tree
US10382323B1 (en) Flooding-based routing protocol having label switched path session information
US7702810B1 (en) Detecting a label-switched path outage using adjacency information
WO2012079421A1 (en) Method for processing inter-domain link state information and path computation element
WO2012024965A1 (en) Method and system for triggering re-optimization
JP6377738B2 (en) Method and system for processing RSVP-TE signaling
JP6017036B6 (en) System, method and apparatus for signaling and responding to ERO extension failure in inter-domain TE LSP
WO2014026584A1 (en) Interconnection method, system and equipment of trill network

Legal Events

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

Ref document number: 13787267

Country of ref document: EP

Kind code of ref document: A2

WWE Wipo information: entry into national phase

Ref document number: 14648835

Country of ref document: US

REEP Request for entry into the european phase

Ref document number: 2013787267

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2013787267

Country of ref document: EP