2,869 research outputs found
Practical issues for the implementation of survivability and recovery techniques in optical networks
Survivability in Time-varying Networks
Time-varying graphs are a useful model for networks with dynamic connectivity
such as vehicular networks, yet, despite their great modeling power, many
important features of time-varying graphs are still poorly understood. In this
paper, we study the survivability properties of time-varying networks against
unpredictable interruptions. We first show that the traditional definition of
survivability is not effective in time-varying networks, and propose a new
survivability framework. To evaluate the survivability of time-varying networks
under the new framework, we propose two metrics that are analogous to MaxFlow
and MinCut in static networks. We show that some fundamental
survivability-related results such as Menger's Theorem only conditionally hold
in time-varying networks. Then we analyze the complexity of computing the
proposed metrics and develop several approximation algorithms. Finally, we
conduct trace-driven simulations to demonstrate the application of our
survivability framework to the robust design of a real-world bus communication
network
Resilient networking in wireless sensor networks
This report deals with security in wireless sensor networks (WSNs),
especially in network layer. Multiple secure routing protocols have been
proposed in the literature. However, they often use the cryptography to secure
routing functionalities. The cryptography alone is not enough to defend against
multiple attacks due to the node compromise. Therefore, we need more
algorithmic solutions. In this report, we focus on the behavior of routing
protocols to determine which properties make them more resilient to attacks.
Our aim is to find some answers to the following questions. Are there any
existing protocols, not designed initially for security, but which already
contain some inherently resilient properties against attacks under which some
portion of the network nodes is compromised? If yes, which specific behaviors
are making these protocols more resilient? We propose in this report an
overview of security strategies for WSNs in general, including existing attacks
and defensive measures. In this report we focus at the network layer in
particular, and an analysis of the behavior of four particular routing
protocols is provided to determine their inherent resiliency to insider
attacks. The protocols considered are: Dynamic Source Routing (DSR),
Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing
(RWR)
Risk based resilient network design
This paper presents a risk-based approach to resilient network design. The basic design problem considered is that given a working network and a fixed budget, how best to allocate the budget for deploying a survivability technique in different parts of the network based on managing the risk. The term risk measures two related quantities: the likelihood of failure or attack, and the amount of damage caused by the failure or attack. Various designs with different risk-based design objectives are considered, for example, minimizing the expected damage, minimizing the maximum damage, and minimizing a measure of the variability of damage that could occur in the network. A design methodology for the proposed risk-based survivable network design approach is presented within an optimization model framework. Numerical results and analysis illustrating the different risk based designs and the tradeoffs among the schemes are presented. © 2011 Springer Science+Business Media, LLC
Disaster-Resilient Control Plane Design and Mapping in Software-Defined Networks
Communication networks, such as core optical networks, heavily depend on
their physical infrastructure, and hence they are vulnerable to man-made
disasters, such as Electromagnetic Pulse (EMP) or Weapons of Mass Destruction
(WMD) attacks, as well as to natural disasters. Large-scale disasters may cause
huge data loss and connectivity disruption in these networks. As our dependence
on network services increases, the need for novel survivability methods to
mitigate the effects of disasters on communication networks becomes a major
concern. Software-Defined Networking (SDN), by centralizing control logic and
separating it from physical equipment, facilitates network programmability and
opens up new ways to design disaster-resilient networks. On the other hand, to
fully exploit the potential of SDN, along with data-plane survivability, we
also need to design the control plane to be resilient enough to survive network
failures caused by disasters. Several distributed SDN controller architectures
have been proposed to mitigate the risks of overload and failure, but they are
optimized for limited faults without addressing the extent of large-scale
disaster failures. For disaster resiliency of the control plane, we propose to
design it as a virtual network, which can be solved using Virtual Network
Mapping techniques. We select appropriate mapping of the controllers over the
physical network such that the connectivity among the controllers
(controller-to-controller) and between the switches to the controllers
(switch-to-controllers) is not compromised by physical infrastructure failures
caused by disasters. We formally model this disaster-aware control-plane design
and mapping problem, and demonstrate a significant reduction in the disruption
of controller-to-controller and switch-to-controller communication channels
using our approach.Comment: 6 page
Scalable shared protection approach for mesh WDM-routed networks
The paper proposes an approach for calculating the protection pool size on each link in a mesh WDMrouted network. The protection pool evaluation is part of a shared protection scheme applied to a failure dependent scenario and based on aggregated information dissemination. Two models based on a probabilistic approach are proposed to provide a scheme that is scalable as the number of optical cross-connects (OXC), fibres and wavelength multiplexing in a core network increases. Precisely, two models based on a binomial and a beta-binomial distribution are presented. The evaluation of the models by simulation shows that both models are attractive propositions to offer protected ¸-services that do not require an absolute protection guarantee offered by (1:1) schemes or shared protection schemes requiring full network state information, or using partial information but with less efficient use of the fibre utilisation
- …