Disjoint Paths in Networks

Iqbal, Farabi; Kuipers, Fernando A.

doi:10.1002/047134608x.w8254

Cited by 30 publications

(21 citation statements)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Output: 2 node-disjoint paths P1, P2. 1 for i=1,2 do 2 Find the shortest path Pi from node s to node t ; 3 Delete intermediate node of Pi from G; 4 end Algorithm 2: Basic 2-node-disjoint-paths in directed graphs [20] η% is the percentage of power savings related to the cables turned off by the EAR algorithm. It is computed as follows:…”

Section: Resultsmentioning

confidence: 99%

“…The idea of our heuristic is as follows (see Algorithm 1). Sort all demands in a descending order of their traffic h d ; create the residual graph for each demand by removing all links with residual capacity lower than h d ; find the primary path and backup path (using algorithm 2 that computes node-disjoint paths [20]) for each demand. Then, the energy aware routing phase is initialized; select iteratively a link with maximum residual capacity to turn off; find all demands that contain the deleted link and reroute traffic for affected demands.…”

Section: Heuristic Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability

Mâaloul

Taktak

Fourati

et al. 2018

2018 25th International Conference on Telecommunications (ICT)

View full text Add to dashboard Cite

Carrier grade networks are in general overdimensioned in order to protect against network resource failures and to handle probable traffic peaks. Such network design exhibits non-negligible energy waste. As well known, during network operation, the traffic load varies remarkably over day hours. Typically, a significant amount of energy saving can be achieved by turning off redundant and underutilized resources. Ensuring a sufficient level of reliability while taking into account energy saving objective is a very challenging task.In this paper, we study the multi-commodity reliable network design for carrier Ethernet networks. Each traffic demand is routed along one working path, and a corresponding backup path computed considering dedicated protection scheme. The primary and backup path must be node-disjoint. We also assume that the links of the carrier grade networks are made of multiple physical cables called bundles. We propose an exact method based on an Integer Linear Programming (ILP) formulation for the two node-disjoint paths with energy-aware routing (TNDP-EAR) problem. The studied problem is known to be NP-hard. In order to solve it efficiently, we propose a heuristic-based algorithm called GreenTNDP. Preliminary experimental results show the effectiveness of our algorithms to solve the problem.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Heuristic Algorithmmentioning

confidence: 99%

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability

Mâaloul

Taktak

Fourati

et al. 2018

2018 25th International Conference on Telecommunications (ICT)

View full text Add to dashboard Cite

show abstract

“…3 Node failures can also be handled by employing the transformation described in [25], where each node in the network is split into two nodes (say, "in-node" and "out-node") connected by a directed link. Al links that terminate at the original node now terminate at the "in-node" while all links that emerge out of the original node now emanate out of the "out-node".…”

Section: Model and Problem Formulationmentioning

confidence: 99%

Tunable QoS-Aware Network Survivability

Yallouz

Orda

2017

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-Coping with network failures has been recognized as an issue of major importance in terms of social security, stability and prosperity. It has become clear that current networking standards fall short of coping with the complex challenge of surviving failures. The need to address this challenge has become a focal point of networking research. In particular, the concept of tunable survivability offers major performance improvements over traditional approaches. Indeed, while the traditional approach aims at providing full (100%) protection against network failures through disjoint paths, it was realized that this requirement is too restrictive in practice. Tunable survivability provides a quantitative measure for specifying the desired level (0%-100%) of survivability and offers flexibility in the choice of the routing paths. Previous work focused on the simpler class of "bottleneck" criteria, such as bandwidth. In this study, we focus on the important and much more complex class of additive criteria, such as delay and cost. First, we establish some (in part, counter-intuitive) properties of the optimal solution. Then, we establish efficient algorithmic schemes for optimizing the level of survivability under additive end-to-end QoS bounds. Subsequently, through extensive simulations, we show that, at the price of negligible reduction in the level of survivability, a major improvement (up to a factor of 2) is obtained in terms of end-to-end QoS performance. Finally, we exploit the above findings in the context of a network design problem, in which, for a given investment budget, we aim to improve the survivability of the network links.

show abstract

“…Definition 2.2: Given a survivable connection (π 1 , π 2 ) such that π 1 ∩ π 2 = ∅, we say that (π 1 , π 2 ) is a p-survivable connection if e∈π1∩π2 (1 − p e ) ≥ p, i.e., the probability that all common links are operational is at least p. The value of p is then termed as the survivability level of the connection. 3 Node failures can also be handled by employing the transformation described in [25], where each node in the network is split into two nodes (say, "in-node" and "out-node") connected by a directed link. Al links that terminate at the original node now terminate at the "in-node" while all links that emerge out of the original node now emanate out of the "out-node".…”

Section: Model and Problem Formulationmentioning

confidence: 99%

Tunable QoS-aware network survivability

Yallouz

Orda

2013

2013 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Coping with network failures has been recognized as an issue of major importance in terms of social security, stability and prosperity. It has become clear that current networking standards fall short of coping with the complex challenge of surviving failures. The need to address this challenge has become a focal point of networking research. In particular, the concept of tunable survivability offers major performance improvements over traditional approaches. Indeed, while the traditional approach aims at providing full (100%) protection against network failures through disjoint paths, it was realized that this requirement is too restrictive in practice. Tunable survivability provides a quantitative measure for specifying the desired level (0%-100%) of survivability and offers flexibility in the choice of the routing paths. Previous work focused on the simpler class of "bottleneck" criteria, such as bandwidth. In this study, we focus on the important and much more complex class of additive criteria, such as delay and cost. First, we establish some (in part, counter-intuitive) properties of the optimal solution. Then, we establish efficient algorithmic schemes for optimizing the level of survivability under additive end-to-end QoS bounds. Subsequently, through extensive simulations, we show that, at the price of negligible reduction in the level of survivability, a major improvement (up to a factor of 2) is obtained in terms of end-to-end QoS performance. Finally, we exploit the above findings in the context of a network design problem, in which, for a given investment budget, we aim to improve the survivability of the network links.

show abstract

Disjoint Paths in Networks

Cited by 30 publications

References 47 publications

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability

Tunable QoS-Aware Network Survivability

Tunable QoS-aware network survivability

Contact Info

Product

Resources

About