System for communicating labeled routing trees to establish preferred paths and source routes with local identifiers in wireless computer networks
US6836463B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 15, 1999 |
| Grant date | Dec 28, 2004 |
| Priority date | — |
| Expiry date | Oct 15, 2019 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04W76/10
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
One or more labeled routing trees (LRTS) are produced at a router of a computer network according to a shortest path determination made over a partial topology graph of the network, which graph is produced according to knowledge of adjacent links of the router and one or more LRTs of neighboring routers. The LRTs of the router may be updated in response to receipt of routing state update messages, and such messages may include local link identifiers assigned by a head of a link to which the identifiers pertain, and node parameters of a tail of the link to which the local link identifiers pertain. The routing state update messages may be transmitted within the network: (i) in response to a new destination node being detected by an existing node within the network, (ii) in response to a destination becoming unreachable by a collection of the existing nodes, (iii) in response to the change in the cost of a path to at least one destination exceeding a threshold and/or (iv) in situations where a routing loop may be encountered among two or more of the nodes of the network (e.g., at times when a path implied in the LRT of the router leads to a loop).
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.