PATENT CLAIM ANALYSIS

Application Number: 15956733
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-10
Patent Classification: ["370", "392000"]

Abstract:
Effective data distribution without special hardware such as CAM. A unique Route ID in the network is used to determine the destinations for a sent packet. On creating the routing information for the Route ID, each node in the network creates an entry in its own forwarding table within the node. A linear memory offset in the table, called LookUp ID, is used to access the entry. By exchanging the LookUp ID with neighboring nodes and updating the forwarding table entry, the packet distribution path can be determined for the given Route ID. When a packet is sent for the given Route ID, each node updates the predetermined field in the packet with neighbor LookUp ID and sends it to the neighbor node, so the neighbor node can access its own entry as a regular memory access with the LookUp ID to determine where to forward the packet.

Claim (Index 5):
The method of  claim 4 , wherein two entries are bundled to represent a bidirectional data transfer mechanism:

Metadata:
- Claim Count in Document: 7.0
- Percentile: 91.0
- Lexical Diversity: 2.28571
- Patent Class: 370.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['13396711', '10340113', '09977960', '10244719', '12483912']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5815022231759863
- 35 USC 102 Novelty (BERT): 0.4984151847121177
- Combined Prediction Score: 0.5731935193295995
- Mean Citation Score: 228.615156
- Max Citation Score: 235.07057000000003
- Similarity Product: 160.01751197370413

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

Dataset: test