An Efficient Algorithm for Computing Network Reliability in Small Treewidth

We consider the classic problem of Network Reliability. A network is given together with a source vertex, one or more target vertices, and probabilities assigned to each of the edges. Each edge appears in the network with its associated probability and the problem is to determine the probability of having at least one source-to-target path. This problem is known to be NP-hard. We present a linear-time fixed-parameter algorithm based on a parameter called treewidth, which is a measure of tree-likeness of graphs. Network Reliability was already known to be solvable in polynomial time for bounded treewidth, but there were no concrete algorithms and the known methods used complicated structures and were not easy to implement. We provide a significantly simpler and more intuitive algorithm that is much easier to implement. We also report on an implementation of our algorithm and establish the applicability of our approach by providing experimental results on the graphs of subway and transit systems of several major cities, such as London and Tokyo. To the best of our knowledge, this is the first exact algorithm for Network Reliability that can scale to handle real-world instances of the problem.Comment: 14 page

Reliability assessment of water distribution systems with statistical entropy and other surrogate measures

There is ever increasing commercial and regulatory pressure to minimise the cost of water distribution networks even as the demand for them keeps on growing. But cost minimizing is only one of the demands placed on network design. Satisfactory networks are required to operate above a minimum level even if they experience failure of components. Reliable hydraulic performance can be achieved if sufficient redundancy is built in the network. This has given rise to various water distribution system optimization methods including genetic algorithms and other evolutionary computing methods. Evolutionary computing approaches frequently assess the suitability of enormous numbers of potential solutions for which the calculation of accurate reliability measures could be computationally prohibitive. Therefore, surrogate reliability measures are frequently used to ease the computational burden. The aim of this paper is to assess the correlation of surrogate reliability measures in relation to more accurate measures. The surrogate measures studied are statistical entropy, network resilience, resilience index and modified resilience index. The networks were simulated with the prototype software PRAAWDS that produces more realistic results for pressure-deficient water distribution systems. Statistical entropy outperformed resilience index in this study. The results also demonstrate there is a strong correlation between entropy and failure tolerance

On the Design of Future Communication Systems with Coded Transport, Storage, and Computing

Communication systems are experiencing a fundamental change. There are novel applications that require an increased performance not only of throughput but also latency, reliability, security, and heterogeneity support from these systems. To fulfil the requirements, future systems understand communication not only as the transport of bits but also as their storage, processing, and relation. In these systems, every network node has transport storage and computing resources that the network operator and its users can exploit through virtualisation and softwarisation of the resources. It is within this context that this work presents its results. We proposed distributed coded approaches to improve communication systems. Our results improve the reliability and latency performance of the transport of information. They also increase the reliability, flexibility, and throughput of storage applications. Furthermore, based on the lessons that coded approaches improve the transport and storage performance of communication systems, we propose a distributed coded approach for the computing of novel in-network applications such as the steering and control of cyber-physical systems. Our proposed approach can increase the reliability and latency performance of distributed in-network computing in the presence of errors, erasures, and attackers

A characterisation of reliability tools for Software Defined Networks

Software Defined Network (SDN) is a new paradigm in networking that introduces great flexibility, allowing the dynamic configuration of parts of the network through centralised programming. SDN has been successfully applied in field networks, and is now being applied to wireless and mobile networks, generating Software Defined Mobile/Wireless networks (SDWNs). SDN can be also combined with Network Function Virtualization (NFV) producing a software network in which the specific hardware is replaced by general purpose computing equipment running SDN and NFV software solutions. This highly programmable and flexible network introduces many challenges from the point of view of reliability (or robustness), and operators need to ensure the same level of confidence as in previous, less flexible deployments. This paper provides a first study of the current tools used to analyse the reliability of SDNs before deployment and/or during the exploitation of the network. Most of these tools offer some kind of automatic verification, supported by algorithms based on formal methods, but they do not differentiate between fixed and mobile/wireless networks. In the paper we provide a number of classifications of the tools to make this selection easier for potential users, and we also identify promising research areas where more effort needs to be made.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

NETWORK CONNECTIVITY QUALITY - USER INTERFACE ICONS AND REPORTS

A computing device (e.g. mobile phone, smartphone, tablet computer, etc.) with multiple network connectivities may be configured to display a user interface with an indication of network quality to a user. For example, the displayed user interface may include an icon indicating the network quality (e.g., data transmission speeds, of a selected network connection) in a status bar. The computing device may also generate a network report detailing various performance metrics (e.g. an amount of data used, network speed, network reliability) of a selected network connection for a user-specified or pre-defined time period. The computing device may also provide a user with network usage suggestions based on the user’s network connection patterns. The computing device may also monitor changes in the network connection report and suggest a user take actions to correct, improve, or otherwise change network connectivity quality