The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jun. 06, 2017

Filed:

Dec. 01, 2005
Applicants:

Mikael Prytz, Rönninge, SE;

Joachim Sachs, Aachen, DE;

Per Magnusson, Linköping, SE;

Johan Lundsjö, Spånga, SE;

Peter Larsson, Solna, SE;

Inventors:

Mikael Prytz, Rönninge, SE;

Joachim Sachs, Aachen, DE;

Per Magnusson, Linköping, SE;

Johan Lundsjö, Spånga, SE;

Peter Larsson, Solna, SE;

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04L 12/721 (2013.01); H04L 12/735 (2013.01); H04W 40/00 (2009.01);
U.S. Cl.
CPC ...
H04L 45/123 (2013.01); H04L 45/12 (2013.01); H04L 45/1283 (2013.01); H04W 40/00 (2013.01);
Abstract

This invention extends routing mechanisms that use link metrics for route selection so that: A link metric cross correlation vector is determined for all links, where each element in the vector corresponds to some other link, and reflects the change in the link metric value if a data flow would already use this other link. The invention further describes a specific embodiment where all cross-correlating links are adjacent to each other, i.e., they terminate or originate in a common node. A mechanism is described to create an extended routing graph. This extended graph permits the use of standard polynomial time algorithms that simultaneously construct the optimal route and find the optimal route metric (such as shortest-path algorithms) also for the adjacent link cross-correlating case.


Find Patent Forward Citations

Loading…