Message routing in a computer network
US4466060A · kind A · utility
126Cited by
3References
22Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Feb 11, 1982 |
| Grant date | Aug 14, 1984 |
| Priority date | — |
| Expiry date | Feb 11, 2002 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/484
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
An adaptive distributed message routing algorithm that may be implemented in a computer program to control the routing of data messages in a packet message switching digital computer network. Network topology information is exchanged only between neighbor nodes in the form of minimum spanning trees, referred to as exclusionary trees. An exclusionary tree is formed by excluding the neighbor node and its links from the tree. From the set of exclusionary trees received a route table and transmitted exclusionary trees are constructed.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.