Timestamp-based packet switching using a trie data structure
US11502974B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Oct 29, 2020 |
| Grant date | Nov 15, 2022 |
| Priority date | — |
| Expiry date | Oct 29, 2040 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L45/748
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
Systems and methods of network packet switching use a table representation of a trie data structure to identify a timestamp (TS) range (or time range) for a received packet based on the packet timestamp (TS). The trie data structure is programmed with a plurality of predetermined time ranges. Each node in the trie data structure corresponds to a TS prefix and is associated with a corresponding predetermined time range. A search engine in the network switch can use the packet TS as a key to traverse the trie data structure and thereby matching the packet TS to a predetermined time range according to a Longest Prefix Match (LPM) process. Provided with the TS ranges of the incoming packets, various applications and logic engines in the network switch can accordingly process the packets, such as determining a new destination IP address and performing channel switch accordingly.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.