Finding paths with minimum shared edges

Omran, Masoud T.; Sack, Jörg-Rüdiger; Zarrabi-Zadeh, Hamid

doi:10.1007/s10878-012-9462-2

Cited by 19 publications

(11 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the earlier published algorithms for finding disjoint paths in a network was from Suurballe [ 9 ] and subsequently from Bhandari [ 10 ]. Many variants of disjoint paths algorithms such as availability based disjoint [ 11 ], maximally disjoint [ 12 ] and region based disjoint paths [ 13 ] are published. Several other constraints including the weights of the constituent edges of the paths are also added such as min-sum and min-max.…”

Section: Related Workmentioning

confidence: 99%

Canine Algorithm for Node Disjoint Paths

Ammal

Sajimon

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Node Disjoint Paths (NDP) is one of the extensively studied Graph Theory problem. In this problem, the input is a directed n vertex graph and the set of source destination pair of vertices. The goal is to find the maximum number of paths connecting each such pair, so that such discovered paths are node-disjoint. In this paper, a novel Canine Inspired Algorithm is proposed which is a bio-inspired one, based on the olfactory capabilities of canines in tracing and reaching a destination. Currently many of the existing algorithms try to identify disjoint paths in a linear manner, whereas the Canine algorithm can be executed in a concurrent manner, depending on the number of canines deployed to find the disjoint paths. The time complexity of the algorithm is estimated to be . We hope that this algorithm finds many applications in problems related to various fields such as communication networks, scheduling and transportation and provides better results.

show abstract

Section: Related Workmentioning

confidence: 99%

Canine Algorithm for Node Disjoint Paths

Ammal

Sajimon

2020

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…It is shown that the problem of finding maximally disjoint paths is NP-hard in [11]. An interesting review of the subject can be found in [12].…”

Section: Related Workmentioning

confidence: 99%

SHERPA: A SDN Multipath Approach to Eliminate Resilience Impact on Video Streams

Colombo

Lepage

Kopp

et al. 2018

2018 IEEE 18th International Conference on Communication Technology (ICCT)

View full text Add to dashboard Cite

In content delivery network, Quality of Experience (QoE) provides two major performance indicators that are availability and continuity of service. As a consequence, network robustness has become a major concern for network operators. TDF operates a traditional transport network for video and audio transport. Any failure on the network causes a recovery time implying loss and an impact in the content viewing. This illustrate that service continuity is a direct consequence of network availability. This work aims to propose a Software Defined Networking (SDN) architecture [1] in which the controller uses its knowledge of the performance and bandwidth allocation to compute redundant disjoint paths. Two maximally linkindependent paths carrying the same stream over the network are deployed. When a failure occurs, at least one of the paths is still active, eliminating any discontinuity on the content viewing. This paper is focused on the Path Computation Element, which is based on Suurballe-Tarjan algorithm [2].

show abstract

“…One can solve the MIDCP problem over G 0 by solving the MIP problem over G 1 . Since the MIP problem is known to be N P-hard [7], then by reduction the MIDCP is N P-hard.…”

Section: B N P-hardnessmentioning

confidence: 99%

Two SDN Multi-tree Approaches for Constrained Seamless Multicast

Colombo

Lepage

Kopp

et al. 2018

2018 IEEE International Conference on Computational Science and Engineering (CSE)

View full text Add to dashboard Cite

In Content Delivery Networks (CDN), Quality of Experience (QoE) provides two major performance indicators that are availability and continuity of service. As a consequence, network robustness has become a major concern for network operators. TDF operates a traditional transport network for video and audio transport through multicast. Any failure on the network causes a recovery time implying loss and an impact in the content viewing. This illustrate that service continuity is a direct consequence of network availability. This work aims to propose a Software Defined Networking (SDN) architecture [1] in which a central controller uses its knowledge of the performance and bandwidth allocation to compute redundant disjoint multicast trees. Two maximally independent trees carrying the same stream over the network are deployed. When a failure occurs, at least one of the trees is still active, eliminating any discontinuity on the content viewing. This paper is focused on the Path Computation Element (PCE), which is based on previous works and the Suurballe-Tarjan algorithm [2]. Two algorithms are presented in this paper, which both fulfill the requirement of the architecture.

show abstract

Finding paths with minimum shared edges

Cited by 19 publications

References 12 publications

Canine Algorithm for Node Disjoint Paths

Canine Algorithm for Node Disjoint Paths

SHERPA: A SDN Multipath Approach to Eliminate Resilience Impact on Video Streams

Two SDN Multi-tree Approaches for Constrained Seamless Multicast

Contact Info

Product

Resources

About