PATENT CLAIM ANALYSIS

Application Number: 16039372
Application Type: Utility
Filing Date: 2018-07
Publication Date: 2020-01
Patent Classification: ["370", "392000"]

Abstract:
A method for packet processing includes representing a routing table for a network as a binary search tree of address prefixes ordered by prefix lengths. For each node j in the binary search tree, a respective hash table is stored, including entries representing the address prefixes of length L j . Each address prefix includes L j −c most significant bits (MSB) and c least significant bits (LSB), and each entry in the respective hash table includes a matching value corresponding to the L j −c MSB of one or more of the address prefixes and one or more action codes indexed by the c LSB of the one or more of the address prefixes. Upon receiving from the network a data packet having a destination address, the binary search tree is traversed to find a longest prefix match by performing, at each node j, a hash lookup in the respective hash table.

Claim (Index 5):
The method according to  claim 3 , wherein the markers include jump markers, which guide traversal of the search tree from a given parent node to a descendant node that is separated from the parent node in the binary search tree by at least one intermediate hierarchical level.

Metadata:
- Claim Count in Document: 47.0
- Percentile: 95.0
- Lexical Diversity: 2.24324
- Patent Class: 370.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['15186562', '10244719', '10780213', '15186477', '12377032']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.6184543293121317
- 35 USC 102 Novelty (BERT): 0.5298305730181027
- Combined Prediction Score: 0.6095919536827289
- Mean Citation Score: 320.694006
- Max Citation Score: 363.51465
- Similarity Product: 259.4198422859609

Labels:
- Claim Label 101: 1
- Claim Label 102: 0
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 1

Dataset: test