A Framework for Reliability Computation of the IP Network

Cubo (Temuco), 2010

Performance in terms of reliability of computer networks motivates this paper. Limit theorems on the queue length and virtual waiting time in open queueing networks in heavy traffic are derived and applied to a reliability model for computer networks where we relate the time of failure of a computer network to the system parameters.

Many complex physical, technological, social, biological and economical systems can be represented in the form of networks, where vertices are the entities of the system and the edges represent the relational links among the entities. Since complex networks display a high degree of tolerance to random failures, errors and attacks, network dependability has always been a challenging task in system reliability analysis. In the literature, network reliability is intended as the probability that two specific nodes (a source node and a destination node) are connected given the probability of the elements of the network (nodes, edges or both) of being up or down. A number of techniques have been developed to tackle this problem. However, in recent year, with the appearance of networks of giant dimensions (e.g. the internet and www) the exhaustive searching techniques are no more appropriate. A completely new field of research has emerged to study the statistical properties of these huge n...

Due to mass spread of distributed computer systems, the assessment analysis of such systems reliability is necessary. In this paper, an attempt to analyze the system consisting of two nodes (the source and the receiver) and a set of intermediate members, is made. The system is considered to be functional, when there is a connection between two elements. One of the primary goals is to define which elements of the system can be considered as perfectly reliable.

2013 5th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2013

Confronted to the increasing dynamic of Internet routing system and its underlying topology, we propose a reliability and availability analysis method based on the characterization of the dynamic properties (in particular, the stability properties) of routing paths and their corresponding forwarding paths. The key driver underlying this method is that transient but frequent changes in the spatio-temporal properties of routing paths can affect the performance and operating conditions of the corresponding forwarding paths; hence, their reliability. The results obtained by means of this method verify that, although the main cause of instability results from the forwarding plane dynamics, a second order effect relates forwarding and routing path instability events. Applying our analysis method reveals that the dominant source (main cause) of instability originates indeed from the forwarding plane. This result which confirms previous studies from 2003 further corroborates the assumption that the dynamic properties of routing system are mainly driven by its adaptation to the forwarding system (adaptive routing). However, even if the likelihood of forwarding instability becomes the prominent behavior (cause), about 50% of them induce routing path instability whereas the corresponding forwarding path remains unstable. This observation suggests that 50% of the reactive decisions performed by the BGP routing system (reactive routing) tend to further delay convergence of the forwarding paths. In turn, this observation provides the first indication that simple causal effects can't explain anymore the occurrence of instability. Moreover, more elaborated analysis techniques (such as the one proposed in this paper) are required to explain the inter-dependent routing and forwarding paths dynamics which affects their reliability and availability.

Mathematics in Computer Science, 2018

The study of network reliability started in 1956 with a groundbreaking paper by E.F. Moore and C.E. Shannon. They introduced a probabilistic model of network reliability, where the nodes of the network were considered to be perfectly reliable, and the links or edges could fail independently with a certain probability. The problem is to determine the probability that the network remains connected under these conditions. If all the edges have the same probability of failing, this leads to the so-called reliability polynomial of the network. Sixty years later, a lot of research has accumulated on this topic, and many variants of the original problem have been investigated. We review the basic concepts and results, as well as some recent developments in this area, and we outline some important research directions.

2013

The determination of the reliability value for technical systems whose components are subjected to random failure is known as an NP-hard problem. Hence, efforts to conceive efficient solutions on restricted classes of networks have been pursued since the 1960s. In this thesis, substantial contributions are made to improve the current state-of-the-art in exact terminal reliability. Moreover, the proposed model extensions additionally allow for considering dependent component failures.

Information Sciences, 1992

Reliability of a network is usually expressed in terms of connectivity of the underlying graph. Another approach is to take a probabilistic model for the failure of the different nodes. In this paper we propose a method for evaluating this reliability when links are fault-free. Lastly, we have found analytical expressions for reliability of some common networks.

2010

In this paper we propose an approach fundamental keys factor to impact directly causing Reliability aspect, with provides an analysis, evaluation, and management of the reliability of systems in wide as the heterogeneity of devices and the complexity of interconnection network. The aspect of Availability, Performance and Security have an important role in creating aspect to make High Reliability and that its can be still need improvement, especially in the Internet Services system with many devices and applications systems. With this description and analysis of expected service providers or companies that use IT as a primary strategies can make this as a framework in making the rules and policy. In this paper we presented measurement influencing factors for make high Reliability especially of internet services. This factors not be separated, is must combine to integrated systems

Journal of Industrial and Production Engineering, 2015

In a network flow, transit time of an arc is the time span that a unit of flow takes to travel through this arc. In most real-world systems, such as road traffic, communication networks, pipeline systems, transit time of an arc is not constant and may take a value, randomly, from among several possible values. In such systems, reliability is the main concern. Given a demand d, time threshold T, and budget B, we define the reliability as the probability that d units of flow can be sent from the source to the sink under time horizon T and budget B. In this paper, we propose a simple algorithm to evaluate the reliability of networks in which the transition times are stochastic variable.

Mathematics

Network reliability is one of the most important concepts in this modern era. Reliability characteristics, component significance measures, such as the Birnbaum importance measure, critical importance measure, the risk growth factor and average risk growth factor, and network reliability stability of the communication network system have been discussed in this paper to identify the critical components in the network, and also to quantify the impact of component failures. The study also proposes an efficient algorithm to compute the reliability indices of the network. The authors explore how the universal generating function can work to solve the problems related to the network using the exponentially distributed failure rate. To illustrate the proposed algorithm, a numerical example has been taken.