Re-Routing of Diameter Commands
US-2015358229-A1 · Dec 10, 2015 · US
US8964565B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-8964565-B2 |
| Application number | US-201113698511-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 7, 2011 |
| Priority date | Jun 11, 2010 |
| Publication date | Feb 24, 2015 |
| Grant date | Feb 24, 2015 |
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.
Method for use in updating a routing information base of a node of a network, said routing information base comprising for each destination node of a number of destination nodes in said network a number of paths; wherein an update message with routing information is sent in said network from a first node to a peer of the first node, said first node having a first routing information base; wherein the update message comprises: a selected path for a first destination node of said number of destination nodes, said selected path comprising a next hop node adjacent the first node; at least one routing topology variable derived from the number of paths available for said first destination; said at least one routing topology variable being a measure for the risk on bottlenecks in the selected path.
Opening claim text (preview).
The invention claimed is: 1. A method comprising: creating an update message at a first node of a network, the update message including first routing information for updating a routing information base of a peer of the first node, said first routing information including, at least one path to a first destination node of a number of destination nodes, said at least one path including a next hop node that is adjacent to the first node, and at least one routing topology variable d…
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.