Methods and systems for data packet routing
US9444731B2 · kind B2 · utility
0Cited by
4References
17Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | May 24, 2013 |
| Grant date | Sep 13, 2016 |
| Priority date | — |
| Expiry date | Jan 12, 2034 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/48
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Optimizing a bitmap data tree and a corresponding lookup operation in the bit map data tree may be provided. A number of branches for each search node of a data tree may be counted. The data tree may comprise a plurality of search nodes. Then an optimum depth for the plurality of search nodes may be identified based on the number of branches in the data tree. Next, a hash node may be added to replace a search node of the data tree when a number of branches for the search node is greater than the identified optimum depth.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.