The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Nov. 12, 2024

Filed:

Dec. 21, 2023
Applicant:

Level 3 Communications, Llc, Broomfield, CO (US);

Inventors:

Kevin M. McBride, Lone Tree, CO (US);

Brett E. Dwyer, Clermont, FL (US);

James E. Sutherland, Vancouver, WA (US);

Jamie Lin, Clayton, MO (US);

Brent Smith, Arvada, CO (US);

Glenn B. Balanoff, Arvada, CO (US);

Frank Moss, Chesterfield, MO (US);

Bryan Dreyer, Bellevue, WA (US);

Assignee:

Level 3 Communications, LLC, Denver, CO (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
H04L 47/70 (2022.01); G06F 16/22 (2019.01); G06F 16/51 (2019.01); G06N 3/04 (2023.01); G06T 11/00 (2006.01); G06T 11/20 (2006.01); H04L 41/0816 (2022.01); H04L 41/14 (2022.01); H04L 41/5009 (2022.01); H04L 41/5019 (2022.01); H04L 41/5054 (2022.01); H04L 43/045 (2022.01); H04L 47/762 (2022.01); H04L 67/51 (2022.01);
U.S. Cl.
CPC ...
H04L 47/82 (2013.01); G06F 16/2246 (2019.01); G06F 16/51 (2019.01); G06N 3/04 (2013.01); G06T 11/001 (2013.01); G06T 11/206 (2013.01); H04L 41/0816 (2013.01); H04L 41/14 (2013.01); H04L 41/5009 (2013.01); H04L 41/5019 (2013.01); H04L 41/5054 (2013.01); H04L 43/045 (2013.01); H04L 47/762 (2013.01); H04L 67/51 (2022.05);
Abstract

Novel tools and techniques are provided for implementing intent-based orchestration using network parsimony trees. In various embodiments, in response to receiving a request for network services that comprises desired characteristics and performance parameters for the requested network services without information regarding specific hardware, hardware type, location, or network, a computing system might generate a request-based parsimony tree based on the desired characteristics and performance parameters. The computing system might access, from a datastore, a plurality of network-based parsimony trees that are each generated based on measured network metrics, might compare the request-based parsimony tree with each of one or more network-based parsimony trees to determine a fitness score for each network-based parsimony tree, and might identify a best-fit network-based parsimony tree based on the fitness scores. The computing system might identify and might allocate network resources based on the identified best-fit network-based parsimony tree, for providing the requested network services.


Find Patent Forward Citations

Loading…