Synchronization mechanism for link state packet routing
US5265092A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Mar 18, 1992 |
| Grant date | Nov 23, 1993 |
| Priority date | — |
| Expiry date | Mar 18, 2012 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/03
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method of providing loop free and shortest path routing of data packets in a network having a plurality of switches, routing messages for communicating network topology information between the switches, a plurality of links connecting the switches and a plurality of channels connecting the switches to the links. The loop free routing of data packets is achieved through modifications to known link state packet (LSP) routing protocols and permits each switch to inform adjacent switches in the network of the information in the switch's database used to compute forwarding tables. A switch uses a received LSP to compute a forwarding table and informs neighboring switches on attached links of the routing change. The switch discards any subsequent data packets whose path would be affected by the changed routing information. The discarding of data packets continues until the switch receives notification from each adjacent switch affected by the changed routing information that all affected routing paths have been recalculated and the forwarding table of each affected switch has been updated. Thus, while adjacent switches temporarily contain inconsistent LSP databases and possibly inconsi…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.