US 11,750,499 B1
Resilient path(s) of non-obligatory nodes of a network
Rajesh Kumar Saxena, Thane East (IN); Harish Bharti, Pune (IN); Anupam Gupta, Noida (IN); and Sandeep Sukhija, Rajasthan (IN)
Assigned to International Business Machines Corporation, Armonk, NY (US)
Filed by International Business Machines Corporation, Armonk, NY (US)
Filed on Aug. 9, 2022, as Appl. No. 17/884,003.
Int. Cl. H04L 45/12 (2022.01); G16Y 40/30 (2020.01); G16Y 10/75 (2020.01)
CPC H04L 45/12 (2013.01) [G16Y 10/75 (2020.01); G16Y 40/30 (2020.01)] 20 Claims
OG exemplary drawing
 
1. A computer-implemented method, comprising:
defining a micro-operative of a first network, the first network having non-obligatory nodes, wherein the micro-operative includes rankings assigned to each of the nodes of the first network;
establishing activated core covalences (ACCs) for the nodes, wherein each ACC defines a minimum number of neighboring nodes of the node associated with the ACC that, upon the minimum number of neighboring nodes being disconnected from the first network, cause the ranking of the associated node to decrease;
establishing an aggregated activated core covalence (A-ACC), wherein the A-ACC corresponds to a sum of at least some of the ACCs of the nodes; and
determining, based on the A-ACC, whether to perform a communication operation using a path that includes the nodes in the first network.