Reliability Assessment of a New General Matching Composed Network

The reliability of a network is an important indicator for maintaining communication and ensuring its stable operation. Therefore, the assessment of reliability in underlying interconnection networks has become an increasingly important research issue. However, at present, the reliability assessment of many interconnected networks is not yet accurate,which inevitably weakens their fault tolerance and diagnostic capabilities. To improve network reliability,researchers have proposed various methods and strategies for precise assessment. This paper introduces a novel family of interconnection networks called general matching composed networks(gMCNs), which is based on the common characteristics of network topology structure. After analyzing the topological properties of gMCNs, we establish a relationship between super connectivity and conditional diagnosability of gMCNs. Furthermore, we assess the reliability of g MCNs, and determine the conditional diagnosability of many interconnection networks.

Reliability analysis for wireless communication networks via dynamic Bayesian network

The dynamic wireless communication network is a complex network that needs to consider various influence factors including communication devices,radio propagation,network topology,and dynamic behaviors.Existing works focus on suggesting simplified reliability analysis methods for these dynamic networks.As one of the most popular modeling methodologies,the dynamic Bayesian network(DBN)is proposed.However,it is insufficient for the wireless communication network which contains temporal and non-temporal events.To this end,we present a modeling methodology for a generalized continuous time Bayesian network(CTBN)with a 2-state conditional probability table(CPT).Moreover,a comprehensive reliability analysis method for communication devices and radio propagation is suggested.The proposed methodology is verified by a reliability analysis of a real wireless communication network.

A disjoint algorithm for seismic reliability analysis of lifeline networks

The algorithm is based on constructing a disjoin kg t set of the minimal paths in a network system.In this paper, cubic notation was used to describe the logic function of a network in a well-balanced state,and then the sharp-product operation was used to construct the disjoint minimal path set of the network.A computer program has been developed,and when combined with decomposition technology,the reliability of a general lifeline network can be effectively and automatically calculated.

An improved cut-based recursive decomposition algorithm for reliability analysis of networks

In this paper, an improved cut-based recursive decomposition algorithm is proposed for lifeline networks. First, a complementary structural function is established and three theorems are presented as a premise of the proposed algorithm. Taking the minimal cut of a network as decomposition policy, the proposed algorithm constructs a recursive decomposition process. During the decomposition, both the disjoint minimal cut set and the disjoint minimal path set are simultaneously enumerated. Therefore, in addition to obtaining an accurate value after decomposing all disjoint minimal cuts and disjoint minimal paths, the algorithm provides approximate results which satisfy a prescribed error bound using a probabilistic inequality. Two example networks, including a large urban gas system, are analyzed using the proposed algorithm. Meanwhile, a part of the results are compared with the results obtained by a path-based recursive decomposition algorithm. These results show that the proposed algorithm provides a useful probabilistic analysis method for the reliability evaluation of lifeline networks and may be more suitable for networks where the edges have low reliabilities.

An improved recursive decomposition algorithm for reliability evaluation of lifeline networks

The seismic reliability evaluation of lifeline networks has received considerable attention and been widely studied. In this paper, on the basis of an original recursive decomposition algorithm, an improved analytical approach to evaluate the seismic reliability of large lifeline systems is presented. The proposed algorithm takes the shortest path from the source to the sink of a network as decomposition policy. Using the Boolean laws of set operation and the probabilistic operation principal, a recursive decomposition process is constructed in which the disjoint minimal path set and the disjoint minimal cut set are simultaneously enumerated. As the result, a probabilistic inequality can be used to provide results that satisfy a prescribed error bound. During the decomposition process, different from the original recursive decomposition algorithm which only removes edges to simplify the network, the proposed algorithm simplifies the network by merging nodes into sources and removing edges. As a result, the proposed algorithm can obtain simpler networks. Moreover, for a network owning s-independent components in its component set, two network reduction techniques are introduced to speed up the proposed algorithm. A series of case studies, including an actual water distribution network and a large urban gas system, are calculated using the proposed algorithm. The results indicate that the proposed algorithm provides a useful probabilistic analysis method for the seismic reliability evaluation of lifeline networks.

Reliability and Feedback of Multiple Hop Wireless Networks

This paper analyzes fault-tolerance over the entire design life of a class of multiple-hop wireless networks, where cooperative transmission schemes are used. The networks are subject to both node failure and random channel fading. A node lifetime distribution is modeled with an increasing failure rate, where the node power consumption level enters the parameters of the distribution. A method for assessing both link and network reliabilities projected at the network＇s design life is developed. Link reliability is enhanced through use of redundant nodes. The number of redundant nodes is restricted by the cooperative transmission scheme used. The link reliability is then used to establish a re-transmission control policy that minimizes an expected cost involving power, bandwidth expenditures, and packet loss. The benefit and cost of feedback in network operations are examined. The results of a simulation study under specific node processing times are presented. The study quantifies the effect of loop closure frequency, acknowledgment deadline, and nodes＇ storage capacity on the performance of the network in terms of network lifetime, packet loss rate, and false alarm rate. The study concludes that in a network where energy is severely constrained, feedback must be applied judiciously.

An Artificial Neural Network-Based Response Surface Method for Reliability Analyses of c-φ Slopes with Spatially Variable Soil

This paper presents an artificial neural network（ANN）-based response surface method that can be used to predict the failure probability of c-φslopes with spatially variable soil.In this method,the Latin hypercube sampling technique is adopted to generate input datasets for establishing an ANN model;the random finite element method is then utilized to calculate the corresponding output datasets considering the spatial variability of soil properties;and finally,an ANN model is trained to construct the response surface of failure probability and obtain an approximate function that incorporates the relevant variables.The results of the illustrated example indicate that the proposed method provides credible and accurate estimations of failure probability.As a result,the obtained approximate function can be used as an alternative to the specific analysis process in c-φslope reliability analyses.

Reliability Evaluation of Mobile Communication Networks

A new reliability evaluation measure, global clustering reliability (GCR), is proposed. Firstly, the common measures used in invulnerability and survivability evaluation of mobile communication networks are discussed, and the shortcomings of these measures are pointed out. Then a new reliability evaluation measure, GCR, which is applicable to mobile communication networks, is proposed. And some properties and theorem about this measure are put forward. Finally, simulation calculation of reliability evaluation that uses this measure to 12 kinds of topological networks is accomplished. And the comparison between this measure and link connected factor (LCF) measure is also given. The results proved that the design of GCR is reasonable, its computation is rapid, moreover, it can take into account of invalidation of both nodes and links, and it has good physical meanings

Reliability Strategies for Data Transmission in Wireless Mesh Network

Wireless Mesh Network (WMN) is a new-type wireless network. Its core idea is that any of its wireless equipment can act as both an Access Point (AP) and a router. Each node in the network can send and receive signals as well as directly communicate with one or several peer nodes. One important issue to be considered in wireless Mesh networks is how to secure reliable data transmission in multi-hop links. To solve the problem, the 3GPP system architecture proposes two functionalities: ARQ and HARQ. This paper presents two HARQ schemes, namely hop-by-hop and edge-to-edge, and three ARQ schemes: hop-by-hop, edge-to-edge, and last-hop. Moreover, it proposes three solutions for WMNs from the perspective of protocol stock design: layered cooperative mechanism, relay ARQ mechanism and multi-hop mechanism.

Reliable Braided Multipath Routing with Network Coding for Underwater Sensor Networks

Owing to the long propagation delay and high error rate of acoustic channels, it is very challenging to provide reliable data transfer for underwater sensor networks. Moreover, network coding is proved to be an effective coding technique for throughput and robustness of networks. In this paper, we propose a Reliable Braided Multipath Routing with Network Coding for underwater sensor networks （RBMR-NC）. Disjoint multi-path algorithm is used to build independent actual paths, as called main paths. Some braided paths on each main path are built according to the braided multi-path algorithm, which are called logic paths. When a data packet is transmitted by these nodes, the nodes can employ network coding to encode packets coming from the same group in order to further reduce relativity among these packets, and enhance the probability of successful decoding at the sink node. Braided multi-path can make the main paths to be multiplexed to reduce the probability of long paths. This paper mainly employs successful delivery rate to evaluate RBMR-NC model with theoretical analysis and simulation methods. The results indicate that the proposed RBMR-NC protocol is valuable to enhance network reliability and to reduce system redundancy.

A Genetic Algorithm to Solve Capacity Assignment Problem in a Flow Network

Computer networks and power transmission networks are treated as capacitated flow networks.A capacitated flow network may partially fail due to maintenance.Therefore,the capacity of each edge should be optimally assigned to face critical situations-i.e.,to keep the network functioning normally in the case of failure at one or more edges.The robust design problem(RDP)in a capacitated flow network is to search for the minimum capacity assignment of each edge such that the network still survived even under the edge’s failure.The RDP is known as NP-hard.Thus,capacity assignment problem subject to system reliability and total capacity constraints is studied in this paper.The problem is formulated mathematically,and a genetic algorithm is proposed to determine the optimal solution.The optimal solution found by the proposed algorithm is characterized by maximum reliability and minimum total capacity.Some numerical examples are presented to illustrate the efficiency of the proposed approach.

Research on Link Duration for Mobile Multihop Communication Networks

Mobile multihop communication network is an important branch of modern mobile communication system, and is an important technical support for ubiquitous communication. The random movement of the nodes makes the networking be more flexible, but the frequently changing topology will decrease the link duration between nodes significantly, which will increase the packets loss probability and affect the network communication performance. Aiming at the problem of declining link duration caused by nomadic characteristics in mobile multihop communication network, four link duration models for possible moving states are established based on different features in real networking process in this paper, which will provide reliable criterion for the optimal routing selection. Model analysis and simulation results show that the reliable route established by the proposed model will effectively extend the link duration, and can enhance the global stability of the mobile multihop information transmission, so as to provide new option to transmission reliability improvement for the mobile communication network.

Recovery of coupled networks after cascading failures

With society＇s increasing dependence on critical infrastructure such as power grids and communications systems, the robustness of these systems has attracted significant attention.Failure of some nodes can trigger a cascading failure, which completely fragments the network, necessitating recovery efforts to improve robustness of complex systems. Inspired by real-world scenarios, this paper proposes repair models after two kinds of network failures, namely complete and incomplete collapse. In both models, three kinds of repair strategies are possible, including random selection（RS）, node selection based on single network node degree（SD）, and node selection based on double network node degree（DD）. We find that the node correlation in each of the two coupled networks affects repair efficiency. Numerical simulation and analysis results suggest that the repair node ratio and repair strategies may have a significant impact on the economics of the repair process. The results of this study thus provide insight into ways to improve the robustness of coupled networks after cascading failures.

Research on Real-Time High Reliable Network File Distribution Technology

The rapid development of Internet of Things(IoT)technology has made previously unavailable data available,and applications can take advantage of device data for people to visualize,explore,and build complex analyses.As the size of the network and the number of network users continue to increase,network requests tend to aggregate on a small number of network resources,which results in uneven load on network requests.Real-time,highly reliable network file distribution technology is of great importance in the Internet of Things.This paper studies real-time and highly reliable file distribution technology for large-scale networks.In response to this topic,this paper studies the current file distribution technology,proposes a file distribution model,and proposes a corresponding load balancing method based on the file distribution model.Experiments show that the system has achieved real-time and high reliability of network transmission.

Reliability evaluation of wireless sensor networks using an enhanced OBDD algorithm

An enhanced ordered binary decision diagram （EOBDD） algorithm is proposed to evaluate the reliability of wireless sensor networks （WSNs）, based on the considerations of the common cause failure （CCF） and a large number of nodes in WSNs. The EOBDD algorithm analyzes the common cause event （CCE） and the network structure when CCE takes place according to the stochastic graph and the CCF model of WSNs. After constructing the ordered binary decision diagram （OBDD） of the original network with node expansion, it uses a set of OBDD variables （SOV） to guide reliability computations along this OBDD. The two steps about OBDD can decrease the cost of OBDD constructions and storage. Furthermore, the efficient OBDD structure and Hash tables can greatly decrease redundant computations of isomorphs. The experiment results show that the EOBDD can be used to evaluate the reliability of WSN efficiently.

Computing the SKT Reliability of Acyclic Directed Networks Using Factoring Method

This paper presents a factoring algorithm for computing source-to- K terminal (SKT) reliability, the probability that a source s can send message to a specified set of terminals K, in acyclic directed networks (AD-networks) in which both nodes and edges can fail. Based on Pivotal decomposition theorem, a new formula is derived for computing the SKT reliability of AD-networks. By establishing a topological property of AD-networks, it is shown that the SKT reliability of AD- networks can be computed by recursively applying this formula. Two new Reliability- Preserving Reductions are also introduced. The recursion tree generated by the presented algorithm has at most 2 leaf nodes, where V and K are the numbers of nodes and terminals, respectively, while C is the number of the nodes satisfying some specified conditions. The computation complexity of the new algorithm is O (E. V. 2) in the worst case, where E is the number of edges. For source-to-all-terminal (SAT) reliability, its computation complexity is O(E). Comparison of the new algorithm with the existing ones indicates that the new algorithm is more efficient for computing the SKT reliability of AD-networks.

Analyzing the Reliability of Degradable Networks

The reachability of a strongly connected network may be destroyed after link damage.Since many networds have directed links with the potential for reversal,the reachabilty may be restored by reversing the direction of links.In this paper,the reliability of a network that allows reversal of links is dis- cussed.

Understanding network travel time reliability with on-demand ride service data

Travel time reliability is of increasing importance for travelers, shippers, and transportation managers because traffic congestion has become worse in major urban areas in recent years. To better evaluate the urban network-wide travel time reliability, five indices based on the emerging on-demand ride service data are proposed:network free flow time rate(NFFTR), network travel time rate(NTTR), network planning time rate(NPTR), network buffer time rate(NBTR), and network buffer time rate index(NBTRI). These indices take into account the probability distribution of the travel time rate(i.e., travel time spent for the unit distance, in min/km) of each origindestination(OD) pair in the road network. We use realworld data extracted from DiDi-Chuxing, which is the largest on-demand ride service platform in China. For demonstrative purposes, the network-wide travel time reliability of Beijing is analyzed in detail from two dimensions of time and space. The results show that the road network is more unreliable in AM/PM peaks than other time periods, and the most reliable time period is the early morning. Additionally, we can find that the central region is more unreliable than other regions of the city based on the spatial analysis results. The proposed network travel time reliability indices provide insights for the comprehensive evaluation of the road network traffic dynamics and day-to-day travel time variations.

Reliability Analysis of Aircraft Condition Monitoring Network Using an Enhanced BDD Algorithm

The aircraft condition monitoring network is responsible for collecting the status of each component in aircraft. The reliability of this network has a significant effect on safety of the aircraft. The aircraft condition monitoring network works in a real-time manner that all the data should be transmitted within the deadline to ensure that the control center makes proper decision in time. Only the connectedness between the source node and destination cannot guarantee the data to be transmitted in time. In this paper, we take the time deadline into account and build the task-based reliability model. The binary decision diagram （BDD）, which has the merit of efficiency in computing and storage space, is introduced when calculating the reliability of the network and addressing the essential variable. A case is analyzed using the algorithm proposed in this paper. The experimental results show that our method is efficient and proper for the reliability analysis of the real-time network.

Improving the Reliability of Computer Communication Networks

For networks that are directed or can be represented by a directed network,reversing one or more of the uni-directional links may provide the ability to reconnect a network that has been disconnected by link failure, In this paper,a new approach to reconfigure such networks is proposed.We develop a linear time algorithm which,when reachability has been destroyed by the removal of a single link,optimally restores teachability through the reversal of selected links.Multi-link failure reconnectability is discussed and an algorithm with polynomial complexity is given which provides a nearly optimum solution to reconnect the network.We show that the reliability of a network that allows reversals is at least twice more than that in which reversals are not permitted.Unfortunately,the reconnection of some networks cannot be established.Therefore,we discuss the maximization of reachability of such networks so that each node can reach maximum number of the other nodes.