Process for routing data packets around a multi-node communications network
US5297137A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Jan 30, 1991 |
| Grant date | Mar 22, 1994 |
| Priority date | — |
| Expiry date | Jan 30, 2011 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/02
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A dynamic technique for routing data packets between entry and destination nodes of a multi-node communication network of arbitrary topology In accordance with this technique, the nodes of the network are connected together by a multitude of links, and a subset of these links form a virtual ring embedded in the network and traversing each node thereof at least once. The nodes route each data packet to a destination node without requiring any data from the data packet other than data identifying the destination node of the data packet. Also, the nodes route each data packet to its destination node such that the distance, along the virtual ring, between the data packet and its destination node always decrease. Data packets in the virtual embedded ring have priority to continue to be routed on the ring. As a result, lossless routing with a single buffer per each input link is provided. The objective of the routing function of every intermediate node is to try to decrease the distance to the destination as much as possible.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.