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 19):
A computer software product, comprising a non-transitory computer-readable medium in which program instructions are stored, which instructions, when read by a programmable processor, cause the processor to store, in a memory, a representation of a routing table for a network as a binary search tree of address prefixes ordered by prefix lengths, such that each node j in the binary search tree corresponds to a respective prefix length L j , and to store for each node j in the binary search tree, a respective hash table comprising entries representing the address prefixes of length L j , each address prefix comprising L j \u2212c most significant bits (MSB) and c least significant bits (LSB), and each entry in the respective hash table comprising a matching value corresponding to the L j \u2212c 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,\n wherein the instructions cause the processor, upon receiving from the network a data packet having a destination address, to traverse the binary search tree to find a longest prefix match between the destination address and the address prefixes by extracting, at each node j that is traversed, a key of length L j  from the destination address, performing a hash lookup in the respective hash table over the L j \u2212c MSB of the key to find a matching entry, and selecting from the matching entry an action code indicated by the c LSB of the key, and to process the data packet in accordance with the action code indicated by the matching entry that corresponds to the longest prefix match.

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5891534580922219
- 35 USC 102 Novelty (BERT): 0.5267717832592709
- Combined Prediction Score: 0.5829152906089268
- Mean Citation Score: 320.694006
- Max Citation Score: 363.51465
- Similarity Product: 302.3674066194892

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