Search results for: SURVIVABLE ROUTING - Bridge of Knowledge

Search

Search results for: SURVIVABLE ROUTING

Search results for: SURVIVABLE ROUTING

  • Methods for physical impairment constrained routing with selected protection in all-optical networks

    Publication
    • P. Soproni
    • T. Cinkler
    • J. Rak

    - TELECOMMUNICATION SYSTEMS - Year 2014

    In this paper, we investigate the problem of survivable all-optical routing in WDM networks with physical impairments. One of the recent key issues in survivable optical network design refers to maximization of the ratio of routeable demands while keeping the overall network cost low. In WDM networks, this goal can be achieved by routing as many demands in all-optical way as possible. Based on the latest technical trends driven...

    Full text available to download

  • A novel genetic approach to provide differentiated levels of service resilience in IP-MPLS/WDM networks

    This paper introduces a novel class-based method of survivable routing for connection-oriented IP-MPLS/WDM networks, called MLS-GEN-H. The algorithm is designed to provide differentiated levels of service survivability in order to respond to varying requirements of end-users. It divides the complex problem of survivable routing in IP-MPLS/WDM networks into two subproblems, one for each network layer, which enables finding the...

    Full text to download in external service

  • eFRADIR: An Enhanced FRAmework for DIsaster Resilience

    Publication
    • A. Pasic
    • R. Girao-Silva
    • F. Mogyorosi
    • B. Vass
    • T. Gomes
    • P. Babarczi
    • P. Revisnyei
    • J. Tapolcai
    • J. Rak

    - IEEE Access - Year 2021

    This paper focuses on how to increase the availability of a backbone network with minimal cost. In particular, the new framework focuses on resilience against natural disasters and is an evolution of the FRADIR/FRADIR-II framework. It targets three different directions, namely: network planning, failure modeling, and survivable routing. The steady state network planning is tackled by upgrading a sub-network (a set of links termed...

    Full text available to download

  • An approach to improve the time efficiency of disjoint paths calculation

    Publication

    - Year 2015

    Failures of network elements can be appropriately dealt with by utilization of alternate disjoint paths to provide redirection of flows affected by failures of the respective working paths. Known approaches can be broadly divided by decision on backup paths installation into proactive and reactive mechanisms, as well as based on the scope of recovery actions into local and global rerouting. There are several important scenarios...

    Full text to download in external service

  • Evaluation of time-efficiency of disjoint paths calculation schemes

    Publication

    - Year 2015

    The concept of alternate paths has been shown in the literature to provide fast response of a network to failures of its elements (nodes/links) affecting flows along the primary communication paths. Various approaches have been proposed to reduce the time necessary to redirect the respective flows onto the alternate paths. In this paper, we focus on another important objective, that so far has not received much attention, i.e.,...

    Full text to download in external service

  • INTER-LAYER SHARING OF BACKUP PATH CAPACITIES PROVIDING FAST SERVICE RECOVERY IN IP-MPLS/WDM NETWORKS

    Publication

    - Year 2013

    In this paper, we investigate the issue of providing the transmission continuity in IP-MPLS/WDM networks in the presence of failures of nodes/links. Special focus is put on assuring fast restoration of flows affected after a failure in a scenario assuming sharing the backup path capacities in order to decrease the overall bandwidth consumption. In particular, we propose a new approach to inter-layer sharing of link capacity reserved...

  • Toward Fast Calculation of Communication Paths for Resilient Routing

    Publication

    - NETWORKS - Year 2017

    Utilization of alternate communication paths is a common technique to provide protection of transmission against failures of network nodes/links. However, a noticeable delay is encountered when calculating the relevant sets of disjoint paths using the available algorithms (e.g., using Bhandari’s approach). This, in turn, may have a serious impact on the ability of a network to serve dynamic demands...

    Full text to download in external service