Data Simulation and Networking

Transcription

1 IST Project N Integrated Project IRRIIS Integrated Risk Reduction of Information-based Infrastructure Systems Deliverable D Provision of Prototype Leontief-Based Tool Due date of deliverable: January 30, 2008 Actual submission date: March 10, 2008 Version 1.0 Organisation name of lead contractor for this deliverable: ENEA Dissemination Level PU Public Start date of project: 01 February 2006 Duration: 3 years Project co-funded by the European Commission within the Sixth Framework Programme ( )

2 Editor(s) E. Djambazova (ENEA) Author(s) E. Djambazova (ENEA), V Rosato (ENEA), G. Vicoli (ENEA) Contributor(s) Work package Task(s) WP 2.2 : LCCI Interdependency Analysis Task 2.2.2: Tools and techniques for interdependency analysis D Provision of Prototype Leontief-Based Tool 2

3 Contents CONTENTS...3 FIGURES THE NETWORK ANALYSIS TOOLS (NAT) PLATFORM NAT Database Net Builder Types of Complex Networks Usage Unweighted Networks Topology analysis of unweighted networks Topological properties of a graph Usage Weighted Networks Topological properties of a weighted graph Usage The Simulator Communication Networks Traffic Simulator Description of the elements of the Traffic Simulator Usage Interdependency Leontief-Based Simulator INTRODUCTION TO THE LEONTIEF-BASED MODEL The Leontief economic model Adapting the Leontief model to critical infrastructures The Leontief-based simulation tool: the algorithm Inoperability dynamics of interdependent networks The system The simulation Optimisation INTRODUCTION TO THE LEONTIEF-BASED SIMULATION (LBS) TOOL Home page Creating an account to the tool Downloading documentation User login to the Leontief-based tool Managing a Leontief account Executing the algorithm Creation of a network Downloading the network D Provision of Prototype Leontief-Based Tool 3

4 3.5.4 Uploading the network Starting the execution Stopping the execution REFERENCES...22 APPENDIX A...24 D Provision of Prototype Leontief-Based Tool 4

5 Figures Figure 1. A node and its input and output...14 Figure 2. Results of the inoperability dynamics for a system of 5 nodes subject to disturbance..17 Figure 3. Output of LBS for a system of 5 networks in the first mode of presentation...19 Figure 4. Output of LBS for a system of 5 networks in the second mode of presentation Figure 5. Organization of the Home page...20 Figure 6. Management of the network...21 D Provision of Prototype Leontief-Based Tool 5

6 1. The Network Analysis Tools (NAT) Platform The Network Analysis Tools (NAT) [NAT] is a platform for the analysis of topological parameters of a graph. It has been conceived and realized to apply ideas and methods of the Complexity Science in the area of the analysis of Large Complex Critical Infrastructures (LCCI). The NAT platform can be accessed at: Each LCCI can be ultimately represented by a network containing the logical position of its different constitutive elements, connected through (logical or physical) links. Networks can be subsequently mapped onto graphs which constitute the ultimate, and more abstract, layout of a technological infrastructure, where only the mathematical structure of its constitutive elements and their connections are kept. Graphs can, thus, be analyzed by methods typical for the Graphs Theory. The goal is to estimate relevant network properties from the analysis of the associated graph and, thus, to gain insights on the effective properties of the "real" technological network represented by the graph. There are two other functionalities that have been added to the NAT platform. The first one considers the possibility of simulating a specific graph as representing a communication network. A simplified version of a data traffic simulator has been introduced in order to allow the user to simulate the efficiency of a given network in processing the data flow among the nodes. The second functionality deals with the simulation of the effects which networks interdependency introduces into infrastructures behaviour. As technological infrastructures are mutually dependent, a linear Leontief model for evaluating the effects on network operability induced by the presence of an "interdependency matrix" has been provided. This matrix quantifies the extent of perturbation that a network produces on the others when its operability is reduced. The NAT platform contains different tools to solve different problems associated with the analysis of LCCIs: A Database containing the graphs of several LCCIs A graph generator (Net Builder) A topological analysis of unweighted graphs A topological analysis of weighted graphs A simplified simulator of a communication network An interdependency simulator (based on the Leontief model) Since the analyses and simulation of the networks usually take time, the tool does an off-line analysis. The requested results are then sent to the user by . The NAT interface with the user is organized as follows: 1. The user uploads a network descriptor file. For the Net Builder that step is not necessary. 2. The user enters an address, where the NAT results will be sent. 3. He/she selects the parameters and all initial information needed to perform: generation of a network, analysis of different types of networks or simulation of a network. 4. The user is then prompted to enter a name for the current run. 5. At the end he/she launches the analysis or resets all values. The NAT platform has a good help support to the user for all types of analysis. D Provision of Prototype Leontief-Based Tool 6

7 1.1 NAT Database The NAT Database offers a variety of network descriptor files (.ndf format) and the results from the performed analysis (.zip format). The.ndf format ( NDF'' stands for Extensible N-Dimensional Data Format) is a standard file format for storing data which represent N-dimensional arrays of numbers, such as spectra, images, etc. and it, therefore, forms the basis of many spectral and image-processing applications [Starlink]. The descriptor files available are: DIMES (World-wide graph of the Internet network at the level of AS-level routers) German Motorways Italian Motorways Italian Electricity Transmission Network The results from the analysis of the respective network are available in ZIP format. The results are represented in graphical (JPG files) and numerical (text files with the data) form. They display the following parameters: node betweenness distribution, node clustering coefficient, degree distribution, input aisee, K-pruning, shortest path lengths distribution, and for some networks also graph spectrum of the adjacency matrix and information centrality. 1.2 Net Builder Types of Complex Networks The Networks Builder tool of the NAT suite enables the user to generate different kinds of complex networks, distinguished by their topological properties and, thus, generated with different growing mechanism. Networks are represented by graphs, particularly by undirected and unweighted graphs. An undirected graph is a graph, for which the relations between pairs of nodes are symmetric, so that each edge has no directional character (as opposed to a directed graph). This means that, if an edge between the nodes i and j (represented by (i, j)) exists, the reverse edge (j, i) also exists. An unweighted graph, instead, is a graph, in which all edges have no label and the same unitary weight. The network topologies created by the Networks Builder tool are the following: Random Graphs A random graph is a graph that is generated by some random process. In the NAT Networks Builder, the growing mechanism used is the Erdös-Rényi one. The growing mechanism for the creation of a random graph G=(N, L) starts with a set of N nodes with no connections. The process continues iteratively, adding new nodes at each iteration, according to an unconditional probability P. It means that the edge creation probability between two nodes, the new node i and the pre-existing node j (P(i > j)), is constant and node independent: 1 P( i j) = (1) N Scale-Free Networks Recent studies about "real networks" in several domains, such as biology, sociology, telecommunications, have shown that the homogenous nodes' degree distribution typical of random graphs is not the best way to represent these systems. Nodes' degree distribution of these systems seems to follow a Power Law function: γ ( k) k P ~ (2) D Provision of Prototype Leontief-Based Tool 7

8 where 2 < γ < 3 according to single system s peculiarities. These kinds of networks are defined as scale-free, because the Power Law is the unique functional form that remains unchanged, except for a multiplicative factor, after a scale modification. Scale-free networks are characterized by an extremely inhomogeneous nodes' degree distribution, with the presence of few nodes highly connected (known as hubs) and a lots of minimally connected ones (known as leaves). To reproduce scale-free networks the NAT Networks Builder tool uses the Barabási-Albert (BA) growing model. This model is based on two elements: the growing process and the Preferential Attachment (PA). The model is inspired by the "rich get richer" principle, in which highly connected elements have higher probability to attract new connections. Internet-Like Scale-Free Model The Barabási-Albert (BA) mechanism can reproduce most of the "real" networks but, as each network type has its own peculiarities, to reproduce the relevant properties of different networks, several modifications to the growing mechanism should be added. The Internet network, for instance, has been shown to display an "extreme" scale-free topology, with the presence of higher degree hubs, a bigger number of leaves, an extremely different clustering coefficient with respect to "normal" scale-free networks. To reproduce better the Internet topology, a new growing mechanism has been proposed. The proposed mechanism modifies the BA mechanism in two ways: 1) by varying the probability exponent of the PA mechanism; and 2) by adding a mechanism able to produce the very high clustering coefficient experienced in the Internet topology (c~ ). The first modification is taken to mimic higher degree hubs typical for the Internet and the PA mechanism has been generalized by introducing an adjustable parameter a: P ( i j) = P k j = 1 2 j k α j If a < 1 the strength of a hub to attract new links is reduced, while if a > 1 it is increased. The second modification is the insertion of a mechanism able to increase the clustering of a network. Such a mechanism is known as Triad Formation (TF). The TF mechanism applies when more than one link can be drawn for a new node. The first link of a new node is selected on the basis of the BA mechanism, while the others, instead of being chosen to stick on a randomly selected pre-existing node, are forced to be stuck to the nearest neighbour of the previously selected node. This obviously realizes the formation of triangles ( triads ). A suitable combination of BA and TF allows the reproduction of several topological properties of the Internet, as they appear from recent observations (projects DIMES and RouteViews) [Rosa08] Usage The NAT Networks Builder tool can be used via registration and authentication at the NAT Homepage. Input Data A valid address for the results: once the tool has created the network in a text file (.txt), the file is sent by to the user. Type of network: the network type that is to be created. There are three possible types of network: random graphs, scale-free networks, and Internet-like scale-free networks. Number of nodes in the network. The number of edges is defined according to the network's type and the number of nodes. D Provision of Prototype Leontief-Based Tool 8 (3)

9 The m 0 parameter: this parameter is used only in case of a scale-free (Barabási-Albert or Internetlike) network. Output Data The output data of the Networks Builder tool consist of a text file (.txt), in which the network structure is stored. The network structure is represented as follows: Each node is represented by an identification number (ID), the numbering starts from 0. Each edge is represented by a couple of nodes. In the tool, all graphs are undirected. Each edge is stored in a single line. 1.3 Unweighted Networks Topology analysis of unweighted networks As it was mentioned above, the networks can be represented by graphs and then analysed using the graphs theory. A graph can be described as a set G = G(N, L) of N nodes and L arcs (or links). A graph can be mathematically defined by its adjacency matrix A with elements a ij. The "conceptual" layout of this analysis is the following: The physical (or logical) map of the infrastructure should be transformed into a network; The network is transformed into an adjacency matrix; The adjacency matrix is elaborated to provide the estimate of the topological properties Topological properties of a graph The NAT suite enables the user to evaluate different topological properties of a user-defined graph, which can be uploaded on the tool s Web site from the user repository. The considered topological properties evaluated by the NAT platform are the following: Connectedness Verification if the graph is connected or disconnected. A graph is defined as connected if there is a path connecting each pair of nodes i and j (with i j). Graph Degree Evaluation of the degree distribution, P(k), which is the fraction of nodes in the graph displaying degree k. Graph Spectrum Evaluation of the graph spectrum, corresponding to the set of eigenvalues of its adjacency matrix A. Min Cut Evaluation of the min cut, consisting in the optimal partitioning of the graph into two connected subgraphs (of dimensions N 1 and N 2, such as N = N 1 + N 2 ) separated by k edges. Cluster Evaluation of the clustering coefficient, C, derived from the average over all nodes of the graph of the node clustering coefficient, c i. D Provision of Prototype Leontief-Based Tool 9

10 Diameter Evaluation of: (a) the distribution of the "shortest path" (or geodesic) lengths, d ij, of the graph, where d ij is the length of the geodesic from node i to j; (b) the diameter, Diam(G), which is the maximum value of d ij ; (c) the matrix, d, of the shortest path lengths. Betweenness Node Evaluation of the Node Betweenness Centrality, b i, of node i, also known as load. Betweenness Edge Evaluation of the Edge Betweenness Centrality, e il, of the edge between nodes i and l, that is determined similarly to the node betweenness. Information Centrality Evaluation of the Information Centrality, I i, of node i, which defines the importance of node i by the ability of the network to remedy the deactivation of that node. Kshell Evaluation of the k-shell decomposition of the graph. Given a graph G = G(N, K) with N nodes and K edges, a k-core (or core of order k) is defined through the subgraph H(C, K(C)) induced by the subset C of N, such that for each node n of C the degree(n) k, and H is the maximum subgraph with this property. The k-shell decomposition is the recursive removal of all nodes of degree k (or less) until all nodes of the remaining subgraph have at least degree k+1, i.e., the subgraph is a (k+1)-core. The decomposition starts with k and carries on increasing k at each step. The process stops when no further nodes remain; the last not empty k-core provides a very robust definition of the heart (or nucleus) of a graph Usage Input Data Types of analysis to be executed on the network. The user can select among: degree distribution, node betweenness centrality, graph spectrum, edge betweenness centrality, min cut, information centrality, shortest path length distribution, K-pruning, shortest path length values, clustering coefficient. The query network must be undirected, resulting in a symmetric adjacency matrix, such that for its elements: a ij = a ji. A text file (.ndf) with each line reporting a single couple of numbers, which identifies the linked nodes, is accepted. Each pair of numbers can be separated by space(s) and/or tab(s). Output Data Analysis replies can be in the form of text (.txt) and/or figure (.jpg) and all together are zipped in a file (.zip) sent by as attachment. 1.4 Weighted Networks Topological properties of a weighted graph The NAT suite enables the user to evaluate different topological properties of a user-defined weighted graph which can be uploaded on the server Web site from the user repository. The topological properties of weighted networks evaluated by the NAT platform are the following: D Provision of Prototype Leontief-Based Tool 10

11 Connectedness Verifies if the graph is connected or disconnected. A graph is defined as connected if there is a path connecting each pair of nodes i and j (with i j). Moreover, in case of a disconnected graph, the tool discovers the subgraphs whose nodes are completely connected. Degree Distribution Calculates: - the degree distribution, P(k), which is the fraction of nodes in the graph displaying degree k. The degree k i of a node i is the number of edges incident to that node. - the node weighted connectivity (or strength). Clustering Calculates the weighted clustering coefficient, C W, as the average of the local weighted clustering coefficients, c i W, of all nodes of the graph. Diameter Calculates: - the weighted shortest path lengths, d ij, of the graph, where d ij is the smallest sum of the edge lengths throughout all possible paths in the graph from node i to j. - the diameter, which is the maximum d ij, and the average of the weighted shortest paths. - the node closeness centrality, C C, which quantifies the closeness of a node i to all other nodes. Weighted Betweenness Centrality Calculates the weighted betweenness of the nodes and edges. Node Information Centrality Calculates the information centrality of the nodes. Information centrality, C I, assesses a node importance by the ability of the network to remedy the deactivation of that node. Edge Information Centrality Calculates the information centrality of the edges. Information centrality, C I, assesses an edge importance by the ability of the network to remedy the deactivation of that edge. Min Cut Evaluation of the min cut, consisting in the optimal partitioning of a graph of N nodes into two connected subgraphs of dimensions N 1 and N 2 (such that N = N 1 + N 2 ) separated by a minimum number of K edges. In the partitioning the weight of the edges is also considered Usage Input Data Types of analysis to be executed on the network. The user can select among: connectedness, betweenness centrality, degree distribution, node information centrality, clustering coefficient, edge information centrality, closeness centrality (+diameter), weighted min cut, shortest path length values. D Provision of Prototype Leontief-Based Tool 11

12 A text file (.ndf) with each line reporting a single triple of numbers is accepted. The first two numbers identify the linked nodes and the third one is corresponding to the weight of the link. The numbers of each triple must be separated by space(s) and/or tab(s). Output Data Analysis replies can be in the form of text (.txt) and/or figure (.jpg) and all together are zipped in a file (.zip) and sent by as attachment. 1.5 The Simulator Communication Networks Traffic Simulator The NAT Communication Networks Traffic Simulator tool enables the user to simulate the traffic dynamics in a packet-switched communication network. Packet-switched networks have a crucial relevance in our world; they are the backbone for all our communications and lots of critical infrastructures rely on them. The aim of this tool is to allow the study of the influence of network's structure on the traffic dynamics. Therefore, the NAT Communication Networks Traffic Simulator tool enables the simulation of the traffic dynamics on a switched network, composed by routers, lines. Packets are sent through the network. The model includes the main features of a data network: a send/receive mechanism, the routing nodes which have a static routing table, a policy to route packets of data, a buffer able to contain an unlimited number of data packets (handled by using a FIFO policy). (For further details on the model see [Rosa08]). The NAT platform has been also conceived to assess the influence of topology on the network traffic management Description of the elements of the Traffic Simulator The simulator takes as input the network topology described as an undirected unweighted graph, in which each node represents a router of the network and each edge represents a connection between two routers (link). Along that link the data can be exchanged in data units referenced to as packets. Routers are identified by an identification number (ID), i, (0 < i < (N-1)), where N is the total number of routers in the network. Links are identified by the couple of routers that they connect and each link is supposed to have an infinite bandwidth. In the simulator, the packets are identified by: creation time, origin router, destination router. Each packet is assumed to have zero size and the time needed to cross each link is supposed to be unitary. The dynamical evolution in time is presented in time steps (TS). At each TS, a router can send a packet to another router with a certain probability. A node cannot send a packet to itself. The amount of traffic present in the network is measured by the variable λ (0 < λ < 1), which measures the frequency with which a node emits a packet (or, equivalently, the fraction of nodes that, at a given TS, emits a packet). The packet is generated by a randomly chosen "emitting" node and directed to a randomly chosen "destination" node. Each router hosts a routing table (RT), where information about the next hop to reach every other router in the network is stored. The RTs present on each node are evaluated, once and forever, via the Breadth-first search algorithm. The strategy, which rules packet dispatching, is based, in fact, on the shortest path between sender and receiver: each pair of nodes (origin - destination) is associated with a routing path, which is formed by the nodes joining the minimal-distance path between the two nodes. In the present model, at a given TS, a node can send a fixed number of data packets and, in turn, can receive as many packets as needed (i.e., if more than one neighbour sent it a packet at the previous TS). In order to host multiple D Provision of Prototype Leontief-Based Tool 12

13 packets arriving simultaneously and to dispatch them at later time, each node has an infinite-size buffer, where packets are stored. When a packet arrives to a router, two cases are taken into account: If the router is the packet's destination, the packet is eliminated from the network, Otherwise, the packet is stored in the last position of the router's buffer, where it waits for being delivered. The buffer management complies with the First In - First Out (FIFO) policy: at each TS, each router picks the first packet (in order of arrival) from its queue and forwards it according to its routing table. All remaining packets get ahead in the queue. The simulation starts with an "empty" network, i.e., with no traffic and all buffers empty. In the course of simulation, buffers start filling and it takes a certain time (i.e., a certain number of simulation TS) for the emitted packets to reach the destination node. In the best possible case, the packet is re-emitted by a node the TS after its arrival to that node. However, if the buffer of that node is already filled by packets arrived at earlier time steps, the packet must remain on that node a number of TS equal to the number of packets waiting in the buffer, according to the FIFO policy Usage The NAT Communication Networks Traffic Simulator tool can be used via registration and authentication at the NAT Homepage. Input Data Simulation parameters: Insert simulation parameters, i.e., Lambda Start, Lambda Stop and Simulation Model to be applied. For a suggestion about Lambda Start and Lambda Stop values the user can refer to the tables. The suggestions are related with: Type of network utilized, Simulation model, Number of nodes in the network. The Simulation Model can be: Fixed Routing, No Power Routers Fixed Routing, High Power Routers Fixed Routing, Low Power Routers Deterministic Routing, High Power Routers Deterministic Routing, Low Power Routers Probabilistic Routing, High Power Routers Probabilistic Routing, Low Power Routers A valid address for the results. A valid Network Description File (.ndf). The initial value of θ parameter (θ min ). It defines the lower traffic level simulated. The final value of θ parameter (θ max ). It defines the maximum traffic level simulated in the run. Run identification name. Output Data Simulation replies consist of a text (results.txt), a figure (results.jpg) and a log (simulation.log) file. results.txt D Provision of Prototype Leontief-Based Tool 13

14 The file consists of a set of lines. Each line represents the results of a simulation for a fixed value of λ. results.jpg The file contains the graphical representation of results, in.jpg format. The x axis of the graph represents the value of λ, the y axis represents the mean packets arrival time <T>; both axes are in logarithmic scale. simulation.log Contains simulation logs information. In case of errors, the file reports the cause of the error, if known. 1.6 Interdependency Leontief-Based Simulator The interdependency Leontief-based simulator is an independent simulation environment that can be accessed from the NAT platform at Web address 2. Introduction to the Leontief-Based Model 2.1 The Leontief economic model The Leontief economic model as described in [HaJi01] considers the economy of a nation or region. This economy is divided into n distinct sectors or industries. Each of these sectors can be connected to any one of the other sectors. Thus, the economy can be regarded as an n nodes network. Each sector or node x k takes as an input some goods or services (x k1, x k2,, x kn ) that were produced by other sectors and, to some extent, by itself. It then produces an output (x 1k, x 2k,, x nk ), which in turn can serve as an input for other sectors or the public sector. The nodes in the system produce and consume some goods or services produced by other nodes. In addition, they can produce some output that will be consumed by the public sector. In this case, the system is called an open Leontief model, as opposed to a closed system, where all goods produced are consumed by the system s own elements. A node can also consider some additional input c k which could represent some external or system influence, not caused by other nodes (external demand). Figure 1 depicts a representation of a node within a Leontief model network. At each point in time, depending on its inputs, a node will be more or less able to produce its due output, thus, the node will be in some describable state. The aggregated production of all nodes leads to the system having a state that can be assessed depending on whether all nodes and the public sectors are provided with the goods or not. In case of perfect functionality (all nodes produce flawlessly), the system is said to be in the ground state or at equilibrium. c k x k1 x 1k x k2 x k x 2k x kn x nk Figure 1. A node and its input and output In case of a modification in the behaviour of some nodes (e.g. one node produces less than expected), the Leontief model offers a means to predict the behaviour of the system, i.e., how the change will propagate within the system and what will be the overall consequence of this change. It also helps compute which modifications are necessary for the system to return to equilibrium. D Provision of Prototype Leontief-Based Tool 14

15 2.2 Adapting the Leontief model to critical infrastructures The Leontief model can also be transferred to the problem of interdependent infrastructures. In [HaJi01], the production or consumption of a node in the economic model is replaced by its inoperability. Inoperability of a node or system means its inability to provide the expected good or service in the expected quality. The second measure is the dependency between nodes. Each pair of nodes can be described in terms of how strong the dependence of one on another is. The dependence relation can also be bidirectional. In this case, we say that the nodes or subsystems are interdependent. The input of a node is the inoperability of all nodes it depends on and its output is its own inoperability, which will influence the nodes that depend on it. Thus, at each point in time, a node is characterised by its inoperability value and the list and values of its dependencies upon other nodes. Dependency values can be assumed constant, while inoperability varies over time. The dynamics model In order to observe how a critical infrastructure system evolves over time, the inoperability values for the nodes are calculated and updated at each time period. At the beginning all values are set to 0 (all system components are operable). If we denote the inoperability of node x k also with x k, f k is a failure that can occur at time t, e.g. due to machine failure, natural catastrophe or external attack, then at each time t+1, the update equation for x k is: k n ( ( fk () t + = dk i xi () t ) x ( t + 1) = min 1, (4) i 1, where d k,i expresses the dependency of node x k upon node x i. The min operator guarantees that a node or subsystem can not fail more than 100%. This is the simplest version implemented. Under normal circumstances f k = 0. The basic Leontief economic model offers a basis for studying the interconnectedness and interdependencies within complex infrastructures. If a change occurs in the system, then the Leontief model helps to calculate which state the system will end up in. Setting the due values in the new state and solving the system brings out which values are necessary to get the system back to equilibrium. Moreover, one can determine how network s behaviour upon fault propagates within the system over time. With this knowledge one can develop the mitigation strategies necessary for the system to recover. The principle of Leontief model can be enhanced by using a hierarchical model of the complex infrastructures. This permits to decompose and aggregate the system where necessary. Although the Leontief model presents several advantages, it also has some limitations. One of the major disadvantages is the assumption that all dependency values among the network components are known in advance. Determining how one component depends exactly upon another can be a difficult task. Therefore, diverging models have also been considered, that can be used in combination with the Leontief model. There are studies [Seto07] that propose methodologies to assess the interdependency among critical infrastructures. In [Seto07], an Input-Output Inoperability Model, based on the Leontief model, is presented to analyze how the presence of dependencies and interdependencies among different sectors of the society may facilitate the spreading of degradation. Using sector specific questionnaires the approach acquires data from domain experts that assess the impact on the respective infrastructure of a malfunction of other infrastructures. The estimates of the experts are graded according to the level of influence their infrastructures take from the others. The estimates D Provision of Prototype Leontief-Based Tool 15

16 are done in five different time slots, using the time of the event as a reference point. The time evolution of some Leontief matrix entries, the degree of dependency of one infrastructure on the other (dependency index), and the influence that an infrastructure has on the other (influence gain) is shown. 2.3 The Leontief-based simulation tool: the algorithm Inoperability dynamics of interdependent networks The Leontief-Based Simulation (LBS) tool simulates a system composed of a set of interconnected networks (a network of networks). It allows the evaluation of the impact a fault in one network has on the rest of the system in terms of networks' inoperability. The basic assumption of this approach is that each network produces some product or gives some service. The interdependency is introduced by the fact that the products/services of one network are consumed by other network/s The system The Leontief-based simulation system can be formulated as follows: Consider a system S = {1,, n} consisting of n interdependent subsystems. Each subsystem is also called a node of S. If node i sends a product or gives some service to node j, there is an edge from node i to node j. The edge's magnitude implies the strength of the dependency between each two nodes of the system i, j S. It is denoted as ρ ij and is assumed to be constant in time, its values range between zero and one. We denote the matrix of the dependencies as ρ and ρ ij are also referred to as the Leontief technical coefficients. It is further assumed that each of the nodes is characterized by its inoperability denoted as x i. A node i is said to be fully operable, if x i = 0, and non operable, if x i = 1. In a normal situation, i.e., when no disturbance is introduced to the system, all subsystems are assumed to be fully operable, hence x i = 0 i S. To estimate the impact of a disturbance in one or more of the nodes the following inoperability dynamics equation is introduced: (For the derivation of this equation please consult [Tron06].) x i n + ρ ij j i i (5) j= 1 ( t 1) = min 1, x ( t) + γ d ( t) where ρ is the Leontief coefficients matrix, d i (t) [0, 1] is the disturbance (fault injection) at node i and γ i is the sensibility of node i to faults The simulation Given a set S of nodes and their initial inoperability x i (t=t 0 ) the LBS tool computes the inoperability of all nodes for t > t 0 according to equation (5). The result of the computation is presented to the user in the form of 2N plots showing the disturbance applied to the nodes and node's inoperability. D Provision of Prototype Leontief-Based Tool 16

17 Figure 2. Results of the inoperability dynamics for a system of 5 nodes subject to disturbance. As an example Figure 2 presents a simulation done on a system of 5 nodes, disturbance plots are on the left-hand side, inoperability is on the right. As can be seen in Figure 2 the disturbances applied to the nodes are not fixed in time. This is because the LBS operates as a controller, that is, in an endless loop it reads the networks state allowing to change the disturbance in real time. In other words, it is possible to introduce new disturbances and to eliminate, increase or decrease existing disturbances at any given moment of the simulation Optimisation While the first LBS dynamics feature gives the user the possibility to gain some intuition of how networks react to a disturbance coming from other networks or, in other words, how inoperability spreads over a network of networks, the second feature suggests a way to control that reaction by increasing the inoperability of a single network (system's node) artificially. As in case of a cascade in an electrical grid, a controlled increase of inoperability of one part of the system (e.g., a shut down of a line such that a whole area gets disconnected) can prevent the cascade from reaching other areas and, thus, the total damage decreases. Therefore, the goal is to increase the inoperability of a node in order to prevent the disturbance from propagating to the other nodes, thus, decreasing the total inoperability. For this aim an objective function, which represents a measure of the total inoperability, should be defined and then minimized. Total inoperability is the inoperability of the network of networks, which the LBS system stands for. To implement this strategy two additional elements are introduced to the system: a sink node (denoted as node zero), representing any external demand, and nodes buffers. The buffers function as a store house of the nodes. D Provision of Prototype Leontief-Based Tool 17

18 Let node i produce for node j an amount w ij of its product. If, for reason of disturbance, node j is unable to collect the product, then node i simply puts it in its buffer to be used once node j is again operable. If now for some reason node i has a reduction in its operability that is a decrease in its production, it can compensate this decrease taking what is stored in the buffer. This behaviour of the buffers can be described as: b i ( t + ) = b () t x () t + x () t i i n 1 ρ (6) j = 0 ij ij where x ij (t) is the inoperability between networks (nodes) i and j, that is the relative amount of product not delivered to j from i at time t: x ij () t W w W ij () t ij ij = (7) W ij is what should be produced and w ij (t) < W ij is the amount produced at time t. In [Tron06], the relation between system productivity and system inoperability is used to formulate the problem of minimizing the total inoperability as a Mixed Integer Linear Problem (MILP). The objective function to minimize is: h 1 n n γ t μixi, t + θi yi, t (8) t = 0 i= 1 i= 1 where y i,t = x i0 (t) denotes the inoperability of the networks (nodes) versus the external demand represented as the sink node (node zero) and μ i defines how important is to us subsystem i with respect to all others subsystems in the network; θ i defines how important is to us the output of subsystem i with respect to all other subsystem outputs; γ t defines the importance in our planning horizon h of the overall system inoperability at time t defined by expression (8). Given a network and initial inoperability settings of all nodes, the LBS tool computes new inoperability settings, so as to minimize the objective function defined above. The optimisation simulation also works as a controller. That is, in an endless loop it reads the network state and computes the new settings for node inoperabilities on a given horizon. The outputs are: node's inoperability, node's external demand inoperability, buffer values and the objective function values. The user can choose one of two modes for the visualisation of these values. In the first mode, there are four plots one for each output, as can be seen in Figure 3. The first three plots are bar plots indicating the output value of each node at a given moment of time, the forth plot is that of the objective function as a function of time. The plots are being updated as the simulation runs. D Provision of Prototype Leontief-Based Tool 18

19 Figure 3. Output of LBS for a system of 5 networks in the first mode of presentation. The second mode presents plots only for a selected number of nodes (no more than 5), where outputs are given to each node as a function of time. An additional plot is shown for the objective function, as seen in Figure 4. Figure 4. Output of LBS for a system of 5 networks in the second mode of presentation. D Provision of Prototype Leontief-Based Tool 19

20 Figure 4 shows the output of LBS for a system of 5 networks in the second mode of presentation. Each column of plots contains 5 plots representing the 5 networks of the system. The three columns from left to right are the measures of inoperability, external inoperability and buffer contents. At the bottom are the objective function values during the 50 time steps of the simulation. 3. Introduction to the Leontief-Based Simulation (LBS) Tool 3.1 Home page Login Username Password Documentation Login Create an account Download documents Create an account A.tar.gz file Name Surname Address Username Password Figure 5. Organization of the Home page The Home page of the Leontief-Based Simulation Tool is the entrance to the simulator. Its Web address is From this page the user can (Figure 5): Login to the tool, Download documentation, Create a Leontief account. 3.2 Creating an account to the tool In order to create an account, the user has to fill in some obligatory fields: name, surname, an address, username, and password. That information is necessary for the administration of the tool. 3.3 Downloading documentation The user can download the documentation of the tool in.tar.gz format. The zipped file contains a brief tutorial of how to create the input files, a technical report describing the tool and the input files used in the technical report. 3.4 User login to the Leontief-based tool The login to the LBS tool is made via user name and password. 3.5 Managing a Leontief account From the page of management (Figure 6) the user can run the Leontief algorithm selecting the maximum execution time in seconds or minutes. D Provision of Prototype Leontief-Based Tool 20

21 Number of nodes n Create a network Upload a network Download the network Run the network New network Leontief technical coefficients ρ ij Inoperability values x ij Sensibility to failure γ i Disturbance values d i Upload Number of nodes Size.dat Leontief technical coefficients Rho.dat Inoperability values Inop.dat Sensibility to failure Beta.dat Disturbance values Fail.dat Number of nodes Size.dat Leontief technical coefficients Rho.dat Diagrams Download Inoperability values Inop.dat Sensibility to failure Beta.dat Disturbance values Fail.dat Figure 6. Management of the network Before the execution the following actions can be done: creating a network with maximum 5 nodes, uploading the network giving the respective files size.dat, rho.dat, inop.dat, fail.dat, and beta.dat, or executing the network that is already created during the last user s access to the site (download the network). From this page the user can start or stop the execution Executing the algorithm If the user chose to start the execution of the Leontief algorithm, a new window opens showing the diagrams of inoperability and disturbance of the network nodes at run time. The diagrams for the five network nodes (subnetworks) are shown in two columns. The first column displays the disturbance for every node of the network as a function of time. The second column depicts nodes inoperability as a function of time. The algorithm s execution can be stopped at any time. At the end of the execution the diagrams (the plots) can be saved (downloaded) for future use and examination. They are displayed as a JPEG file. D Provision of Prototype Leontief-Based Tool 21

22 3.5.2 Creation of a network To create a new network the user can select the option Create a Network in the main menu. He/she can select up to five nodes (subnetworks) for the network. Then he/she is prompted to insert the Leontief technical coefficients, ρ ij, for the network arcs in a table. A file rho.dat is created that contains the coefficients chosen. The creation of the network continues with the insertion of the inoperability values, x ij, for the network nodes. A file inop.dat is created with the values chosen. In the next window, the values of the failure sensibility of the nodes, γ i, are inserted. A file beta.dat is created. The disturbance values, d i, for the network nodes are inserted in the next window. A file fail.dat is created. In that way, the network is created and the user can proceed with its execution Downloading the network From the main menu the user can download the network that is present in the account for future use and experimentation. The following files are downloaded: rho.dat, size.dat, beta.dat, fail.dat, and inop.dat. If the user follows the links to the files, he/she can see the values of the parameters inserted Uploading the network If the user wants to use a network that is already created during the previous access of the user to the modelling tool, he/she can upload the files rho.dat, size.dat, beta.dat, fail.dat, and inop.dat Starting the execution There are three options for the user before he/she starts the execution of the model: If no network is specified, the LBS tool starts to execute the network from the last user s access to the tool. If the user wants to create a new network, after he/she inserts the input parameters, the LBS tool executes the network just created. If the user has uploaded a network of his/her choice, then the LBS tool executes that network Stopping the execution The execution of the model can be stopped at any point. For a detailed description of the Leontief-based tool see Appendix A. 4. References [NAT] [Starlink] [Leontief] or [HaJi01] Pu Jiang and Y. Y. Haimes, Risk Management for Leontief-Based Interdependent Systems, Risk Analysis, Vol. 24, No. 5, 2004 [Seto07] R. Setola and S. De Porcellinis, A Methodology to Estimate Input-Output Inoperability Model Parameters D Provision of Prototype Leontief-Based Tool 22

23 [Tron06] E. Tronci, Methods and Instruments for Evaluation of Interdependencies among Technological Networks and Minimization of Inoperability Caused by Natural and/or Deliberate Events, Technical Report, Nov [Rosa08] V.Rosato et al., Is the topology of the Internet network really fit to sustain its function?, Physica A 387 (2008), pp D Provision of Prototype Leontief-Based Tool 23

24 Appendix A Leontief-Based Simulation Tool User s Guide 1. The Leontief-based simulation tool: the algorithm 1.1 Inoperability dynamics of interdependent networks The Leontief-Based Simulation (LBS) tool [Leontief] simulates a system composed of a set of interconnected networks (a network of networks). It allows the evaluation of the impact a fault in one network has on the rest of the system in terms of networks' inoperability. The basic assumption of this approach is that each network produces some product or gives some service. The interdependency is introduced by the fact that the products/services of one network are consumed by other network/s. 1.2 The system The LBS system can be formulated as follows: Consider a system S = {1,, n} consisting of n interdependent subsystems. Each subsystem is also called a node of S. If node i sends a product or gives some service to node j, there is an edge from node i to node j. The edge's magnitude implies the strength of the dependency between each two nodes of the system i, j S. It is denoted as ρ ij and is assumed to be constant in time, ρ ij [ 0,1]. The matrix of the dependencies is denoted as ρ and ρ ij are also referred to as the Leontief technical coefficients. It is further assumed that each of the nodes is characterized by its inoperability denoted as x i. A node i is said to be fully operable, if x i = 0, and non operable, if x i = 1. In a normal situation, i.e., when no disturbance is introduced to the system, all subsystems are assumed to be fully operable, hence x i = 0 i S. To estimate the impact of a disturbance in one or more of the nodes the following inoperability dynamics equation is introduced [Tron06]: x i n + ρ ij j i i (1) j= 1 ( t 1) = min 1, x ( t) + γ d ( t) where ρ is the Leontief coefficients matrix, d i (t) [0, 1] is the disturbance (fault injection) at node i and γ i is the sensibility of node i to faults. 1.3 The simulation Given a set S of nodes and their initial inoperability x i (t=t 0 ) the LBS tool computes the inoperability of all nodes for t > t 0 according to equation (1). The result of the computation is presented to the user in the form of 2N plots showing the disturbance applied to the nodes and node's inoperability. As an example Figure 1 presents a simulation done on a system of 5 nodes, disturbance plots are on the left-hand side, inoperability is on the right. D Provision of Prototype Leontief-Based Tool 24

25 As can be seen in Figure 1 the disturbances applied to the nodes are not fixed in time. This is because the LBS tool operates as a controller, that is, in an endless loop it reads the networks state, allowing change of the disturbance in real time. In other words, it is possible to introduce new disturbances and to eliminate, increase or decrease existing disturbances at any given moment of the simulation. 1.4 Optimisation Figure 1. Results of the inoperability dynamics for a system of 5 nodes subject to disturbance. While the first LBS dynamics feature gives the user the possibility to gain some intuition of how networks react to a disturbance coming from other networks or, in other words, how inoperability spreads over a network of networks, the second feature suggests a way to control that reaction by increasing the inoperability of a single network artificially. For example, in case of a cascade in an electrical grid, a controlled increase of inoperability of one part of the system (such as a shut down of a line to disconnect the whole area) can prevent the cascade from reaching other areas and, thus, the total damage decreases. The goal is to increase the inoperability of a node in order to prevent the disturbance from propagating to the other nodes, thus, decreasing the total inoperability. For this aim an objective function, which represents a measure of the total inoperability, should be defined and then minimized. By total inoperability we mean the inoperability of the network of networks, which the LBS system stands for. To implement this strategy two additional elements are introduced to the system: a sink node (denoted as node zero), representing any external demand, and nodes buffers. The buffers function as a store house of the nodes. The objective function to minimize is then: D Provision of Prototype Leontief-Based Tool 25