PATENT CLAIM ANALYSIS

Application Number: 15983856
Application Type: Utility
Filing Date: 2018-05
Publication Date: 2018-09
Patent Classification: ["370", "389000"]

Abstract:
Entropy in routing tables may be increase to perform packet forwarding. Hash tables that store forwarding routes may be divided into multiple hash table segments. Forwarding routes may be stored across the hash table segments in different route segments. When looking up route segments to identify a forwarding route for a destination address of a network packet, digest values generated for previous route segments may be used to determine hash key values to identify hash table entries in a different hash table segment. The forwarding route may be identified according to the hash table entries located based on the digest values for previous route segments.

Claim (Index 8):
The method of  claim 5 , wherein accessing the hash table segments according to the respective hash keys to evaluate the different hash table entries comprises evaluating a pointer to a prior hash table entry that represents a more significant portion of the forwarding route of those hash table entries that match the destination address for the network packet.

Metadata:
- Claim Count in Document: 8.0
- Percentile: 93.0
- Lexical Diversity: 2.05556
- Patent Class: 370.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['14981667', '14966504', '14981664', '14981656', '14981672']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5487148702656554
- 35 USC 102 Novelty (BERT): 0.5637124071843528
- Combined Prediction Score: 0.5502146239575251
- Mean Citation Score: 299.44604400000014
- Max Citation Score: 425.6857
- Similarity Product: 394.4810588944196

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

Dataset: test