Quality-of-service routing using maximally disjoint paths

Taft-Plotkin, N.; Bellur, Bhargav; Ogier, Richard G.

doi:10.1109/iwqos.1999.766485

Cited by 68 publications

(39 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Taft-Plotkin et al [121] extended the approach of Suurballe and Tarjan in two ways: (1) they return maximally disjoint paths, and (2) they also take bandwidth into account. Their algorithm, called MADSWIP, computes maximumbandwidth maximally disjoint paths and minimizes the total weight as a secondary objective.…”

Section: Min-sum Disjoint Pathsmentioning

confidence: 99%

“…Banner and Orda proved that, under the single-link failure model, at most two paths are needed to establish a p-survivable connection, if it exists. Based on this observation, they studied and proposed algorithms for several problem variants, namely establishing p-survivable-B-bandwidth, most survivable, and widest psurvivable connections for 1 : 1 and 1 + 1 protection architectures (the MADSWIP algorithm [121] can also be used to find the most survivable connection). The p-survivable-Bbandwidth problem asks for a connection with survivability ≥ p and bandwidth ≥ B and solving it provides a foundation for solving the other problems.…”

Section: Probabilistic Survivabilitymentioning

confidence: 99%

See 1 more Smart Citation

An Overview of Algorithms for Network Survivability

Kuipers

2012

ISRN Communications and Networking

View full text Add to dashboard Cite

Network survivability-the ability to maintain operation when one or a few network components fail-is indispensable for present-day networks. In this paper, we characterize three main components in establishing network survivability for an existing network, namely, (1) determining network connectivity, (2) augmenting the network, and (3) finding disjoint paths. We present a concise overview of network survivability algorithms, where we focus on presenting a few polynomial-time algorithms that could be implemented by practitioners and give references to more involved algorithms.

show abstract

Section: Min-sum Disjoint Pathsmentioning

confidence: 99%

Section: Probabilistic Survivabilitymentioning

confidence: 99%

An Overview of Algorithms for Network Survivability

Kuipers

2012

ISRN Communications and Networking

View full text Add to dashboard Cite

show abstract

“…Heuristic algorithms based on matrix calculation [28] or recursive matrix-calculation [20] [27], involves a modified version of the S-T algorithm to find a pair of disjoint paths. MADSWIP can produce a pair of widest or shortest maximally link-disjoint paths from a source node to all other nodes.…”

Section: Link-disjoint Paths Routing In One Dimensionmentioning

confidence: 99%

Link‐disjoint paths for reliable QoS routing

Guo

Kuipers

Mieghem

2003

Int J Communication

View full text Add to dashboard Cite

Abstract:The problem of finding link/node-disjoint paths between a pair of nodes in a network has received much attention in the past. This problem is fairly well understood when the links in a network are only specified by a single link weight. However, in the context of Quality of Service routing, links are specified by multiple link weights and restricted by multiple constraints. Unfortunately, the problem of finding link/node disjoint paths in multiple dimensions faces different conceptual problems. This paper presents a first step to understanding these conceptual problems in link-disjoint Quality of Service routing and proposes a heuristic link-disjoint QoS algorithm that circumvents these problems.

show abstract

“…For example t he Maximum Disjoint Paths [16] and the Minimum Interference Routing [9] algorithm-although making use of Dijkstra's algorithm-would need individual adaptations to honor prohibited turns. Thus, a general purpose concept that allows for an arbitrary combination of routing algorithms with feed-forward mechanisms is needed.…”

Section: The Challenge Of Routing With Probibited Turnsmentioning

confidence: 99%

Routing in Turn-Prohibition Based Feed-Forward Networks

Fidler

Einhoff

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The application of queuing theory to communications systems often requires that the respective networks are of a feed-forward nature, that is they have to be free of cyclic dependencies. An effective way to ensure this property is to identify a certain set of critical turns and to prohibit their use. A turn is a concatenation of two adjacent, consecutive links. Unfortunately, current routing algorithms are usually not equipped to handle forbidden turns and the required extensions are nontriviaL We discuss the relevant issues for the example of the widely deployed Dijkstra algorithm. Then, we address the general case and introduce the Turnnet concept, which supports arbitrary combinations of routing algorithms with turn-prohibiting feed-forward mechanisms.

show abstract

Quality-of-service routing using maximally disjoint paths

Cited by 68 publications

References 5 publications

An Overview of Algorithms for Network Survivability

An Overview of Algorithms for Network Survivability

Link‐disjoint paths for reliable QoS routing

Routing in Turn-Prohibition Based Feed-Forward Networks

Contact Info

Product

Resources

About