Invention Grant
- Patent Title: Resilient path(s) of non-obligatory nodes of a network
-
Application No.: US17884003Application Date: 2022-08-09
-
Publication No.: US11750499B1Publication Date: 2023-09-05
- Inventor: Rajesh Kumar Saxena , Harish Bharti , Anupam Gupta , Sandeep Sukhija
- Applicant: International Business Machines Corporation
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Zilka-Kotab, P.C.
- Main IPC: H04L45/12
- IPC: H04L45/12 ; G16Y40/30 ; G16Y10/75

Abstract:
A computer-implemented method according to one embodiment includes defining a micro-operative of a first network. The first network has non-obligatory nodes, and the micro-operative includes rankings assigned to each of the nodes of the first network. Activated core covalences (ACCs) are established for the nodes. 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. An aggregated activated core covalence (A-ACC) is established, and the A-ACC corresponds to a sum of at least some of the ACCs of the nodes. The method further includes determining, based on the A-ACC, whether to perform a communication operation using a path that includes the nodes in the first network.
Information query