PATENT CLAIM ANALYSIS

Application Number: 15891719
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2018-06
Patent Classification: ["370", "328000"]

Abstract:
Methods and systems for discovery of a set of nodes in a network. The method comprises selecting a node amongst nodes in a group of nodes to be processed; and instructing to implement a discovery procedure for the selected node. The-procedure comprises broadcasting a neighbor discovery request from a node currently selected on a shared transmission medium of the network; and receiving at the node currently selected replies sent by neighbor nodes on the shared transmission medium and adding the neighbor nodes to the group of nodes to be processed; and repeating the steps of selecting and instructing for other nodes in the group of nodes to be processed, until all nodes of the set are discovered.

Claim (Index 17):
A computerized network comprising computer nodes, each with at least one processor comprising hardware operatively interconnected to a memory, whereby the computerized network is configured to implement the steps of:\n (a) selecting a computer node amongst computer nodes in a group of computer nodes to be processed; and (b) instructing from a source computer node to implement a discovery procedure for the selected computer node via a source routing mechanism based on source routing information of the selected node previously detected, said discovery procedure comprising broadcasting a neighbor discovery request from a computer node currently selected on a shared transmission medium of the network and receiving at the computer node currently selected replies sent by neighbor computer nodes on the shared transmission medium; (c) receiving at the source computer node the selected replies sent by neighbor computer nodes to the computer node currently selected; (d) adding said replying neighbor computer nodes to the group of computer nodes to be processed; and (e) iteratively changing the selected computer node by repeating steps (a) through (d) for other computer nodes in the group of computer nodes to be processed, until all computer nodes of the set are discovered.

Metadata:
- Claim Count in Document: 40.0
- Percentile: 88.0
- Lexical Diversity: 2.38462
- Patent Class: 370.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: True
- Related Applications: ['11695879', '10795818', '10452708', '12689626', '12150500']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5276419129822622
- 35 USC 102 Novelty (BERT): 0.4848447780223594
- Combined Prediction Score: 0.5233621994862719
- Mean Citation Score: 178.387644
- Max Citation Score: 191.20854
- Similarity Product: 131.19982811032534

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