Routing table structures
US6600724B1 · kind B1 · utility
Assignee
Inventor
Key dates
| Filing date | Apr 28, 1998 |
| Grant date | Jul 29, 2003 |
| Priority date | — |
| Expiry date | Apr 28, 2018 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/48
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A routing table structure for ATM or other networks comprises a shortest path tree architected and organized as a pseudo-spanning tree. The pseudo-spanning tree is a graphical representation of computed routes within the network, optimized to a specified constraint for a specified network service category, and allows for rapid compilation of one or more source-computed routes (e.g., DTLs in an ATM network) by traversing from a destination node specified in a call request to the calculating node (i.e., the node at which the request is received). Unlike conventional spanning trees, however, the pseudo-spanning tree representation may include alternate routes between network nodes. By providing these alternate routes in a single routing table structure, the present invention may utilize less storage and processing resources as compared to routing table schemes of the past. Further, in addition to the single optimization criterion, the routing table structure includes other network traffic parameters for associated links and nodes of the network.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.