Dynamically created service class-based routing tables
US6563798B1 · kind B1 · utility
Assignee
Inventor
Key dates
| Filing date | Jun 29, 1998 |
| Grant date | May 13, 2003 |
| Priority date | — |
| Expiry date | Jun 29, 2018 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/48
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Dynamically created routing table structures which may find application as routing tables for ATM or other computer networks provide a selection of pre-computed routes optimized to a specified constraint such as delay and delay variation (e.g., as measured by CTD and CDV), or administrative weight (AW). The routing tables may be implemented as shortest path trees, e.g., as may be generated by a Dijkstra process, which represent the computed routes within the network, optimized to a specified constraint for one or more specified network service categories. Thus, the routing tables allow for rapid compilation of one or more source-computed routes (e.g., DTLs in an ATM network). In some cases, the routing tables may include alternate routes between network nodes. Any number of tables, between a minimum of three and a maximum of ten, may be created.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.