Multilevel table routing
US6778539B1 · kind B1 · utility
4Cited by
8References
4Claims
0Family size
Assignee
Inventor
Key dates
| Filing date | Mar 7, 2000 |
| Grant date | Aug 17, 2004 |
| Priority date | — |
| Expiry date | Mar 7, 2020 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/54
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method of using routing tables. In this method, routing differs from ordinary table routing in that the part of a destination address (e.g., DestinationID) used for a table lookup is variable. Networks using the full address space of a network node can be made by partitioning the network topology into several levels, such as a top topology and any number of sub-topologies. With a DestinationID of N−1 bits, a routing table of 2n entries is sufficient to support topologies using the full address space, wherein n<N−1.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.