PATENT CLAIM ANALYSIS

Application Number: 15952566
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2019-10
Patent Classification: ["717", "172000"]

Abstract:
In a multiple interface, low power and lossy network comprising multiple nodes, a Network Management System (“NMS”) communicating firmware upgrades in each node of a network utilizing centralized scheduling and distributed dissemination of firmware blocks. A firmware update image is broken into blocks and transmitted throughout the network of nodes. In certain instances, every node does not receive every firmware block. The NMS receives a bitmap from the nodes indicating which of the blocks each node is missing from the update. The NMS identify particular nodes that are missing blocks and source nodes that have the blocks and are nearest to the particular recipient nodes. The NMS determines the route for the source node with the block to deliver the block to the recipient node that this missing a block. The source nodes that are identified and instructed to communicate a block to a recipient node.

Claim (Index 1):
A method, comprising:\n by a network management system;\n in a low power and lossy network (LLN) comprising one or more interfaces and a plurality of nodes, communicating a plurality of blocks of data to a plurality of nodes, wherein the plurality of nodes are separate and distinct from the network management system; \n receiving a status of each of the plurality of nodes, the status indicating which of the blocks of data have been received by each of the plurality of nodes; \n determining based on the received statuses that a first node has not received a particular block of data; \n determining based on the received statuses one or more nodes that have received the particular block of data; \n determining an overall strategy to communicate the particular block of data to the first node from the one or more nodes that have received the particular block of data, wherein the strategy comprises selecting a second node from the one or more nodes that have received the particular block of data, the second node being located along a shortest pathway from the first node as compared to a pathway length between the first node and each of the remaining nodes of the one or more nodes that have received the particular block of data; and \n communicating instructions to the second node to communicate the particular block of data to the first node, wherein the instructions are comprised of a route for the second node to communicate the particular block of data to the first node, and wherein the route is comprised of the shortest pathway from the first node to the second node.

Metadata:
- Claim Count in Document: 50.0
- Percentile: 91.0
- Lexical Diversity: 2.13333
- Patent Class: 717.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['14154127', '14136425', '14522580', '14333755', '13960622']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3654576373119674
- 35 USC 102 Novelty (BERT): 0.4878391377650771
- Combined Prediction Score: 0.3776957873572784
- Mean Citation Score: 162.56448
- Max Citation Score: 165.22992
- Similarity Product: 117.7872071548748

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