Internet Protocol and Ethernet lookups via a unified hashed trie
A technology of network address and associated data, applied in the field of network communication
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0024] First of all, it should be understood that although the implementation of one or more embodiments is exemplified below, the disclosed system and / or method may be implemented by any number of known or existing technologies. The application is in no way limited to the implementations, drawings and techniques set forth below, including the typical designs and implementations shown and described, but may be modified within the scope of the appended claims and all equivalents thereof.
[0025] Network routers usually store some network prefixes in the FIB. These prefixes are represented by concrete nodes in the trie. During operation, when the data packet arrives at the router, it carries the network address. Then, a lookup process is started, checking the bits in the address and traversing through the trie accordingly. During the traversal process, whenever a node corresponding to the prefix in the FIB is found, the search process determines that the address matches the p...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


