Method for selecting least weight end node to end node route in a data communications network
US4873517A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jun 23, 1988 |
| Grant date | Oct 10, 1989 |
| Priority date | — |
| Expiry date | Jun 23, 2008 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/44
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
When computing a least weight path from an origin node to a destination node in a data communication network, a route-computing network node uses information provided by the origin and destination nodes to compute least weight routes from those nodes to adjacent network nodes. The route-computing network node uses information in the topology database to compute least weight routes from network nodes adjacent the origin node to network nodes adjacent the destination node. The results of the computations are concatenated to determine an optimum route from the origin node to the destination node. The topology database need not include information about the transmission groups connecting the origin/destination nodes to network nodes.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.