Routing bandwidth-reserved connections in information networks
US6016306A · kind A · utility
63Cited by
10References
4Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Sep 12, 1996 |
| Grant date | Jan 18, 2000 |
| Priority date | — |
| Expiry date | Sep 12, 2016 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L2012/5619
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
This invention defines a routing method which allows a determination of best paths from link weights in situations where these weights are not additive, but the characteristic of a concatenated path is determined mainly by single "bottleneck" links. To be compatible, the metric must be chosen from a specific set of metrics, called bottleneck metrics in this description. The new widest-path method has some characteristics in common with the known Dijkstra method for additive weights. Implementations in communication networks are disclosed which lead to new nodes, new networks and new network protocols.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.