Redistributing routes in backbone edge bridge multi-chassis link aggregation group topologies between two routing protocols
US-9225627-B2 · Dec 29, 2015 · US
US9246794B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-9246794-B2 |
| Application number | US-201213566029-A |
| Country | US |
| Kind code | B2 |
| Filing date | Aug 3, 2012 |
| Priority date | Aug 3, 2012 |
| Publication date | Jan 26, 2016 |
| Grant date | Jan 26, 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.
In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology for reaching a destination device, the loop-free routing topology comprising distinct paths for reaching the destination device; generating a set of serialized representations describing the loop-free routing topology, each serialized representation describing a corresponding one of the paths; and propagating the set of serialized representations from the destination device to network nodes in the computing network, enabling the network nodes to establish loop-free label switched paths for reaching the destination device via the loop-free routing topology.
Opening claim text (preview).
What is claimed is: 1. A method comprising: creating, in a computing network, a loop-free routing topology for reaching a destination device, the loop-free routing topology comprising a set of distinct paths for reaching the destination device, wherein the loop-free routing topology provides, to each network node having at least two data links in the network topology, at least two respective non-congruent paths that do not share any common data link for reaching the destination…
Electricity · mapped topic
Electricity · mapped topic
Electricity · mapped topic
Electricity · mapped topic
Electricity · mapped topic
Related publications grouped by family.
Free tools are coming soon. Tell us what you want to track and we'll notify you.
Answers are generated from the same data shown on this page.