PATENT CLAIM ANALYSIS

Application Number: 16149680
Application Type: Utility
Filing Date: 2018-10
Publication Date: 2019-06
Patent Classification: ["370", "392000"]

Abstract:
A Forwarding Information Base (FIB) caching system and scheme that selects and generates a minimal number of non-overlapping prefixes for the FIB cache to improve computer-based network communications and operations efficiency, accuracy and speed. Because the cached prefixes do not cover any longer prefixes in the full FIB, the present invention thus avoids cache-hiding issues. The system further comprises a FIB caching updating component that systematically handles cache misses, cache replacement, and routing updates.

Claim (Index 9):
A method of managing a Forwarding Information Base cache to improve network communications; comprising the steps of:\n receiving a data packet with destination information; determining, using a microprocessor, if there is match between the destination information and one or more leaf prefix entries in a Forwarding Information Base cache; if there is a match, selecting the longest matching leaf prefix entry from the Forwarding Information Base cache, and forwarding the data packet to the next hop based on the next hop information attached to the selected leaf prefix entry; if there is not a match in the Forwarding Information Base cache, determining if there is a match between the destination information and one or more prefix entries in a full Forward Information Base data table; if there is a match in the Forward Information Base data table, then performing the steps of:\n selecting the longest matching prefix entry for the full Forward Information Base data table, and forwarding the data packet to the next hop based on the next hop information attached to the selected prefix entry; \n generating a leaf prefix entry with corresponding next hop information from the selected prefix entry and corresponding next hop information in the full Forward Information Base data table; and \n adding the generated leaf prefix entry and corresponding next hop information to the Forward Information Base cache; \n wherein leaf prefix entries are the most specific non-lapping prefixes that do not hide or cover any longer prefix entries contained in the full Forwarding Information Base data table; wherein the full prefix entries in the Forwarding Information Base data table and the plurality of leaf prefix entries in the Forwarding Information Base cache are organized in a space-optimized tree structure with internal nodes and leaf nodes; wherein the nodes in the full Forwarding Information Base data table comprise at least three types of nodes.

Metadata:
- Claim Count in Document: 9.0
- Percentile: 97.0
- Lexical Diversity: 1.38333
- Patent Class: 370.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14524890', '10244719', '15925815', '15186477', '13369763']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5455073892168986
- 35 USC 102 Novelty (BERT): 0.5480812968008566
- Combined Prediction Score: 0.5457647799752944
- Mean Citation Score: 263.592006
- Max Citation Score: 409.02716
- Similarity Product: 384.3555600788784

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

Dataset: test