Adaptive routing method for a dynamic network
US6667957B1 · kind B1 · utility
Assignees
Inventors
Key dates
| Filing date | Mar 12, 1999 |
| Grant date | Dec 23, 2003 |
| Priority date | — |
| Expiry date | Mar 12, 2019 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04W40/28
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A routing system and method utilizes a highly-adaptive, loop-free, distributed routing algorithm for dynamic networks. The basic, underlying method is neither a distance-vector nor a link-state method; the invention employs an algorithm which is one of a family of algorithms which are called “link reversal” algorithms. The protocol's reaction is structured as a sequence of diffusing computations, each computation consisting of a sequence of directed link reversals. This behavior is achieved, in part, through the use of a “physical or logical clock” to establish the temporal order of topological change events. A key concept in the protocol's design; is an attempt to decouple (to the greatest extent possible) the generation of far-reaching control message propagation from the dynamics of the network topology. These design characteristics make the protocol highly-adaptive, efficient and scalable-being best-suited for use in large, dynamic, bandwidth-constrained networks. In such networks, the protocol's reaction to link failures typically involves only a single pass of the distributed algorithm. The results of a simulation study indicate that for a given availa…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.