Fetching topologies using timestamp-callback map
US-12184500-B1 · Dec 31, 2024 · US
US9350620B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9350620-B2 |
| Application number | US-201414332860-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 16, 2014 |
| Priority date | Jan 17, 2012 |
| Publication date | May 24, 2016 |
| Grant date | May 24, 2016 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
Embodiments of the present invention disclose a method for creating a ring network label switched path. The method includes: receiving, by a first node, a first Path message used for creating a first label switched path from a second node; allocating a first label to the first label switched path; sending a first Resv message carrying the first label to the second node; and when the first node receives a second Path message and determines that a destination node of the second label switched path is the same as that of the first label switched path, allocating the first label to the second label switched path; and sending a second Resv message carrying the first label to the second node. Solutions of the embodiments of the present invention helps reduce the number of created ring network label switched paths and maintenance complexity.
Opening claim text (preview).
What is claimed is: 1. A method for creating a ring network label switched path, comprising: receiving, by a first node, a first Path message used for creating a first label switched path from a second node; allocating, by the first node, a first label to the first label switched path; sending, by the first node, a first Resv message carrying the first label to the second node; and when the first node receives a second Path message used for creating a second label switched path from the second node and determines that a destination node of the second label switched path is the same as that of the first label switched path, and the first node, the second node, and the destination node are located in a same ring network, allocating, by the first node, the first label to the second label switched path; and sending, to the second node, a second Resv message carrying the first label allocated to the second label switched path. 2. The method according to claim 1 , wherein the first Path message carries a ring identifier of a ring network where a source node corresponding to the first label switched path is located; the second Path message carries a ring identifier of a ring network where a source node corresponding to the second label switched path is located; and the ring identifier of the ring network where the source node corresponding to the first label switched path is located is the same as the ring identifier of the ring network where the source node corresponding to the second label switched path is located. 3. The method according to claim 1 , wherein: after the receiving, by a first node, a first Path message used for creating a first label switched path from a second node, the method further comprises: creating, by the first node, a Path state information block for the first label switched path; and after the first node receives the second Path message used for creating the second label switched path from the second node, the method further comprises: creating, by the first node, a Path state information block for the second label switched path, and merging the Path state information blocks created for the first label switched path and the second label switched path. 4. The method according to claim 3 , further comprising: generating, by the first node, according to the merged Path state information blocks, a Path message used for path state refreshing, and sending the Path message. 5. The method according to of claim 1 , wherein after the receiving, by a first node, a first Path message used for creating a first label switched path from a second node, the method further comprises: sending, by the first node to a downstream node of the first label switched path, a Path message used for creating the first label switched path; and when the first node receives, from the downstream node of the first label switch path, a third Resv message corresponding to the first label switched path, creating, by the first node, a Resv state information block for the first label switched path; and after the the first node receives the second Path message used for creating the second label switched path from the second node, the method further comprises: sending, by the first node to a downstream node of the second label switched path, a Path message used for creating the second label switched path; and when the first node receives, from the downstream node of the second label switch path, a fourth Resv message corresponding to the second label switched path, creating, by the first node, a Resv state information block for the second label switched path, and merging the Resv state information blocks created for the first label switched path and the second label switched path. 6. The method according to claim 5 , further comprising: generating, by the first node, according to the merged Resv state information blocks, a Resv message used for path state refreshing, and sending the Resv message. 7. The method according to claim 1 , wherein when the first node is an intermediate node of the second label switched path, after the first node receives the second Path message used for creating the second label switched path from the second node, the method further comprises: determining, by the first node, whether a resource requirement of the second label switched path is not designated, and when the resource requirement of the second label switched path is not designated, skipping sending, by the first node, the second Path message to a downstream node of the second label switched path. 8. The method according to claim 1 , comprising: advertising, by the first node, a ring identifier corresponding to the first node or at least one interface of the first node; and/or collecting, by the first node, network topology information; wherein the network topology information comprises: a ring identifier that is advertised by at least another one node in a same ring network where the first node is located and is corresponding to the at least another one node or at least one interface of the at least another one node. 9. A non-transitory computer-readable medium storing computer-executable instructions that, when executed by a processor, cause the following to be performed: receiving a first Path message used for creating a first label switched path from a second node; allocating a first label to the first label switched path; and sending a first Resv message carrying the first label to the second node; wherein, when a second Path message used for creating a second label switched path is received from the second node and a destination node of the second label switched path is the same as that of the first label switched path, and the network node, the second node, and the destination node are located in a same ring network, the allocating comprises allocating the first label to the second label switched path, and the instructions, when executed by the processor, further cause the following to be performed: sending, to the second node, a second Resv message carrying the first label allocated to the second label switched path. 10. The non-transitory computer-readable medium according to claim 9 , wherein the instructions, when executed by the processor, further cause the following to be performed: receiving the first Path message from the second node and used for creating the first label switched path, creating a Path state information block for the first label switched path; and after receiving the second Path message from the second node and used for creating the second label switched path, creating a Path state information block for the second label switched path; and merging the Path state information blocks created for the first label switched path and the second label switched path. 11. The non-transitory computer-readable medium according to claim 9 , wherein the instructions, when executed by the processor, further cause the following to be performed: after receiving the first Path message used for creating the first label switched path from the second node, sending, to a downstream node of the first label switched path, a Path message for creating the first label switched path; when receiving, from the downstream node of the first label switch path, a third Resv message corresponding to the first label switched path, creating a Resv state information block for the first label switched path; after receiving the second Path message used for creating the second label switched path from the second node, sending, to a downstream node of the second label switched path, a Path message for creating the second label switched path; when receiving, from the downstream node of the second label switch
Discovery or management of network topologies · CPC title
Ring fault isolation or reconfiguration {(for SDH/SONET ring networks H04J3/085)} · CPC title
Interconnected ring systems · CPC title
Details regarding a bus controller · CPC title
using label swapping, e.g. multi-protocol label switch [MPLS] · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.