Systems and methods for network resiliency
A method comprising defining a model that represents a communication network, wherein defining the model comprises: formulating a directed graph comprising nodes that represent communication data sources, communication data sinks, and communication data routers of at least a portion of the communication network and arcs connecting nodes that represent communication links between the communication data sources, communication data sinks, and communication data routers, defining a plurality of layers, each layer associated with a different set of communication priorities and comprising a replication of the directed graph, and assigning data communication attributes to the nodes and arcs of each layer, at least a portion of the data communication attributes being associated with different communication priorities; and determining an optimized set of communication flows through the model based on a minimization of communication cost.
1 . A method comprising:
defining a model that represents a communication network, wherein defining the model comprises:
formulating a directed graph comprising nodes that represent communication data sources, communication data sinks, and communication data routers of at least a portion of the communication network and arcs connecting nodes that represent communication links between the communication data sources, communication data sinks, and communication data routers,
defining a plurality of layers, each layer associated with a different set of communication priorities and comprising a replication of the directed graph, and
assigning data communication attributes to the nodes and arcs of each layer, at least a portion of the data communication attributes being associated with different communication priorities;
determining an optimized set of communication flows through the model based on a minimization of communication cost;
transmitting the optimized set of communication flows as a set of recommendations to the communication network;
converting, via the communication network, the recommendations to a native format; and
re-routing, via the communication network, communication flows based on the recommendations converted to the native format.
2 . The method of claim 1 , comprising modifying routing of communication through the network based on the determined optimized set of communication flows through the model.
3 . The method of claim 1 , wherein the attributes of a node comprise at least one of a supply of and a demand for communication data.
4 . The method of claim 1 , wherein at least one node is a source and a sink.
5 . The method of claim 1 , wherein there is no communication flow between the layers.
6 . The method of claim 1 , wherein the model comprises limits for communication flows through the nodes of the network and the optimized set of communication flows comprises, for each node, a total communication flow across the layers that does not exceed the limit for the respective node.
7 . The method of claim 1 , wherein the communication cost is a function of a cost penalty associated with a shortfall in meeting a source or supply demand.
8 . The method of claim 1 , wherein the communication cost is a function of a cost to traverse an arc.
9 . The method of claim 1 , wherein determining an optimized set of communication flows comprises determining a total number of data units traversing each arc of each layer.
10 . The method of claim 1 , wherein determining the optimized set of communication flows comprises simulating an attack on the network by increasing a cost for traversing and/or a reduction in the capacity of at least one arc.
11 . The method of claim 10 , wherein determining the optimized set of communication flows comprises simulating a defense of the network by restricting at least one arc from being attacked.
12 . The method of claim 1 , wherein determining the optimized set of communication flows comprises emulating one or more of an attack or a defense of one or more of the nodes by manipulation of one or more of traversal cost or maximum capacity of one or more the arcs.
13 . The method of claim 1 , wherein the optimized set of communication flows is further based on a defender-attacker-defender optimization scenario.
14 . A computing system comprising one or more processors, memory, and one or more programs stored in the memory for execution by the one or more processors for causing the computing system to perform a method that comprises:
defining a model that represents a communication network, wherein defining the model comprises:
formulating a directed graph comprising nodes that represent communication data sources, communication data sinks, and communication data routers of at least a portion of the communication network and arcs connecting nodes that represent communication links between the communication data sources, communication data sinks, and communication data routers,
defining a plurality of layers, each layer associated with a different set of communication priorities and comprising a replication of the directed graph, and assigning data communication attributes to the nodes and arcs of each layer, at least a portion of the data communication attributes being associated with different communication priorities;
determining an optimized set of communication flows through the model based on a minimization of communication cost;
transmitting the optimized set of communication flows as a set of recommendations to the communication network;
converting, via the communication network, the recommendations to a native format; and
re-routing, via the communication network, communication flows based on the recommendations converted to the native format.
15 . The system of claim 14 , comprising modifying routing of communication through the network based on the determined optimized set of communication flows through the model.
16 . The system of claim 14 , wherein the attributes of a node comprise at least one of a supply of and a demand for communication data.
17 . The system of claim 14 , wherein at least one node is a source and a sink.
18 . The system of claim 14 , wherein there is no communication flow between the layers.
19 . The system of claim 14 , wherein the model comprises limits for communication flows through the nodes of the network and the optimized set of communication flows comprises, for each node, a total communication flow across the layers that does not exceed the limit for the respective node.
20 . The system of claim 14 , wherein the communication cost is a function of a cost penalty associated with a shortfall in meeting a source or supply demand.
21 . The system of claim 14 , wherein the communication cost is a function of a cost to traverse an arc.
22 . The system of claim 14 , wherein determining an optimized set of communication flows comprises determining a total number of data units traversing each arc of each layer.
23 . The system of claim 14 , wherein determining the optimized set of communication flows comprises simulating an attack on the network by increasing a cost for traversing and/or a reduction in the capacity of at least one arc.
24 . The system of claim 23 , wherein determining the optimized set of communication flows comprises simulating a defense of the network by restricting at least one arc from being attacked.
25 . A non-transitory computer readable medium storing one or more programs for execution by one or more processors of a computing system to cause the computing system to perform a method that comprises:
defining a model that represents a communication network, wherein defining the model comprises:
formulating a directed graph comprising nodes that represent communication data sources, communication data sinks, and communication data routers of at least a portion of the communication network and arcs connecting nodes that represent communication links between the communication data sources, communication data sinks, and communication data routers,
defining a plurality of layers, each layer associated with a different set of communication priorities and comprising a replication of the directed graph, and assigning data communication attributes to the nodes and arcs of each layer, at least a portion of the data communication attributes being associated with different communication priorities; and
determining an optimized set of communication flows through the model based on a minimization of communication cost;
transmitting the optimized set of communication flows as a set of recommendations to the communication network;
converting, via the communication network, the recommendations to a native format; and
re-routing, via the communication network, communication flows based on the recommendations converted to the native format.
26 . The system of claim 14 , further comprising a management module, wherein the management module is configured to define the model and determine the optimized set of communication flows.
27 . The system of claim 26 , wherein the computing system is further configured to perform a method that comprises:
in response to the communication network being split into two or more smaller disjoint networks, splitting the management module into corresponding two or more management modules for the two or more smaller disjoint networks.