Efficient system and method of node and link insertion for deadlock-free routing on arbitrary topologies
US7152113B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 19, 2001 |
| Grant date | Dec 19, 2006 |
| Priority date | — |
| Expiry date | Dec 11, 2023 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/44
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A system and method for adding routing information for a node to a routing table, which efficiently makes necessary changes to the routing table to support routing to and from the node, while maintaining the deadlock-free quality of the paths described by the routing table. The routing table is generated by storing routing information in the routing table that reflects and describes a deadlock-free set of paths through a network of nodes. A row of entries is added to the routing table describing how to forward data units from the node. A column of entries is added to the routing table describing how to forward data units addressed to the node. The forwarding information within each entry added to the routing table maintains the deadlock-free quality of the set of paths represented by the forwarding table.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.