PATENT CLAIM ANALYSIS

Application Number: 15943414
Application Type: Utility
Filing Date: 2018-04
Publication Date: 2018-08
Patent Classification: ["398", "034000"]

Abstract:
A method including determining how many optical channel (OCh) paths are available for border node pair connections; determining which of the OCh paths satisfy a preselected latency threshold; and reporting the OCh paths that satisfy the preselected latency threshold to a service coordinator.

Claim (Index 13):
The method of  claim 12 , further comprising, when the number of paths is zero for each lambda plane, the following steps:\n setting, for each lambda plane, the initial topology to an original lambda plane topology; determining, for each lambda plane, the shortest path based on the shortest-path algorithm with the preselected latency threshold as a link weight to determine a shortest latency path; incrementing, for each lambda plane when a length of the shortest path is less than the preselected latency threshold, a number of paths by one; removing links on the shortest path; and repeating the determining, incrementing, and removing until the border node pair are no longer connected or the latency of the shortest path is greater than the preselected latency threshold.

Metadata:
- Claim Count in Document: 41.0
- Percentile: 91.0
- Lexical Diversity: 1.37143
- Patent Class: 398.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['15382242', '14047282', '15073416', '14862267', '13867666']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.634065395545703
- 35 USC 102 Novelty (BERT): 0.6708758952948566
- Combined Prediction Score: 0.6377464455206183
- Mean Citation Score: 276.884028
- Max Citation Score: 632.4033
- Similarity Product: 618.4093755776344

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