Interconnection Network Reliability Evaluation. Neeraj Kumar Goyal
Чтение книги онлайн.
Читать онлайн книгу Interconnection Network Reliability Evaluation - Neeraj Kumar Goyal страница 7
Название: Interconnection Network Reliability Evaluation
Автор: Neeraj Kumar Goyal
Издательство: John Wiley & Sons Limited
Жанр: Программы
isbn: 9781119620594
isbn:
The computation of reliability measures [4] for a large and complex communication network, up to the desired level of accuracy, is time consuming, complex and costly. It has not been realistic to model and compute the reliability of real-life communication networks, which are quite large, using desktop computer due to large execution time and high memory requirements. Such computations are usually performed on high-end processors for critical systems only. Reliability professionals and researchers have carried out a lot of research and developed techniques to minimize these efforts and develop a practical tool for all the communication network designers [4–6].
This book presents novel and efficient tools, techniques and approaches for reliability evaluation, reliability analysis, and design of reliable communication networks using graph theoretic concepts.
1.2 Network Reliability Measures
Earlier attempts to measure network reliability belong to two distinct classes: deterministic and probabilistic [1, 2]. The deterministic measures assumed that the network is subjected to a destructive force with complete knowledge of the network topology. The reliability is measured in terms of the least amount of damage required to make the network inoperative.
Deterministic measures thus provide simple bounds on the reliability of the network, since they are often measured for the network’s worst-case environment. For example, in the terminal pair reliability problem, two deterministic measures of reliability are:
1 The minimum number of edges that must be destroyed or removed to disrupt the communication between the specified nodes (s and t), which is simply the number of edges in a minimum cardinality cutset, and
2 The minimum number of nodes that must be destroyed or removed to disrupt the communication between the specified nodes (s and t).
Both of these measures are computable in polynomial time. However, one of the main problems with deterministic measures is these give rise to some counter intuitive notions of network reliability. For example, consider the networks shown in Figure 1.1. According to second deterministic measure of the graph’s reliability, the graphs of Figure 1.1 (a) and Figure 1.1 (b) are equally reliable since both of these require minimum three nodes to be destroyed for breaking the s-f node connectivity.
Figure 1.1 Example networks for deterministic reliability measurement.
However intuitively one can easily find out that graph (a) is the more reliable among the two. The same problem arises when the cardinality of a minimum (s, t)-cut set is used as a measure of unreliability. Consider the graphs shown in Figure 1.2. Both graphs (a) and (b) have a minimum cardinality for (s, t) cut of size one, which implies both networks are equally reliable.
This clearly shows that deterministic measures of reliability are insufficient to correctly relate network components used in network layout with network reliability. Moreover, failure of network components is probabilistic in nature therefore only probabilistic measures can define system reliability appropriately.
Figure 1.2 Another set of example networks for deterministic reliability measurement.
Therefore, for evaluating reliability of a network using probabilistic measures, one can associate a statistical probability of failure/ success with each component of the network in order to obtain a statistical measure of overall unreliability/reliability of the network. This notion supports an accepted definition of reliability as the probability that a system or device is operational under stated environment for a given mission time. To avoid conflicts that arise with various levels of operation within a network’s hierarchy, only the topology of the network is considered. This allows a network to be modeled by a graph where the nodes of the graph represent the communication centers and communication links are represented by its edges.
1.3 The Probabilistic Graph Model
Communication networks are generally modeled using network graph [3]. The network graph G (V,E) consists of a set V of n number of nodes (or vertices) and a set E of l number of edges (or links). For reliability evaluation, probabilistic graph is used which takes these sets V and E of nodes and links as random variables. In probabilistic graph of communication networks, nodes represent the computers/ switches/transceivers/routers and edges represent various types of communication links connecting these nodes. For reliability analysis, graphical models of networks are considered to be simple, efficient and effective.
Probabilistic graph models are developed and presented in this book. Depending on the state (working or failed) of nodes (or vertices) and/or links (or edges), the network can be considered either working or failed. A general assumption of statistical independence among nodes and links failures is followed throughout. It implies that the probability of a link or node being operational is not dependent of the states of the other links or nodes in the network. The inherent assumption here is that the link failures are caused by random events which affect all network components individually.
However, this assumption may not be completely correct while modeling a real communication network as more than one component in a particular area may fail due to natural causes such as a major storm or an earthquake. In such cases, dependency analysis and common cause failure modelling can be used over the analysis performed with assumption of statistical independence. This assumption is often made because of difficulties in obtaining information about the dependencies of link failures and increased modeling and computational rigor. In fact, such dependencies may not be known. Thus, without the assumption of statistical independence the problem becomes much more difficult to solve.
Depending on the connectivity objective of nodes [4–6], the network reliability evaluation problem can be sub-divided into following different cases:
1 Two terminal or terminal pair reliability (TPR) problems: The most common communication operation is to send messages from a source node s to a terminal node t. The terminal pair reliability of a network is defined as the probability of having at least one operational path between the nodes s and t. In case of directed networks, it is usually called (s,t) connectedness.
2 Global or all terminal reliability (ATR) problems: The all terminal reliability of a network is defined as the probability that for every node pair (Ni,Nj) there exist an operational path to connect them; or equivalently, the probability that there exist a working spanning tree. In the directed case, all terminal reliability is the probability that the directed graph contains at least a spanning tree rooted at the source node s.
3 K-terminal reliability (KTR) problems: The k-terminal reliability ensures that a specified set of k-nodes of the network are able to communicate with each other and it is defined as the probability that a path exists between every pair of nodes belonging to the specified set of k nodes of the network.
Generally, communication network performance is defined not only by the connectivity between nodes but also by the minimum capacity it can transfer between the nodes. The reliability measure considering both capacity and connectivity, as essential performance criterion, is known as capacity СКАЧАТЬ