Route selection using cached partial trees in a data communications network
US5321815A · kind A · utility
55Cited by
6References
2Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Oct 16, 1992 |
| Grant date | Jun 14, 1994 |
| Priority date | — |
| Expiry date | Oct 16, 2012 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/488
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A process for selecting a least weight path between two nodes in a data communication network uses partial trees created and cached in prior route selection operations. All root nodes on possible paths between the two nodes are identified. Any cached tree having a root matching one of the identified root nodes is retrieved from storage. If necessary, each retrieved tree is extended until it includes all possible destination nodes. The extended and/or retrieved trees are used to select the least weight path between the two nodes. The extended tree is then cached for possible use in future route selection operations.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.