Method and apparatus for deriving optimal paths through a network subject to a subset sequence constraint
US7400589B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Feb 27, 2004 |
| Grant date | Jul 15, 2008 |
| Priority date | — |
| Expiry date | Jul 21, 2026 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/48
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A routing tree that spans a graph representing a network is constructed by iteratively expanding the tree to include a node of the graph that is not in the tree, the node being chosen because an allowable path extends from a root of the tree to the node that is optimal in comparison with the other paths to the other nodes not in the tree. If the path to the node cannot be extended to a node in the serial restriction group, the node is re-included in the tree using a secondary path to the node that can be extended to a node in the serial restriction group, if the secondary path is most optimal among the paths to nodes outside of the tree.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.