US 11,855,911 B2
Intent-based orchestration using network parsimony trees
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); and Bryan Dreyer, Bellevue, WA (US)
Assigned to Level 3 Communications, LLC, Broomfield, CO (US)
Filed by Level 3 Communications, LLC, Broomfield, CO (US)
Filed on Apr. 21, 2023, as Appl. No. 18/137,791.
Application 18/137,791 is a continuation of application No. 17/990,363, filed on Nov. 18, 2022, granted, now 11,637,790.
Application 17/990,363 is a continuation of application No. 17/747,041, filed on May 18, 2022, granted, now 11,509,601, issued on Nov. 22, 2022.
Application 17/747,041 is a continuation of application No. 17/176,066, filed on Feb. 15, 2021, granted, now 11,343,201, issued on May 24, 2022.
Claims priority of provisional application 63/067,597, filed on Aug. 19, 2020.
Claims priority of provisional application 62/981,308, filed on Feb. 25, 2020.
Prior Publication US 2023/0269198 A1, Aug. 24, 2023
This patent is subject to a terminal disclaimer.
Int. Cl. H04L 41/0816 (2022.01); H04L 41/5009 (2022.01); H04L 41/5019 (2022.01); H04L 47/762 (2022.01); H04L 47/70 (2022.01); H04L 43/045 (2022.01); G06N 3/04 (2023.01); G06T 11/20 (2006.01); G06F 16/22 (2019.01); G06F 16/51 (2019.01); G06T 11/00 (2006.01); H04L 41/14 (2022.01); H04L 41/5054 (2022.01); H04L 67/51 (2022.01)
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)] 19 Claims
OG exemplary drawing
 
1. A method, comprising:
receiving, with a computing system, a request for network services from a user device associated with a customer, the request for network services comprising one of: desired characteristics and performance parameters for the requested network services;
in response to receiving the request for network services, generating, with the computing system, a first request-based parsimony tree based at least in part on the desired characteristics or performance parameters contained in the request for network services;
accessing, with the computing system and from a datastore, a plurality of first network-based parsimony trees, each of the plurality of first network-based parsimony trees being generated based on measured network metrics;
comparing, with the computing system, the first request-based parsimony tree with one or more first network-based parsimony trees among the plurality of first network-based parsimony trees to determine a fitness score for each first network-based parsimony tree, each fitness score being a value indicative of a level of heuristic matching between the first request-based parsimony tree with one of the one or more first network-based parsimony trees;
identifying, with the computing system, a best-fit network-based parsimony tree among the one or more first network-based parsimony trees based on the fitness scores of the one or more first network-based parsimony trees;
identifying, with the computing system, one or more first network resources among a first plurality of network resources for providing the requested network services, based at least in part on network resources represented within the identified best-fit network-based parsimony tree; and
allocating, with the computing system, at least one first network resource among the identified one or more first network resources for providing the requested network services.