Method for announcing associated paths, path computation client and path computation element

Abstract

An embodiment of the present invention provides a method for notifying an associated path, a path calculation client, and a path calculation unit. The notification method includes: constructing a Path Computation Element Communication Protocol (PCEP) message according to an associated label switched path, where the PCEP message includes extended association identification information, and the extended association identification information is used to represent an association identification assigned to the associated label switched path, and the length of the extended association identification information is greater than 2 bytes; sending the PCEP message to the path calculation unit, so that the path calculation unit establishes or updates the association relationship information of the associated label switched path according to the extended association identification information. By carrying the extended association identification information with a length greater than 2 bytes in the PCEP message, the embodiment of the present invention solves the problem that the association identification exceeding the basic value cannot be transmitted between devices and controllers in practical applications.

Description

Technical Field

[0001] This invention relates to the field of network communication, and in particular to a method for announcing associated paths, a path calculation client, and a path calculation unit. Background Technology

[0002] The Path Computation Element (PCE) is a centralized path computation technology used in Multi-Protocol Label Switching-Traffic Engineering (MPLS-TE) and Automatically Switched Optical Network / Generalized Multiprotocol Label Switching (ASON / GMPLS) networks to implement constrained path computation for traffic engineering (TE). PCE technology can be applied to any TE network, providing path computation services and creating Label Switched Paths (LSPs).

[0003] In PCE mode, many application scenarios require associating a group of LSPs to achieve specific application purposes, such as primary / standby LSPs and bidirectional LSPs. To this end, RFC 8697 defines an Association Object, which uses a triplet data structure <Association Type, Association ID, Association Source> to identify the association relationship between LSPs.

[0004] The basic Association ID follows the format definition of Resource Reservation Protocol-Traffic Engineering (RSVP-TE) signaling and has a limited maximum value (hereinafter referred to as the basic value). However, with the introduction of Segment Routing-Traffic Engineering / Segment Routing over IPv6 dataplane-Traffic Engineering (SR-TE / SRv6-TE) schemes, SR tunnels do not need to perform RSVP-like signaling interactions. However, in scenarios where PCEP extends to support SR-TE / SR-TP / SRv6, the industry lacks a solution for how to carry association group relationships with association IDs exceeding the basic value through PCEP messages; that is, it is impossible to announce association paths with association IDs exceeding the basic value. Summary of the Invention

[0005] The following is an overview of the subject matter described in detail herein. This overview is not intended to limit the scope of the claims.

[0006] This invention provides a method for announcing associated paths, a path calculation client, and a path calculation unit, which can transmit associated IDs exceeding a basic value between the path calculation unit and the path calculation client.

[0007] In a first aspect, embodiments of the present invention provide a method for announcing associated paths, applied to a path calculation client, the method comprising:

[0008] The path calculation unit communication protocol PCEP message is constructed based on the associated label exchange path, wherein the PCEP message includes extended association identification information, the extended association identification information is used to characterize the association identification assigned to the associated label exchange path, and the length of the extended association identification information is greater than 2 bytes;

[0009] The PCEP message is sent to the path calculation unit, which then establishes or updates the association relationship information of the associated label exchange path based on the extended association identifier information.

[0010] Secondly, embodiments of the present invention also provide a method for announcing associated paths, applied to a path calculation unit, the method comprising:

[0011] The path calculation unit communication protocol PCEP message is constructed based on the associated label exchange path, wherein the PCEP message includes extended association identification information, the extended association identification information is used to characterize the association identification assigned to the associated label exchange path, and the length of the extended association identification information is greater than 2 bytes;

[0012] The PCEP message is sent to the path calculation client, which then establishes an association table for the associated label exchange path based on the extended association identifier information.

[0013] Thirdly, embodiments of the present invention also provide a path calculation client, the path calculation client comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that the processor executes the computer program to implement the notification method described above.

[0014] Fourthly, embodiments of the present invention also provide a path calculation unit, the path calculation unit comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that the processor executes the computer program to implement the notification method described above.

[0015] Fifthly, embodiments of the present invention also provide a computer-readable storage medium storing computer-executable instructions for performing the notification method described above.

[0016] This invention includes: constructing a Path Calculation Unit Communication Protocol (PCEP) message based on the associated tag exchange path, wherein the PCEP message includes extended association identifier information, which characterizes the association identifier assigned to the associated tag exchange path, and the extended association identifier information is longer than 2 bytes; sending the PCEP message to the path calculation unit or client, so that the path calculation unit or client establishes or updates the association relationship information of the associated tag exchange path based on the extended association identifier information. Therefore, this invention solves the problem in practical applications where devices and controllers cannot transmit association IDs exceeding the basic value by carrying extended association identifier information longer than 2 bytes in the PCEP message.

[0017] Other features and advantages of the invention will be set forth in the description which follows, and will be apparent in part from the description, or may be learned by practicing the invention. The objects and other advantages of the invention may be realized and obtained by means of the structures particularly pointed out in the description, claims, and drawings. Attached Figure Description

[0018] The accompanying drawings are provided to further understand the technical solutions of the present invention and constitute a part of the specification. They are used together with the embodiments of the present invention to explain the technical solutions of the present invention, and do not constitute a limitation on the technical solutions of the present invention.

[0019] Figure 1 This is an architecture diagram of a system that applies the association path notification method according to an embodiment of the present invention;

[0020] Figure 2 The format of the associated object field as defined in RFC 8697 is shown;

[0021] Figure 3 The format of the extended association identifier field according to an embodiment of the present invention is shown;

[0022] Figure 4 This is a flowchart of an association path notification method according to an embodiment of the present invention;

[0023] Figure 5 yes Figure 4 The detailed flowchart of step S1100;

[0024] Figure 6 yes Figure 5 The detailed flowchart of step S1130;

[0025] Figure 7 yes Figure 5 The detailed flowchart of step S1110;

[0026] Figure 8 This is a flowchart of an association path notification method according to another embodiment of the present invention;

[0027] Figure 9 This is a schematic diagram illustrating the notification method for associated paths according to an embodiment of the present invention;

[0028] Figure 10 This is a schematic diagram illustrating the notification method for associated paths according to another embodiment of the present invention;

[0029] Figure 11 This is a schematic diagram illustrating the notification method for associated paths according to another embodiment of the present invention;

[0030] Figure 12 This is a schematic diagram illustrating the notification method for associated paths according to another embodiment of the present invention;

[0031] Figure 13 This is a schematic diagram of a path calculation client according to an embodiment of the present invention; and

[0032] Figure 14 This is a schematic diagram of a path calculation unit according to an embodiment of the present invention. Detailed Implementation

[0033] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0034] It should be noted that although a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than that shown in the flowchart. The terms "first," "second," etc., in the specification, claims, and the aforementioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence.

[0035] This invention provides a method for announcing associated paths, a path calculation client, and a path calculation unit. In one embodiment, the method for announcing associated paths is applied to a path calculation client (PCC), and includes:

[0036] A PCEP message is constructed based on the associated LSP, wherein the PCEP message includes extended association ID information, which is used to identify the association ID assigned to the associated LSP, and the length of the extended association ID information is greater than 2 bytes; and

[0037] The PCEP message is sent to the path calculation unit PCE, which enables the PCE to establish or update the association relationship information of the associated LSP based on the extended association ID information.

[0038] In another embodiment, the method for announcing the associated path is applied to the PCE and includes:

[0039] A PCEP message is constructed based on the associated LSP, wherein the PCEP message includes extended association ID information, which is used to identify the association ID assigned to the associated LSP, and the length of the extended association ID information is greater than 2 bytes; and

[0040] The PCEP message is sent to the PCC, which then establishes an association table for the associated LSPs based on the extended association ID information.

[0041] This invention addresses the problem in practical applications where devices and controllers cannot transmit association IDs exceeding the basic value by carrying extended association ID information with a length greater than 2 bytes in the PCEP message.

[0042] The embodiments of the present invention will be further described below with reference to the accompanying drawings.

[0043] PCE technology can be applied to any TE network to provide path computation services. Nodes or network management systems in the network can send path computation request messages to the PCE, requesting the computation of paths that meet the constraints. According to RFC 5440, the PCE and the Path Computation Client (PCC) use the Path Computation Element Protocol (PCEP) as the communication protocol, which is used for the PCC to request the PCE to compute paths, and for the PCE to return the computation results to the PCC. Figure 1 This is an architecture diagram of a system for which the method of announcing associated paths according to an embodiment of the present invention can be applied. PCE10 is a path calculation unit, and nodes A20 and B30 are PCCs. Path calculation is completed between PCE10 and node A20 (i.e., PCC20) through the PCEP protocol, while the path establishment between node A20 and node B30 is completed by the router in the IP / MPLS network 40 through the SR signaling protocol.

[0044] PCEs can be stateful or stateless. Stateful PCEs not only store network topology and resource information but also the attributes of existing TE-LSPs in the network, including path information and priority information for each TE-LSP. Stateless PCEs do not store the attribute information of TE-LSPs in the network. Stateful PCEs can better calculate service optimization paths.

[0045] In stateful PCE mode, many application scenarios require associating a group of LSPs to achieve specific application objectives, such as associating primary and backup LSPs under a tunnel, associating forward and reverse LSPs in a bidirectional tunnel, and associating LSPs in adjacent domains of a cross-domain tunnel. To address this, RFC 8697 defines an AssociationObject, which identifies the association relationships between LSPs. An association group is typically uniquely identified by a triplet data structure: <Association Type, Association ID, Association Source>. All LSPs belonging to the same association group must have the same triplet key value. RFC 8697 also defines an Optional TLV, which can carry additional key values ​​for association groups in some scenarios. When an Optional TLV exists, it is used as part of the association group key value. This Optional TLV is variable-length, and its format and meaning are strongly correlated with its corresponding Association Type. However, the industry's basic standards do not define the format and meaning of Optional TLV, and supplementary definitions are needed for various Association Types and their corresponding scenarios.

[0046] like Figure 2 As shown, taking a basic IPv4 Association Object as an example, it includes a Reserved field, a Flags field, an AssociationType field, an AssociationID field, an IPv4 AssociationSource field, and an Optional TLVs field. The AssociationType field indicates the type of association group, the AssociationID field indicates the association group ID (this association ID will be referred to below as the basic association ID, or original association ID, to distinguish it from the extended association ID), and the IPv4 AssociationSource field indicates the source of the IPv4 association group. These constitute the association group triplet.

[0047] According to an embodiment of the present invention, the PCEP message carries extended association ID information. Specifically, an extended association ID data structure (Extended Association IDTLV) is defined in the associated object to carry the extended association ID information, thereby solving the problem of carrying association group IDs exceeding the basic value. The format of the extended association ID TLV is as follows: Figure 3As shown, fill in the OptionalTLV field of the associated object. The PCEP message carrying extended association identification information can be a PCEP update (PCUpd), a PCEP report (PCRpt), or a PCEP creation (PCInitiate) message.

[0048] like Figure 3 As shown, the extended association TLV includes a Type field, a Length field, and an Extended Association ID (LargerAssociationID) field. The Type field indicates the type of the extended association TLV, the Length field indicates the length of the extended association TLV, and the Extended Association ID field is the value of the extended association ID, i.e., the extended association ID information mentioned above.

[0049] The extended association ID has a fixed length and can contain values ​​exceeding the base value, with a length exceeding 2 bytes. In one embodiment, the extended association ID is a fixed length of 4 bytes, containing association IDs exceeding the base value. In this embodiment, the base association ID value can be a fixed value, such as 0 or 1. Thus, PCE and PCC can be configured to parse the extended association ID value in the associated object in such scenarios.

[0050] In some application scenarios, when the associated ID value of an LSP does not exceed a base value, to maintain backward compatibility, the associated ID can be carried within the base associated ID, without carrying the extended associated ID TLV. In this way, PCE and PCC can be configured to resolve only the value of the base associated ID in the associated object in such scenarios.

[0051] PCC can bind the association relationships of LSPs itself and then report the relationships to PCE, or PCE can assign the association relationships of LSPs and then announce them to PCC. In either case, the association relationships of LSPs are carried in the association object. When the association ID exceeds the basic value, the extended association ID TLV needs to be carried in the association object.

[0052] The extended association ID TLV according to embodiments of the present invention is based on the optional extended TLV of the associated object in RFC 8697. Currently, the optional TLV in RFC 8697 is variable-length and its specific meaning is not defined. Therefore, PCE or PCC cannot parse it or will not parse it at all. The extended association ID TLV according to embodiments of the present invention is fixed-length. PCC or PCE can parse the extended association ID TLV according to a predefined format, thereby realizing the reporting or distribution of association IDs exceeding the basic value.

[0053] Based on the extended associated IDTLV, the method for announcing associated paths according to an embodiment of the present invention is as follows: Figure 4 As shown, steps S1100-S1200 are applied to Figure 1 PCC20 in the system shown.

[0054] Step S1100: Construct a PCEP message based on the associated LSP. The PCEP message includes extended association ID information, which is used to characterize the association ID assigned to the associated LSP. The length of the extended association ID information is greater than 2 bytes.

[0055] In one embodiment, the extended association ID information is a fixed length of 4 bytes.

[0056] Step S1200: Send the PCEP message to PCE10, so that PCE10 can establish or update the association relationship information of the associated LSP based on the extended association ID information.

[0057] In one embodiment, the PCEP message includes an extended association ID field (LargerAssociationID), contained in the extended association ID TLV, with the following data structure: Figure 3 As shown.

[0058] like Figure 5 As shown, step S1100, which constructs a PCEP message based on the associated LSP, further includes steps S1110-S113.

[0059] Step S1110: Obtain the target association ID. For example, bind several LSPs together and assign a unique, identical association ID (association group ID) to these LSPs.

[0060] Step S1120: Fill the obtained target association ID into the extended association ID field to obtain the extended association ID information.

[0061] Step S1130: Construct a PCEP message based on the extended association ID information. For example, further construct an extended association ID TLV carrying the extended association ID information, and then fill this TLV into the corresponding field of the associated object. The PCEP message here can be one of PCRpt, PCUpd, and PCInitiate messages.

[0062] In this embodiment, the PCEP message also includes an original association ID field, such as... Figure 2 The basic association ID field shown is redefined in scenarios where an association ID value greater than the basic value is required, as described below.

[0063] like Figure 6As shown, step S1130, which constructs a PCEP message based on the extended association identifier information, further includes steps S1131-S1132:

[0064] S1131: Fill the original association ID field with a preset flag value, wherein the preset flag value is used to indicate that the extended association identification information is used as the association ID assigned to the associated LSP. That is, when the PCE10 receives and parses this message, the preset flag value is used to instruct the PCE10 to use the value of the extended association ID field as the association ID information of the LSP.

[0065] S1132: Obtain the PCEP message based on the extended association ID information and the original association ID field filled with the preset tag value.

[0066] like Figure 7 As shown, in one embodiment, step 1110, obtaining the target association ID, further includes steps S1111-S1112.

[0067] S1111: Create an associated LSP.

[0068] PCC can bind the association relationship of LSPs itself and report the association relationship of associated LSPs to PCE10.

[0069] S1112: Assign a target association ID to the associated LSP.

[0070] In some application scenarios, it is necessary to use an associated ID that is greater than the base value.

[0071] In another embodiment of the invention, the method for announcing associated paths is applied to Figure 1 PCE10 in the system shown includes steps S2100-S2200, as follows: Figure 8 As shown.

[0072] S2100: Construct a PCEP message based on the associated LSP. The PCEP message includes extended association ID information, which is used to identify the association ID assigned to the associated LSP. The length of the extended association ID information is greater than 2 bytes.

[0073] In one embodiment, the extended association ID information is a fixed length of 4 bytes.

[0074] S2200: Sends the PCEP message to PCC20, enabling PCC to establish an association table for associated LSPs based on the extended association ID information.

[0075] The notification method for associated paths applied to PCE10 is similar to that applied to PCC20, and the specific steps will not be repeated here.

[0076] The invention will be further illustrated below through certain specific application scenarios.

[0077] The association path announcement method according to embodiments of the present invention can be applied to scenarios that announce the association relationship between primary and backup LSPs, as shown in the scenario diagram. Figure 1 As shown.

[0078] This scenario uses PCE10 to actively initiate the creation of the LSP path, such as... Figure 9 As shown, PCE10 calculates the primary and backup LSP paths and distributes the primary and backup LSP associations to PCC20.

[0079] Specifically, PCE10 calculates the primary and backup LSP paths and assigns the same association ID to the primary and backup LSPs (the RFC8745 standard describes how to complete the association binding of primary and backup LSPs under the tunnel through the association group ID, which will not be repeated here). Since the LSP on PCC20 may be larger than the base value, an association ID with a value of 65536 is assigned to this primary and backup LSP.

[0080] In accordance with the association path announcement method described above, the association ID value 65536 will be carried in the Larger Association ID in the ExtendedAssociationID TLV, and PCE10 will send the PCEP message PCUpd carrying this association ID value to PCC20.

[0081] After receiving and parsing the PCRpt message, PCC20 establishes an LSP path and creates a primary / backup association table for the LSP.

[0082] The above scenarios can also be achieved by using PCC20 to create LSP paths and reporting the primary / standby LSP relationship. The scenario diagram remains the same. Figure 1 As shown.

[0083] like Figure 10 As shown, in this scenario, PCC20 creates a primary / standby LSP path and reports the primary / standby LSP association to PCE10. Specifically, PCC20 creates a primary / standby LSP path and assigns the same association ID to the primary and standby LSPs. Since the LSP on PCC20 may currently be larger than the base value, an association ID with a value of 65536 is assigned to this primary / standby LSP.

[0084] According to the association path announcement method described above, the association ID value 65536 will be carried in the Larger Association ID in the ExtendedAssociationID TLV, and the PCC will send the PCEP message PCRpt carrying this association ID value to the PCE10.

[0085] PCE10 receives and parses PCUpd messages carrying the primary / standby LSP association relationship, and then updates or creates the primary / standby LSP association relationship information.

[0086] The association path announcement method according to embodiments of the present invention can be applied to scenarios that announce the association relationship of bidirectional LSPs, and the scenario diagram is still as follows. Figure 1 As shown.

[0087] This scenario uses PCE10 to actively initiate the creation of the LSP path, such as... Figure 11 As shown, PCE10 creates a bidirectional LSP path and distributes the bidirectional LSP association to PCC20.

[0088] Specifically, PCE10 computes the path between node A20 (PCC20) and node B30, establishing two unidirectional LSPs: a forward LSP from node A20 to node B30, and a reverse LSP from node B30 to node A20. Then, the forward and reverse LSPs are associated into a bidirectional LSP through an Association Object. The draft document "DRAFT-IETF-PCE-ASSOCIATION-BIDIR" describes a scheme for achieving bidirectional LSP binding through association group IDs, which will not be elaborated upon here.

[0089] In this embodiment, PCE10 needs to assign the same association ID to the bidirectional LSPs. Since the LSPs on PCC20 may be larger than the base value, the association ID assigned to the bidirectional LSPs is 65536. This value 65536 will be carried in the Larger Association ID in the ExtendedAssociationID TLV, and PCE10 will send the PCEP message PCUpd carrying this association ID value to PCC20.

[0090] After receiving and parsing the PCUpd message, the PCC20 establishes a bidirectional LSP path and creates a bidirectional path association table.

[0091] The association path announcement method according to embodiments of the present invention can be applied to scenarios that announce the association relationship of bidirectional LSPs, and the scenario diagram is still as follows. Figure 1 As shown

[0092] This scenario can also be achieved by using PCC20 to create LSP paths and reporting bidirectional LSP relationships. For example... Figure 12As shown, PCC20 creates a bidirectional LSP path and reports the bidirectional LSP association to PCE10. Specifically, PCC20 creates and binds the forward and reverse LSP paths into a bidirectional LSP, and assigns the same association ID to this bidirectional LSP. Since the LSP on PCC20 may currently be larger than the base value, in this embodiment, the association ID assigned to the bidirectional LSP is 65536. This value 65536 will be carried in the Larger Association ID in the ExtendedAssociationID TLV, and PCC20 will send a PCEP message PCRpt carrying this association ID value to PCE10.

[0093] PCE10 receives and parses PCUpd messages carrying bidirectional LSP associations, and updates or establishes new bidirectional path association information.

[0094] Accordingly, embodiments of the present invention also provide a PCC100. For example... Figure 13 As shown, PCC100 includes: a memory 110, a processor 120, and a computer program stored in the memory 110 and executable on the processor, wherein the memory 110 and the processor 120 are connected via a bus 130. This PCC100 is also connected to an external network via a network interface (not shown). When the processor 120 executes the computer program, it implements any of the aforementioned methods for announcing associated paths, for example, executing... Figure 4 The steps S1100-S1200 shown are... Figure 5 Steps S1110-S1130 are shown. Figure 6 The steps S1131-S1132 shown, and Figure 7 The steps S1111-S1112 are shown.

[0095] Accordingly, embodiments of the present invention also provide a PCE. For example... Figure 14 As shown, PCE200 includes: memory 210, processor 220, and a computer program stored in the memory and executable on the processor, wherein memory 210 and processor 220 are connected via bus 230. This PCE is also connected to an external network via a network interface (not shown). When processor 220 executes the computer program, it implements any of the aforementioned methods for announcing associated paths, for example, executing... Figure 8 The steps S2100-S2200 are shown.

[0096] Accordingly, embodiments of the present invention also provide a computer-readable storage medium storing computer-executable instructions for executing any of the above-described association path notification methods, such as executing... Figure 4 The steps S1100-S1200 shown are... Figure 5Steps S1110-S1130 are shown. Figure 6 The steps S1131-S1132 shown are as follows: Figure 7 Steps S1111-S1112 and shown Figure 8 The steps S2100-S2200 are shown.

[0097] It will be understood by those skilled in the art that all or some of the steps and systems in the methods disclosed above can be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components can be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, which can include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, as is known to those skilled in the art, communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0098] The above is a detailed description of the preferred embodiments of the present invention. However, the present invention is not limited to the above embodiments. Those skilled in the art can make various equivalent modifications or substitutions without departing from the spirit of the present invention. All such equivalent modifications or substitutions are included within the scope defined by the claims of the present invention.

Claims

1. A method for announcing associated paths, applied to a path calculation client, the method comprising: The path calculation unit communication protocol PCEP message is constructed based on the associated label exchange path, wherein the PCEP message includes extended association identification information, the extended association identification information is used to characterize the association identification assigned to the associated label exchange path, and the length of the extended association identification information is greater than 2 bytes; The PCEP message is sent to the path calculation unit, which then establishes or updates the association relationship information of the associated label exchange path based on the extended association identifier information. The PCEP message also includes an original association identifier field, which is filled with a preset flag value. The preset flag value is used to indicate that the extended association identifier information is used as an association identifier assigned to the association label exchange path.

2. The notification method according to claim 1, characterized in that, The PCEP message is equipped with an extended association identifier field; The PCEP message for constructing the path calculation unit based on the associated label exchange path includes: Obtain the target association identifier; The target association identifier is filled into the extended association identifier field to obtain the extended association identifier information; The PCEP message is constructed based on the extended association identification information.

3. The notification method according to claim 2, characterized in that, The step of constructing a PCEP message based on the extended association identifier information includes: The PCEP message is obtained based on the extended association identifier information and the original association identifier field filled with the preset tag value.

4. The notification method according to claim 2, characterized in that, The target association identifier is obtained through the following steps: Create associated tag exchange paths; Assign the target association identifier to the associated label exchange path.

5. A method for announcing associated paths, applied to a path calculation unit, the method comprising: The path calculation unit communication protocol PCEP message is constructed based on the associated label exchange path, wherein the PCEP message includes extended association identification information, the extended association identification information is used to characterize the association identification assigned to the associated label exchange path, and the length of the extended association identification information is greater than 2 bytes; The PCEP message is sent to the path calculation client, which then establishes an association table for the associated label exchange path based on the extended association identifier information. The PCEP message also includes an original association identifier field, which is filled with a preset flag value. The preset flag value is used to indicate that the extended association identifier information is used as an association identifier assigned to the association label exchange path.

6. The notification method according to claim 5, characterized in that, The PCEP message is equipped with an extended association identifier field; The PCEP message for constructing the path calculation unit based on the associated label exchange path includes: Obtain the target association identifier; The target association identifier is filled into the extended association identifier field to obtain the extended association identifier information; The PCEP message is constructed based on the extended association identification information.

7. The notification method according to claim 6, characterized in that, The step of constructing a PCEP message based on the extended association identifier information includes: The PCEP message is obtained based on the extended association identifier information and the original association identifier field filled with the preset tag value.

8. The notification method according to claim 6, characterized in that, The target association identifier is obtained through the following steps: Create associated tag exchange paths; Assign the target association identifier to the associated label exchange path.

9. A path calculation client, comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that the processor, when executing the computer program, implements the notification method as described in any one of claims 1 to 4.

10. A path calculation unit, comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that the processor, when executing the computer program, implements the notification method as described in any one of claims 5 to 8.

11. A computer-readable storage medium storing computer-executable instructions for performing the notification method according to any one of claims 1 to 8.

Images