Adaptive routing of messages in parallel and distributed processor systems
US5170393A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Dec 3, 1990 |
| Grant date | Dec 8, 1992 |
| Priority date | — |
| Expiry date | Dec 3, 2010 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/06
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
In a multi-node network containing a plurality of parallel and distributed nodes, this invention reduces the time to establish a through-path or make a decision that no through-path can be established at the present time. In one aspect, each node that can be an originating node contains connectivity analysis logic which performs a minimum cycle breakdown of the possible paths between the originating node and the destination node to establish a list of nodes to be tried before attempting to establish a through-path to a destination node whereby exhaustive testing of all paths is not undertaken. In another, each node that can be an intermediate node contains pruning logic for pruning a non-variable tested path and all associated paths depending therefrom from further testing whereby redundant testing of paths which will result in failure is eliminated. In yet another, each node that can be an intermediate node contains backtracking logic for not waiting at the node for a link to a busy next-adjacent further node to free up and for backtracking to a next-adjacent previous node when no next-adjacent further node is immediately non-busy. Additionally, each node contains an intelligent c…
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.