Failure propagation in interdependent multi-level networks

В этой работе разрабатываются новый подход и алгоритмические инструменты для моделирования и анализа живучести сетей с разнородными узлами, а также рассматривается их применение в космических сетях. Космические сети позволяют совместно использовать ресурсы космических аппаратов на орбите, такие как хранение, обработка и обмен данными. Каждый космический аппарат в сети может иметь различный состав и функциональность подсистем, что приводит к неоднородности узлов. Большинство традиционных анализов живучести сетей предполагают однородность узлов и в результате не подходят для анализа космических сетей. Эта работа предполагает, что гетерогенные сети могут быть смоделированы как взаимозависимые многоуровневые сети, что позволяет проводить анализ их живучести. Многоуровневый аспект фиксирует разбивку сети в соответствии с общими функциональными возможностями в различных узлах и позволяет создавать однородные подсети, в то время как аспект взаимозависимости ограничивает сеть для захвата физических характеристик каждого узла. In this paper, we develop a new approach and algorithmic tools for modeling and analyzing the survivability of networks with heterogeneous nodes, and also consider their application in space networks. Space networks allow the sharing of spacecraft resources in orbit, such as data storage, processing, and exchange. Each spacecraft in the network may have a different composition and functionality of subsystems, which leads to heterogeneity of nodes. Most traditional network survivability analyses assume node homogeneity and as a result are not suitable for space network analysis. This work suggests that heterogeneous networks can be modeled as interdependent multi-level networks, allowing analysis of their survivability. The multi-level aspect captures the network breakdown according to the common functionality in different nodes and allows for the creation of homogeneous subnets, while the interdependence aspect restricts the network to capture the physical characteristics of each node.

Key Distribution Strategy of Wireless Sensor Network Based on Multi-Hash Chain

Key management is the basis of the security mechanism for wireless sensor networks and services, and random key pre-distribution is the most effective key management mechanism at present. However, there is a potential challenge to most current random key pre-distribution strategies: it is difficult to achieve both ideal network security connectivity and network survivability. In this paper, we present a novel random key pre-distribution scheme based on the hash chain. By adjusting certain system parameters, such as the hash chain length, the number of common auxiliary nodes and the number of hash chains, a sensor node only need to preload a few of keys, making it possible to establish the pairwise key with high probability among its neighboring nodes. The proposed scheme can still maintain strong network survivability even if there are many compromised nodes. The theoretical analysis and simulation experiments show that the proposed scheme is not only effective and secure, but also scalable.

Certain Investigations on Energy-Efficient Fault Detection and Recovery Management in Underwater Wireless Sensor Networks

In recent years, underwater wireless sensor networks (UWSNs) have been widely applied to aquatic and military applications. Network survivability is an essential attribute to be considered in UWSN circumstance and various stratifications like node survivability, connectivity and rapid fault node detection and recovery. However, efficient and accurate fault tolerance mechanisms are required to prolong the network survivability in UWSN. In this research work, the energy-efficient fault detection and recovery management (EFRM) approach is proposed for the UWSN with relatively better network survivability. The hidden Poisson Markov model has been incorporated in EFRM to achieve efficient fault detection throughout the whole network. Thereafter, the recovered node can be selected by using the analytical network process model which facilitates to recover the larger number of nodes in the damaged region. The simulation results manifest that when the fault probability is 40%, the detection accuracy of the proposed EFRM is over 99%, and the false positive rate is below 2%. The detection accuracy is improved by up to 12% when compared with the existing state-of-the-art schemes.

Efficient Defense Decision-Making Approach for Multistep Attacks Based on the Attack Graph and Game Theory

In the multistep attack scenario, each rational attack-defense player tries to maximize his payoff, but the uncertainty about his adversary prevents him from taking the favorable actions. How to select the best strategy from the candidate strategies to maximize the defense payoff becomes the core issue. For this purpose, the paper innovatively designs a game theory model from the point of network survivability in combination with the attribute attack graph. The attack graph is created based on the network connectivity and known vulnerabilities using the MulVAL toolkit, which gives the full view of all the known vulnerabilities and their interdependence. Then, we use the attack graph to extract attack-defense actions, candidate attack-defense strategies, attack-defense payoffs, and network states, as well as other game modeling elements. Afterwards, the payoffs of attack-defense strategies are quantified by integrating attack-defense strength and network survivability. In addition, we input the above elements into the game model. Through repeated learning, deduction, and improvement, we can optimize the layout of defense strategies. Finally, the efficient strategy selection approach is designed on the tradeoff between defense cost and benefit. The simulation of attack-defense confrontation in small-scale LAN shows that the proposed approach is reliable and effective.

A Holistic Survey on Disaster and Disruption in Optical Communication Network

Background: This paper is a review of optical fiber communications and also presents the different types of disasters and different protection schemes to combat these disasters. In the optical communication network, the failure of a network caused by disasters (e.g. predictable disaster, unpredictable disaster, Intentional attacks) leads to the failure of several optical communication channels and huge data loss. Most of the previous works on optical network survivability assume that the failures are going to occur in future, and the network is made survivable to ensure connectivity in events of failures. With the advancements in technology, the predictions of tornados, cyclone and landslides are becoming more accurate by using some early warning systems. Objective: Significant improvement in optical communication network survivability can be achieved using our proposed protection scheme in the event of a major earthquake, cloud burst and landslides. Conclusion: The review concludes that a large amount of data could be lost even if there is a very short disruption in the optical backbone network.

Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes

Network survivability has drawn certain interest in network optimization. However, the demand for full protection of a network is usually too restrictive. To overcome the limitation of geographical environments and to save network resources, we turn to establish backup networks allowing a few common nodes. It comes out the problem of finding k link-disjoint paths between a given pair of source and sink in a network such that the number of common nodes shared by at least two paths is bounded by a constant and the total link weight of all paths is minimized under the above constraints. For the case k = 2, where we have only one backup path, several fast algorithms have been developed in the literature. For the case k > 2, little results are known. In this paper, we first establish the NP-hardness of the problem with general k. Motivated by the situation that each node in a network may have a capability of multicasting, we also study a restricted version with one more requirement that each node can be shared by at most two paths. For the restricted version, we build an ILP model and design a fast algorithm by using the techniques of augmenting paths and splitting nodes. Furthermore, experimental results on synthetic and real networks show that our algorithm is effective in practice.

IMPROVEMENT OF NETWORK SURVIVABILITY USING THE EFFECTIVE REDUNDANCY DESIGN

Network survivability is a very important issue due to the sustainability of the network services. Failure in a network system conduce to disturbance of the network services and causes trouble to millions of applications. Implement an effective redundancy design is one of method to cope nuisance in terms of sustainability in a network. In this paper, there are two design networks with and without redundancy respectively by Metro Ethernet-based technique to support transmission of data and voice. Furthermore, there is a validation performance of networks by measuring and comparing the throughput, latency and jitter between the two network designs. The value of bandwidth capacity is 100 Mbps as plan bandwidth link. Measurements results denote that network with redundancy design is able to enhance performance of the network, the parameters are: the throughput on single link tends to moderate (25%-50%), on the other hand, the throughput values on the main link and back uplink are in accordance with very good condition (75%-100%). The values of frame loss ratio 69.979% - 56.679% (single link), 6.77% -9.999% (main link) and 6.676 %-9.999% (back uplink). The values of jitter and latency in network with redundancy design are much better than in single link network. The recovery time for each frame length is ranging from 48.999ms to 49.887ms, where it is still meet with the standard that must below 50ms. Finally, when the main link in the network topology with redundancy design undergo link fails condition, the backup link is able to maintain the quality of network throughout that time, on the contrary, network topology without redundancy design is unable.