16 research outputs found

    Disaster-Resilient Control Plane Design and Mapping in Software-Defined Networks

    Full text link
    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

    Backup reprovisioning with partial protection for disaster-survivable software-defined optical networks

    No full text
    As networks grow in size, large-scale failures caused by disasters may lead to huge data loss, especially in an optical network employing wavelength-division multiplexing (WDM). Providing 100 % protection against disasters would require massive and economically unsustainable bandwidth overprovisioning, as disasters are difficult to predict, statistically rare, and may create large-scale failures. Backup reprovisioning schemes are proposed to remedy this problem, but in case of a large-scale disaster, even the flexibility provided by backup reprovisioning may not be enough, given the sudden reduction in available network resource, i.e., resource crunch. To mitigate the adverse effects of resource crunch, an effective resource reallocation is possible by exploiting service heterogeneity, specifically degraded-service tolerance, which makes it possible to provide some level of service, e.g., reduced capacity, to connections that can tolerate degraded service, versus no service at all. Software-Defined Networking (SDN) is a promising approach to perform such dynamic changes (redistribution of network resources) as it simplifies network management via centralized control logic. By exploiting these new opportunities, we propose a Backup Reprovisioning with Partial Protection (BRPP) scheme supporting dedicated-path protection, where backup resources are reserved but not provisioned (as in shared-path protection), such that the amount of bandwidth reserved for backups as well as their routings are subject to dynamic changes, given the network state, to increase utilization. The performance of the proposed scheme is evaluated by means of SDN emulation using Mininet environment and OpenDaylight as the controller

    RASCAR: Recovery-Aware Switch-Controller Assignment and Routing in SDN

    No full text
    Decoupling control and data planes in a software-defined network (SDN) has its advantages along with its challenges. Especially, resilient communication between elements in the data plane (switches) and in the control plane (controllers) is key to SDN's success as disruption of this communication after a failure can severely affect data-plane functions. After a failure, simultaneous recovery of all switch-controller communication paths (control paths) may not be possible, and multiple recovery stages may be required. Since restoration of disrupted data paths depends on the recovery of disrupted control paths feeding control information to switches, the performance of control-path recovery seriously affects data-path recovery performance. The assignment of controller to switches and the routing of controller-switch control paths are what determines the control-plane recovery performance, and hence should be performed in conjunction with a recovery plan after failures. This study proposes an algorithm for recovery-aware switch-controller assignment and routing (RASCAR), which enables fast data-path recovery after a set of failures (e.g., single point of failures and disasters). We formulate the problem as an integer linear program and propose an efficient heuristic algorithm to solve large problem instances. Our illustrative numerical studies show that RASCAR significantly reduces the data-path restoration times after any failure with a minor increase in resource consumption of control paths

    Network Adaptability to Disaster Disruptions by Exploiting Degraded-Service Tolerance

    No full text
    The rapid increase in network traffic with new bandwidth-hungry applications such as cloud computing and telemedicine makes disaster survivability a crucial concern as the data (and revenue) loss caused by large-scale correlated cascading failures can be very high. To alleviate their impact, new measures should be taken since the nature of the network changes dramatically as available resources decrease during disasters. We develop a metric, called degraded-service tolerance, which can reduce protection cost and network disruption, and support maximal carried traffic in case of disasters. Degraded-service-tolerant connections can be admitted and recovered with reduced bandwidth under resource crunch. Our scheme re-assigns resources among connections by leveraging their degraded-service tolerance. A case study shows how our proposal can be applied to boost network performance during the resource crunch following a disaster

    Disaster-aware service provisioning with manycasting in cloud networks

    Get PDF
    Cloud services delivered by high-capacity optical datacenter networks are subject to disasters which may cause large-area failures, leading to huge data loss. Survivable service provisioning is crucial to minimize the effects of network/datacenter failures and maintain critical services in case of a disaster. We propose a novel disaster-aware service-provisioning scheme that multiplexes service over multiple paths destined to multiple servers/datacenters with manycasting. Our scheme maintains some bandwidth (i.e., degraded service) after a disaster failure vs. no service at all. We formulate this problem into a mathematical model which turns out to be an Integer Linear Program (ILP), and we provide heuristic optimization approaches as ILP is intractable for large problem instances. Numerical examples show that exploiting manycasting by intelligently selecting destinations in a risk-aware manner for service provisioning offers high level of survivability against link and node failures that may be caused by disasters and post-disaster failures at no extra cost compared to the other survivable schemes

    Content aware delivery of visual attention based scalable multi-view video over P2P

    No full text
    3D media applications have become widespread thanks to the intense research being conducted on 3D enabling technologies, commercial products being released and service providers. There is also a huge potential for IP network to become a major means for delivering 3D video services, being highly flexible and allowing much custom and scalable applications to take up. Peer-to-Peer (P2P) video streaming, which offers high scalability in the presence of many media consuming peers, is suitable for multi-view video applications with significantly higher bandwidth requirements. To exploit flexible streaming and also serve a range of displays, P2P networking should be combined with scalable coded multi-view video that offers a useful bit-rate and maximum viewpoint adaptation range. However, since maintaining users' Quality of Experience (QoE) is a primary target, scalable coded video should ensure that perceptually sensible visual data is delivered with high accuracy at all times to users, even under severe network conditions. Hence, content-based visual attention models provide a suitable means for letting salient video data be delivered at all times to users. With the utilization of appropriate adaptation decision making process in users' equipment, the P2P protocol can adaptively stream the scalable 3D media. Work presented in this paper explains such a delivery framework over P2P networks. ┬ę 2012 IEEE

    Adaptive streaming of multi-view video over P2P networks

    No full text
    In this paper, we propose a novel solution for the adaptive streaming of 3D representations in the form of multi-view video by utilizing P2P overlay networks to assist the media delivery and minimize the bandwidth requirement at the server side. Adaptation to diverse network conditions is performed regarding the features of human perception to maximize the perceived 3D. We have performed subjective tests to characterize these features and determined the best adaptation method to achieve the highest possible perceived quality. Moreover, we provide a novel method for mapping from scalable video elementary stream to torrent-like data chunks for adaptive video streaming and provide an optimized windowing mechanism that ensures timely delivery of the content over yanl┼č gibi. The paper also describes techniques generating scalable video chunks and methods for determining system parameters such as chunk size and window length. ┬ę 2012 Elsevier B.V. All rights reserved
    corecore