Data communication routing method and device
US5577030A · kind A · utility
15Cited by
3References
30Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Aug 31, 1995 |
| Grant date | Nov 19, 1996 |
| Priority date | — |
| Expiry date | Aug 31, 2015 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/122
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A device and method for designing a reliable communication network using disjoint paths with no shared links or nodes. An adjacency matrix is copied to a temporary adjacency matrix, and when it has been confirmed by matrix calculation that there is a path or paths between the origin and destination nodes, a path is obtained backwards and links in the path are deleted. The search for a path is repeated using the resulting temporary adjacency matrix. In this way, the actual number of disjoint paths is never overestimated. Rapid calculation is possible by means of a super-computer.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.