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 14):
A system, comprising:\n a device configured to perform packet processing, the device comprising;\n one or more network interfaces configured to transmit and receive packets via a network connection to the device; \n a memory, storing a plurality of forwarding routes in a hash table, wherein the hash table comprises a plurality of hash table segments; and \n a packet processing pipeline, configured to:\n receive a network packet via one of the network interfaces; \n divide a destination address for the network packet into different segments corresponding to different ones of the hash table segments; \n determine respective hash key values for the different segments according to the hash scheme, wherein to determine the respective hash values the packet processing pipeline is configured to:\n generate digest values for individual ones of the different segments; \n wherein the respective hash key values for those segments of the destination address subsequent to a most significant one of the different segments of the destination address are determined based on the digest value generated for a previous one of the different segments; \n \n access the hash table segments according to the respective hash key values to obtain different hash table entries; \n evaluate the different hash table entries to identify a forwarding route with a longest prefix match with respect to the destination address for the network packet; and \n forward the network packet according to the identified forwarding route via one of the network interfaces.

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

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5186509726475476
- 35 USC 102 Novelty (BERT): 0.5623116579105598
- Combined Prediction Score: 0.5230170411738488
- Mean Citation Score: 299.44604400000014
- Max Citation Score: 425.6857
- Similarity Product: 403.3920020354032

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