CN105681195B - Method and device for collecting LSP path affinity attribute - Google Patents
Method and device for collecting LSP path affinity attribute Download PDFInfo
- Publication number
- CN105681195B CN105681195B CN201410674639.8A CN201410674639A CN105681195B CN 105681195 B CN105681195 B CN 105681195B CN 201410674639 A CN201410674639 A CN 201410674639A CN 105681195 B CN105681195 B CN 105681195B
- Authority
- CN
- China
- Prior art keywords
- node
- lsp
- attributes
- attribute
- affinity
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method and a device for collecting LSP path affinity attributes, wherein the method comprises the following steps: acquiring a first affinity attribute of an upstream or downstream interface of a first node in an LSP path; setting the acquired first affinity attribute in a BIT extension BIT in an LSP _ REQUIRED _ ATTRIBUTES label switching path requirement attribute or an LSP _ ATTRIBUTES label switching path attribute; the first node sends a message carrying LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES to a second node which is one of the previous node and the next node in the LSP path, and the second node collects a first affinity attribute of an upstream interface or a downstream interface of the first node. By adopting the method for collecting the LSP path affinity attribute provided by the invention, the tunnel head and tail nodes can automatically acquire the LSP path affinity attribute, and for H-LSP (hierarchical LSP) and S-LSP (LSP splicing), the information can be used as a TE link information for carrying out route flooding.
Description
Technical Field
The present invention relates to the field of data network communications, and in particular, to a method and an apparatus for collecting LSP path affinity attributes.
Background
In an mpls (multiprotocol Label switching) network, a tunnel is established by using an RSVP-TE protocol, which may restrict links of which attributes need to be excluded and links of which attributes need to be included when the tunnel is established, so that the established lsp (Label Switched path) can meet the requirements of users.
In a standard protocol RFC3209, three fields in a SESSION _ ATTRIBUTE object are defined to restrict establishment of a tunnel path, as shown in fig. 1, information carried in an exception-any field indicates that all paths need to be excluded, information carried in an Include-any field indicates that only any one of the paths needs to be included, and information carried in an Include-all field indicates that all paths need to be included.
The constraint conditions of the tunnel carrying the SESSION _ ATTRIBUTE object with affinity ATTRIBUTE when selecting the path are shown in fig. 2: (x-y) {0, 1 }; inclusive-any ═ {5, 6 }; included-all is 4. R1-R3 ═ {1, 3}, none of conditions 1, 2, 3 are satisfied; R1-R4 ═ {0, 4}, conditions 1, 2 are not satisfied; R2-R3 ═ {0, 5}, and conditions 1 and 3 are not satisfied. R1-R2, R2-R4, and R4-R3 all satisfy the above constraints, so the path established is R1 → R2 → R4 → R3.
H-LSPs (Hierarchical LSPs) and S-LSPs (nested LSPs) are defined in RFC4206 and RFC6107, respectively. As both the H-LSP and the S-LSP are used as a TE link to participate in calculation, an LSP needs information of the affinity attribute of the whole path at a head node and a tail node.
The CCAMP (common Control and Measurement plane) working Group currently has a draft-ietf-ccamp-rsvp-te-SRLG-collect, which mainly describes the SRLG (Shared Risk Link Group) information used for collecting the whole LSP at the head and tail nodes. Currently, there is no method or protocol for describing how to collect the affinity attributes of the entire path of an LSP.
Disclosure of Invention
The invention provides a method and a device for collecting LSP (label switched path) affinity attributes, which can enable tunnel head and tail nodes to automatically acquire the affinity attributes of the whole LSP and solve the problem that a method and a protocol do not exist in the prior art to collect the affinity attributes of the whole LSP.
The invention provides a method for collecting LSP path affinity attribute, comprising the following steps:
acquiring a first affinity attribute of an upstream or downstream interface of a first node in an LSP path;
setting the acquired first affinity attribute in a BIT extension BIT in an LSP _ REQUIRED _ ATTRIBUTES label switching path requirement attribute or an LSP _ ATTRIBUTES label switching path attribute;
the first node sends a message carrying LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES to a second node which is one of the previous node and the next node in the LSP path, and the second node collects a first affinity attribute of an upstream interface or a downstream interface of the first node.
Wherein, if the first node is the last node of the second node, the method further comprises:
and when the second node does not support the affinity attribute collection function, if the message carries LSP _ REQUIRED _ ATTRIBUTES, sending a path error message to the first node through the second node.
If the first node is the previous node of the second node, correspondingly, the method further comprises:
and when the second node does not support the affinity attribute collection function, if the message carries LSP _ ATTRIBUTES, sending the message carrying the first affinity attribute of the first node to the next node of the second node through the second node.
Wherein, setting the obtained first affinity attribute in a BIT extension BIT in an LSP _ requested _ ATTRIBUTES ES label switched path requirement attribute or an LSP _ ATTRIBUTES label switched path attribute specifically includes:
expanding BIT BITs in LSP _ REQUERED _ ATTRIBUTES or LSP _ ATTRIBUTES;
and setting the acquired first affinity attribute in a path recording object, and setting the path recording object in the LSP _ REQUIRED _ ATTRIBUTES or the BIT extension BIT in the LSP _ ATTRIBUTES.
If the first node is the previous node of the second node, correspondingly, the method further comprises:
acquiring a second affinity attribute of a downstream interface of a second node;
setting the obtained second affinity attribute in the BIT extension BIT in the LSP _ REQUERED _ ATTRIBUTES or LSP _ ATTRIBUTES in the received message;
and sending a message carrying LSP _ REQUERED _ ATTRIBUTES or LSP _ ATTRIBUTES through the second node, and collecting a first affinity attribute of the downstream interface of the first node and a second affinity attribute of the downstream interface of the second node by the next node of the second node.
If the first node is the next node of the second node, correspondingly, the method further comprises:
acquiring a third affinity attribute of an upstream interface of a second node;
setting the obtained third affinity attribute in the LSP _ REQUERED _ ATTRIBUTES or the BIT extension BIT in the LSP _ ATTRIBUTES of the received message;
and sending a message carrying LSP _ REQUERED _ ATTRIBUTES or LSP _ ATTRIBUTES through the second node, and collecting a first affinity attribute of the upstream interface of the first node and a third affinity attribute of the upstream interface of the second node by the last node of the second node.
If the message is sent downstream along the data message transmission direction, the message is a PATH message;
if the message is sent reversely along the data message transmission direction, the message is an RESV message.
The embodiment of the present invention further provides a device for collecting LSP path affinity attributes, including:
a first obtaining module, configured to obtain a first affinity attribute of an upstream or downstream interface of a first node in an LSP path;
the first setting module is used for setting the acquired first affinity attribute in a BIT extension BIT in an LSP _ REQUIRED _ ATTRIBUTES label switching path requirement attribute or an LSP _ ATTRIBUTES label switching path attribute;
the first collecting module is used for sending a message carrying LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES to a second node which is one of the previous node and the next node in the LSP path through the first node, and the second node collects a first affinity attribute of an upstream interface or a downstream interface of the first node.
Wherein, if the first node is the last node of the second node, the apparatus further comprises:
and the first sending module is used for sending a path error message to the first node through the second node if the message carries LSP _ REQUIRED _ ATTRIBUTES when the second node does not support the affinity attribute collection function.
If the first node is the last node of the second node, correspondingly, the apparatus further includes:
and the second sending module is used for sending the message only carrying the first affinity attribute of the first node to the next node of the second node through the second node if the message carries LSP _ ATTRIBUTES when the second node does not support the affinity attribute collection function.
Wherein, first setting module specifically includes:
an extension unit for extending BIT BITs in LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES;
and the setting unit is used for setting the acquired first affinity attribute in the path recording object and setting the path recording object in the LSP _ REQUERED _ ATTRIBUTES or the BIT extension BIT in the LSP _ ATTRIBUTES.
If the first node is the previous node of the second node, correspondingly, the apparatus further includes:
the second acquisition module is used for acquiring a second affinity attribute of a downstream interface of the second node;
the second setting module is used for setting the acquired second affinity attribute in the LSP _ REQUIRED _ ATTRIBUTES or the BIT extension BIT in the LSP _ ATTRIBUTES in the received message;
and the second collecting module is used for sending a message carrying the LSP _ REQUERED _ ATTRIBUTES or the LSP _ ATTRIBUTES through the second node, and collecting the first affinity attribute of the downstream interface of the first node and the second affinity attribute of the downstream interface of the second node by the next node of the second node.
If the first node is the next node of the second node, correspondingly, the apparatus further includes:
a third obtaining module, configured to obtain a third affinity attribute of an upstream interface of a second node;
a third setting module, configured to set the obtained third affinity attribute in the LSP _ requested _ ATTRIBUTES or BIT extension BITs in the LSP _ ATTRIBUTES of the received packet;
a third collecting module, configured to send a packet carrying LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES through the second node, and collect, by a previous node of the second node, the first affinity attribute of the upstream interface of the first node and the third affinity attribute of the upstream interface of the second node.
The invention has the beneficial effects that: the acquired affinity attribute of the upstream or downstream interface of the node in the LSP path is set in the BIT extension BIT in LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES, a message carrying LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES is sent to the previous node or the next node, and the affinity attribute of the upstream or downstream interface of the node is collected by the previous node or the next node and is transmitted in such a way, so that the tunnel head and tail node can automatically acquire the affinity attribute on the LSP path.
Drawings
FIG. 1 shows an object format of SESSION _ ATTRIBUTE;
FIG. 2 is a schematic diagram illustrating a constraint computation path topology using affinity attributes;
FIG. 3 is a flowchart illustrating a first method step of collecting LSP path affinity attributes according to one embodiment of the present invention;
FIG. 4 is a diagram illustrating that a local policy of a node does not support affinity attribute collection according to an embodiment of the present invention;
FIG. 5 is a flowchart illustrating the steps of setting the affinity attribute in the BIT extension BIT in the method for collecting LSP path affinity attributes according to the embodiment of the present invention;
FIG. 6 is a flowchart illustrating a second method step of collecting LSP path affinity attributes according to an embodiment of the present invention;
FIG. 7 is a flowchart illustrating a third method step of collecting LSP path affinity attributes according to an embodiment of the present invention;
FIG. 8 is a schematic diagram of a unidirectional tunnel carrying affinity attributes according to an embodiment of the present invention;
FIG. 9 is a schematic diagram of a bidirectional tunnel carrying affinity attribute according to an embodiment of the present invention;
FIG. 10 is a block diagram of an apparatus for collecting LSP path affinity attributes according to an embodiment of the present invention;
FIG. 11 is a block diagram of a first setup module of an apparatus for collecting LSP path affinity attributes according to an embodiment of the present invention;
FIG. 12 is a block diagram of an apparatus for collecting LSP path affinity attributes according to an embodiment of the present invention;
fig. 13 is a block diagram of a third apparatus for collecting LSP path affinity attributes according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in detail with reference to the accompanying drawings and specific embodiments.
As shown in fig. 3, an embodiment of the present invention provides a method for collecting LSP path affinity attributes, including:
step S100, acquiring a first affinity attribute of an upstream or downstream interface of a first node in an LSP path;
step S200, setting the acquired first affinity attribute in a BIT extension BIT in an LSP _ REQUIRED _ ATTRIBUTES label switching path requirement attribute or an LSP _ ATTRIBUTES label switching path attribute;
step S300, sending a message carrying LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES to a second node which is one of the previous and next second nodes in the LSP path through the first node, and collecting a first affinity attribute of an upstream or downstream interface of the first node by the second node.
It should be noted that the affinity attribute may also be referred to as link coloring. Specifically, the acquired affinity attribute of the upstream or downstream interface of the node in the LSP path is set in the BIT extension BIT in LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES, and the node sends a packet carrying LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES to the previous node or the next node, and the previous node or the next node collects the affinity attribute of the upstream or downstream interface of the node, and in this way, transmission is performed, so that the tunnel head and tail node can automatically acquire the affinity attribute of the LSP path.
In the above embodiment of the present invention, if the first node is a previous node of the second node, the method further includes:
when the second node does not support the affinity attribute collection function, if the message carries LSP _ REQUIRED _ ATTRIBUTES, a path error message is sent to the previous node of the nodes through the second node;
in the above embodiment of the present invention, if the first node is a previous node of the second node, correspondingly, the method further includes:
and when the second node does not support the affinity attribute collection function, if the message carries LSP _ ATTRIBUTES, sending the message carrying the first affinity attribute of the first node to the next node of the second node through the second node.
Specifically, as shown in fig. 4, when the transmission PATH is R1-R2-R3-R4 and the local policy of the node R2 in the topology does not support the affinity attribute collection function, if the PATH message sent by R1 to R2 carries the LSP _ request D _ ATTRIBUTES identifier, because R2 does not support locally, R2 replies a PATH-ERR message of R1, error code 2 (policy failure), error value 109 (requiring IANA definition, suggestion 109, indicating rejection of affinity attribute collection); if the carried LSP _ ATTRIBUTES identifier is contained, the PATH message sent to the R3 by the R2 does not carry the local affinity ATTRIBUTE, and meanwhile, the LSP _ ATTRIBUTE identifier needs to be sent to the R3 without being changed.
Similarly, if the RESV message sent by R3 reaches R2, which carries the LSP _ REQUESTED _ ATTRIBUTES identifier, R2 replies to R3 a RESV-ERR message, error code 2 (policy failure), error value 109 (requiring IANA definition, suggesting 109, indicating rejection of affinity attribute collection), because R2 does not support locally; if the carried LSP _ ATTRIBUTES identifier is contained, the RESV message sent by the R2 to the R1 does not contain the local affinity ATTRIBUTE, and meanwhile, the LSP _ ATTRIBUTE identifier needs to be sent to the R1 without being changed.
In the above embodiment of the present invention, as shown in fig. 5, the setting the obtained first affinity attribute in a BIT extension BIT in the LSP _ requested _ ATTRIBUTES label switched path requirement attribute or the LSP _ ATTRIBUTES label switched path attribute specifically includes:
step S201, expanding the BIT BIT in LSP _ REQUERED _ ATTRIBUTES or LSP _ ATTRIBUTES;
step S202, the acquired first affinity attribute is set in a path recording object, and the path recording object is set in the BIT extension BIT in the LSP _ REQUERED _ ATTRIBUTES or the LSP _ ATTRIBUTES.
Specifically, the BIT of LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES has 32 BITs in total, and what is actually used is the 11 th BIT, and the path recording object carrying the affinity attribute is set in the 12 th BIT of the BIT in the extended LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES, thereby indicating the affinity attribute.
In the above embodiment of the present invention, if as shown in fig. 6, if the first node is a previous node of the second node, the method further includes:
step S400, acquiring a second affinity attribute of a downstream interface of a second node;
step S500, setting the obtained second affinity attribute in the BIT extension BIT in the LSP _ REQ UIRED _ ATTRIBU ES or LSP _ ATTRIBUTES in the received message;
step S600, a message carrying LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES is sent through the second node, and the next node of the second node collects a first affinity attribute of the downstream interface of the first node and a second affinity attribute of the downstream interface of the second node.
In the above embodiment of the present invention, as shown in fig. 7, if the first node is a node next to the second node, correspondingly, the method further includes:
step S700, acquiring a third affinity attribute of an upstream interface of a second node;
step S800, setting the acquired third affinity attribute in the LSP _ REQ UIRED _ ATTRIBUTES or BIT extension BIT in the LSP _ ATTRIBUTES of the received message;
step S900, a message carrying LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES is sent through the second node, and the previous node of the second node collects the first affinity attribute of the upstream interface of the first node and the third affinity attribute of the upstream interface of the second node.
Specifically, the process of obtaining the affinity attribute is illustrated by two examples, as shown in fig. 8, when the unidirectional tunnel1 is transmitted from R1 → R4, the path is R1-R2-R3-R4. The method is convenient for automatically collecting the affinity attribute of the whole LSP at head and tail nodes, and the PATH message carries LSP _ REQUESTED _ ATTRIBUTES or BIT extension BIT in LSP _ ATTRIBUTES. The R1, R2, R3, R4 local policies all support the affinity attribute collection function.
In the PATH message, the PATH message sent by R1 will carry a local affinity attribute affinity (a), where affinity (a) is a member of the RRO PATH record object, and similarly, the PATH message sent by R2 will carry a local affinity attribute affinity (c), where the affinity attribute contained in the sent PATH message is: affinity (c) and affinity (a). The PATH packet that finally reaches the tail node R4 has the affinity attributes: affinity (e), affinity (c) and affinity (a).
Similarly, in the RESV message sent upstream by the tail node, the affinity attribute received at the head node R1 is: affinity (b) affinity (d) and affinity (f).
As shown in FIG. 9, when the bidirectional Tunnel1 is transmitted from R1 → R4, the path is R1-R2-R3-R4. The method is convenient for automatically collecting the affinity attribute of the whole LSP at head and tail nodes, and the PATH message carries LSP _ REQUESTED _ ATTRIBUTES or BIT extension BIT in the LSP _ ATTRIBUTES. The R1, R2, R3, R4 local policies all support the affinity attribute collection function.
In the PATH message, the PATH message sent by R1 will carry a local affinity attribute affinity (a), where affinity (a) is a member of the RRO PATH record object, and similarly, the PATH message sent by R2 will carry local affinity attributes affinity (b) and affinity (c), where the affinity attribute of the sent PATH message is: affinity (b), affinity (c) and affinity (a). The PATH packet that finally reaches the tail node R4 has the affinity attributes: affinity (d), affinity (e), affinity (b), affinity (c) and affinity (a).
Similarly, in the RESV message sent upstream by the tail node, the affinity attribute received at the head node R1 is: affinity (b), affinity (c), affinity (d), affinity (e), and affinity (f).
By the scheme, the affinity attributes of the whole LSP of the bidirectional tunnel can be automatically collected from the head node and the tail node.
In the above embodiment of the present invention, the message specifically includes:
if the message is sent downstream along the data message transmission direction, the message is a PATH message;
if the message is sent reversely along the data message transmission direction, the message is an RESV message.
In order to better achieve the above object, an embodiment of the present invention further provides an apparatus for collecting LSP path affinity attributes, as shown in fig. 10, including:
a first obtaining module 10, configured to obtain a first affinity attribute of an upstream or downstream interface of a first node in an LSP path;
a first setting module 20, configured to set the obtained first affinity attribute in a BIT extension BIT in an LSP _ REQUIRED _ ATTRIBUTES label switching path requirement attribute or an LSP _ ATTRIBUTES label switching path attribute;
the first collecting module 30 is configured to send a packet carrying LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES to a second node that is one of the previous and next second nodes in the LSP path through the first node, and collect, by the second node, a first affinity attribute of an upstream or downstream interface of the first node.
In the above embodiment of the present invention, if the first node is a previous node of the second node, the apparatus further includes:
the first sending module 31 is configured to send a path error message to the first node through the second node if the packet carries LSP _ requested _ ATTRIBUTES when the second node does not support the affinity attribute collection function.
In the above embodiment of the present invention, if the first node is a previous node of the second node, correspondingly, the apparatus further includes:
the second sending module 32 is configured to send, when the second node does not support the affinity attribute collection function, a packet that only carries the first affinity attribute of the first node to a next node of the second node through the second node if the packet carries LSP _ ATTRIBUTES.
In the above embodiment of the present invention, as shown in fig. 11, the first setting module specifically includes:
an extension unit 21 for extending BIT BITs in LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES;
a setting unit 22, configured to set the obtained first affinity attribute in the path recording object, and set the path recording object in the BIT extension BIT in LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES.
In the above embodiment of the present invention, as shown in fig. 12, if the first node is a previous node of the second node, correspondingly, the apparatus further includes:
a second obtaining module 40, configured to obtain a second affinity attribute of a downstream interface of the second node;
a second setting module 50, configured to set the obtained second affinity attribute in the received message, LSP _ REQUIRED _ ATTRIBUTES or BIT extension BIT in LSP _ ATTRIBUTES;
the second collecting module 60 is configured to send a packet carrying LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES through the second node, and collect, by the next node of the second node, the first affinity attribute of the downstream interface of the first node and the second affinity attribute of the downstream interface of the second node.
In the above embodiment of the present invention, as shown in fig. 13, if the first node is a node next to the second node, correspondingly, the apparatus further includes:
a third obtaining module 70, configured to obtain a third affinity attribute of the upstream interface of the second node;
a third setting module 80, configured to set the obtained third affinity attribute in the LSP _ requested _ ATTRIBUTES or the BIT extension BIT in LSP _ ATTRIBUTES of the received packet;
a third collecting module 90, configured to send a packet carrying LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES through the second node, and collect, by a previous node of the second node, the first affinity attribute of the upstream interface of the first node and the third affinity attribute of the upstream interface of the second node.
In the method for collecting the affinity attribute of the LSP path according to the embodiment of the present invention, the obtained affinity attribute of the upstream or downstream interface of the node in the LSP path is set in the BIT extension BIT in LSP _ REQUIRED _ ATT _ bytes or LSP _ ATTRIBUTES, a packet carrying LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES is sent to the previous node or the next node, and the previous node or the next node collects the affinity attribute of the upstream or downstream interface of the node, so that the tunnel head and tail node can automatically obtain the affinity attribute on the LSP path.
It should be noted that the apparatus for collecting LSP path affinity attributes provided by the present invention is an apparatus applying the above method, and all embodiments of the above method are applicable to the apparatus and can achieve the same or similar beneficial effects.
While the foregoing is directed to the preferred embodiment of the present invention, it will be understood by those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (13)
1. A method of collecting LSP path affinity attributes, the method comprising:
acquiring a first affinity attribute of an upstream or downstream interface of a first node in an LSP path;
setting the acquired first affinity attribute in a BIT extension BIT in an LSP _ REQUIRED _ ATTRIBUTES Label switching Path requirement attribute or an LSP _ ATTRIBUTES Label switching Path attribute;
and sending a message carrying the LSP _ REQUIRED _ ATTRIBUTES or the LSP _ ATTRIBUTES to a second node which is one of the previous node and the next node in the LSP path through the first node, and collecting a first affinity attribute of an upstream or downstream interface of the first node by the second node.
2. The method of claim 1, wherein if the first node is a previous node to the second node, the method further comprises:
and when the second node does not support the affinity attribute collection function, if the message carries the LSP _ REQUIRED _ ATTRIBUTES, sending a path error message to the first node through the second node.
3. The method of claim 1, wherein if the first node is a previous node of the second node, the method further comprises:
and when the second node does not support the affinity attribute collection function, if the packet carries the LSP _ ATTRIBUTES, sending the packet carrying only the first affinity attribute of the first node to the next node of the second node through the second node.
4. The method according to claim 1, wherein the setting the obtained first affinity attribute in a BIT extension BIT in an LSP _ REQUIRED _ ATTRIBUTES label switched path requirement attribute or an LSP _ ATTRIBUTES label switched path attribute specifically comprises:
extending the BIT in the LSP _ REQUERED _ ATTRIBUTES or the LSP _ ATTRIBUTES;
setting the acquired first affinity attribute in a path recording object, and setting the path recording object in the LSP _ REQUERED _ ATTRIBUTES or a BIT extension BIT in the LSP _ ATTRIBUTES.
5. The method of claim 1, wherein if the first node is a previous node of the second node, the method further comprises:
acquiring a second affinity attribute of a downstream interface of the second node;
setting the obtained second affinity attribute in the received LSP _ REQUIRED _ ATTRIBUTES or BIT extension BIT in LSP _ ATTRIBUTES in the message;
and sending a message carrying the LSP _ REQUIRED _ ATTRIBUTES or the LSP _ ATTRIBUTES through the second node, and collecting a first affinity attribute of a downstream interface of the first node and a second affinity attribute of the downstream interface of the second node by a next node of the second node.
6. The method of claim 1, wherein if the first node is a node next to the second node, the method further comprises:
acquiring a third affinity attribute of an upstream interface of the second node;
setting the obtained third affinity attribute in the LSP _ REQUIRED _ ATTRIBUTES or the BIT extension BIT in the LSP _ ATTRIBUTES of the received message;
and sending a message carrying the LSP _ REQUIRED _ ATTRIBUTES or LSP _ ATTRIBUTES through the second node, and collecting a first affinity attribute of an upstream interface of the first node and a third affinity attribute of the upstream interface of the second node by a previous node of the second node.
7. The method according to any one of claims 1 to 6, wherein if the packet is sent downstream in the data packet transmission direction, the packet is a PATH packet;
and if the message is transmitted reversely along the data message transmission direction, the message is an RESV message.
8. An apparatus for collecting LSP path affinity attributes, the apparatus comprising:
a first obtaining module, configured to obtain a first affinity attribute of an upstream or downstream interface of a first node in an LSP path;
a first setting module, configured to set the obtained first affinity attribute in a BIT extension BIT in an LSP _ REQUIRED _ ATTRIBUTES label switching path requirement attribute or an LSP _ ATTRIBUTES label switching path attribute;
a first collecting module, configured to send a packet carrying the LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES to a second node that is one of the previous and next second nodes in an LSP path through the first node, and collect, by the second node, a first affinity attribute of an upstream or downstream interface of the first node.
9. The apparatus of claim 8, wherein if the first node is a previous node to the second node, the apparatus further comprises:
a first sending module, configured to send a path error message to the first node through the second node if the LSP _ requested _ ATTRIBUTES is carried in the packet when the second node does not support an affinity attribute collection function.
10. The apparatus of claim 8, wherein if the first node is a node previous to the second node, the apparatus further comprises:
a second sending module, configured to send, by the second node, a packet that only carries the first affinity attribute of the first node to a next node of the second node if the packet carries the LSP _ ATTRIBUTES when the second node does not support an affinity attribute collecting function.
11. The apparatus of claim 8, wherein the first setting module specifically comprises:
an extension unit for extending the LSP _ REQUERED _ ATTRIBUTES or the BIT BIT in the LSP _ ATTRIBUTES;
a setting unit, configured to set the obtained first affinity attribute in a path recording object, and set the path recording object in the LSP _ requested _ ATTRIBUTES or a BIT extension BIT in the LSP _ ATTRIBUTES.
12. The apparatus of claim 8, wherein if the first node is a node previous to the second node, the apparatus further comprises:
a second obtaining module, configured to obtain a second affinity attribute of a downstream interface of the second node;
a second setting module, configured to set the obtained second affinity attribute in a BIT extension BIT in LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES in the received message;
a second collecting module, configured to send, by the second node, a packet carrying the LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES, and collect, by a next node of the second node, a first affinity attribute of the downstream interface of the first node and a second affinity attribute of the downstream interface of the second node.
13. The apparatus of claim 8, wherein if the first node is a node next to the second node, the apparatus further comprises:
a third obtaining module, configured to obtain a third affinity attribute of an upstream interface of the second node;
a third setting module, configured to set the obtained third affinity attribute in the received LSP _ requested _ ATTRIBUTES or BIT extension BITs in LSP _ ATTRIBUTES of the packet;
a third collecting module, configured to send, through the second node, a packet carrying the LSP _ requested _ ATTRIBUTES or LSP _ ATTRIBUTES, and collect, by a previous node of the second node, a first affinity attribute of the upstream interface of the first node and a third affinity attribute of the upstream interface of the second node.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410674639.8A CN105681195B (en) | 2014-11-21 | 2014-11-21 | Method and device for collecting LSP path affinity attribute |
| PCT/CN2015/079111 WO2016078367A1 (en) | 2014-11-21 | 2015-05-15 | Method and apparatus for collecting affinity attribute of lsp |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410674639.8A CN105681195B (en) | 2014-11-21 | 2014-11-21 | Method and device for collecting LSP path affinity attribute |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105681195A CN105681195A (en) | 2016-06-15 |
| CN105681195B true CN105681195B (en) | 2020-05-22 |
Family
ID=56013211
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410674639.8A Active CN105681195B (en) | 2014-11-21 | 2014-11-21 | Method and device for collecting LSP path affinity attribute |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN105681195B (en) |
| WO (1) | WO2016078367A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108881340A (en) * | 2017-05-11 | 2018-11-23 | 中兴通讯股份有限公司 | A kind of method and device that time delay is collected |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101001201A (en) * | 2006-01-13 | 2007-07-18 | 华为技术有限公司 | Method for setting count request delay |
| WO2009109824A1 (en) * | 2008-03-04 | 2009-09-11 | Telefonaktiebolaget Lm Ericsson (Publ) | A system and method of automatically configuring i-sids in gmpls controlled eternet provider backbone bridged networks |
| US7948885B1 (en) * | 2008-02-28 | 2011-05-24 | Nortel Networks Limited | Link bundle co-routed VCAT via RSVP message bundling |
| CN102123088A (en) * | 2011-02-21 | 2011-07-13 | 杭州华三通信技术有限公司 | TE (Traffic Engineering) tunnel establishing method and equipment |
| CN102136996A (en) * | 2010-08-10 | 2011-07-27 | 华为技术有限公司 | Route information updating method, node and system used for rapid rerouting binding |
| CN103384220A (en) * | 2013-06-28 | 2013-11-06 | 华为技术有限公司 | Method, device and system for building traffic engineering label switching path |
| CN103729244A (en) * | 2013-12-17 | 2014-04-16 | 华为技术有限公司 | Collection method and collection device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100776790B1 (en) * | 2006-12-04 | 2007-11-19 | 한국전자통신연구원 | Message processing method and apparatus in lsr for setting lsp using rsvp-te protocol |
-
2014
- 2014-11-21 CN CN201410674639.8A patent/CN105681195B/en active Active
-
2015
- 2015-05-15 WO PCT/CN2015/079111 patent/WO2016078367A1/en active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101001201A (en) * | 2006-01-13 | 2007-07-18 | 华为技术有限公司 | Method for setting count request delay |
| US7948885B1 (en) * | 2008-02-28 | 2011-05-24 | Nortel Networks Limited | Link bundle co-routed VCAT via RSVP message bundling |
| WO2009109824A1 (en) * | 2008-03-04 | 2009-09-11 | Telefonaktiebolaget Lm Ericsson (Publ) | A system and method of automatically configuring i-sids in gmpls controlled eternet provider backbone bridged networks |
| CN102136996A (en) * | 2010-08-10 | 2011-07-27 | 华为技术有限公司 | Route information updating method, node and system used for rapid rerouting binding |
| CN102123088A (en) * | 2011-02-21 | 2011-07-13 | 杭州华三通信技术有限公司 | TE (Traffic Engineering) tunnel establishing method and equipment |
| CN103384220A (en) * | 2013-06-28 | 2013-11-06 | 华为技术有限公司 | Method, device and system for building traffic engineering label switching path |
| CN103729244A (en) * | 2013-12-17 | 2014-04-16 | 华为技术有限公司 | Collection method and collection device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105681195A (en) | 2016-06-15 |
| WO2016078367A1 (en) | 2016-05-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4549961B2 (en) | Communication path monitoring system and communication network system | |
| CN104333511B (en) | Determine the method, apparatus and system of service transmission path | |
| JP4997196B2 (en) | Communication network system, path calculation device, and communication path establishment control method | |
| CN111245644B (en) | Method and system for expanding PCEP (physical layer protocol) protocol to automatically create tunnel in SDN (software defined network) scene | |
| CN100372337C (en) | Route selection method for implementing cross-domain constraint-based routing | |
| CN108234312A (en) | A kind of traffic scheduling method, PCE and SDN network system | |
| CN104365072A (en) | Apparatus and method for computing end-to-end paths through a network comprising a plurality of network domains | |
| JP2013502107A (en) | Inheritance method of forwarding neighbor property in multi-layer network and corresponding multi-layer network | |
| EP2015509A1 (en) | Method, system and node device of establishing identifier mapping relationship | |
| CN110140331A (en) | Path calculation method and device | |
| JP2003273904A (en) | Route control method and route controller | |
| US20070074039A1 (en) | Method for implementing services on a network element based on multiple IDs | |
| CN102752185B (en) | A kind of method and system determining routed path | |
| CN105681195B (en) | Method and device for collecting LSP path affinity attribute | |
| WO2015024440A1 (en) | Method and system of obtaining link overhead value of ip link | |
| CN105207905B (en) | Route selection method and device | |
| CN108667751B (en) | Method and device for announcing time delay information | |
| CN108234355B (en) | Network resource reservation method, PCE (personal computer equipment) and SDN (software defined network) system | |
| CN105530109B (en) | A kind of network element is method, router and the system of slotting i.e. management | |
| CN107872338A (en) | NMS, business configuration, business configuration requesting method and device | |
| CN108429688A (en) | A kind of single node failure route protection method based on section routing | |
| CN103067271B (en) | The implementation method and device of two-way approach | |
| WO2018205887A1 (en) | Delay collection method and apparatus | |
| CN101222407A (en) | Method for evading loose node automatic loop circuit | |
| CN102882742A (en) | Method and equipment for determining a traffic source |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |