| CPC H04J 3/0658 (2013.01) [H04L 7/0029 (2013.01)] | 20 Claims |

|
1. A method comprising:
accessing a network graph:
representing a set of transceiver nodes; and
comprising a set of transceiver-transceiver edges, each transceiver-transceiver edge associated with a transceiver-transceiver edge value, in a set of transceiver-transceiver edge values, representing a first metric characterizing a first communication link between a pair of transceivers represented by a pair of transceiver nodes in the set of transceiver nodes;
identifying a first subgraph of the network graph:
representing a first transceiver node in the set of transceiver nodes;
a second transceiver node in the set of transceiver nodes; and
comprising a first transceiver-transceiver edge, in the set of transceiver-transceiver edges, connecting the first transceiver node to the second transceiver node;
accessing, in the network graph, a first transceiver-transceiver edge value, in the set of transceiver-transceiver edge values, associated with the first transceiver-transceiver edge;
based on the first transceiver-transceiver edge value, calculating a first probability of failure of a first transceiver represented by the first transceiver node; and
in response to the first probability exceeding a threshold likelihood, triggering a corrective action at the first transceiver.
|