Link‐disjoint paths for reliable QoS routing

Guo, Yuchun; Kuipers, Fernando A.; Mieghem, Piet Van

doi:10.1002/dac.612

Cited by 95 publications

(72 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The most important methods include: Shortest Pair of Link Disjoint Paths (SPLP) [14], k-Disjoint Paths method (KDPM) [4,25], and k-Penalty algorithm [22] as follows.…”

Section: Heuristic Approachesmentioning

confidence: 99%

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

2013

View full text Add to dashboard Cite

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 by deployment costs, technical constraints, and backward compatibility, this will not mean that all demands will be routed in all-optical way in the near future.Nowadays, operators are mostly willing to dedicate only a given ratio of their power budget to all-optical routing. This in turn implies a new problem to be solved: operators have to find a way to select demands that should be routed in all-optical way and which should not. The problem gets even more complicated, if we add demand protection issues.In this paper, we introduce and evaluate methods able to maximize the number of demands routed with protection in all-optical way in capacity-constrained networks with limitations on path lengths according to physical impairments.

show abstract

“…The most important methods include: Shortest Pair of Link Disjoint Paths (SPLP) [14], k-Disjoint Paths method (KDPM) [4,25], and k-Penalty algorithm [22] as follows.…”

Section: Heuristic Approachesmentioning

confidence: 99%

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

2013

View full text Add to dashboard Cite

show abstract

“…Ramasubramanian et al [128] proposed a distributed algorithm for computing two disjoint trees. Guo et al [129] considered finding two link-disjoint paths subject to multiple Quality-of-Service constraints. …”

Section: Min-sum Disjoint Pathsmentioning

confidence: 99%

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

“…In [18] and [19] the most relevant of QoS algorithms are described and evaluated via simulations: SAMCRA performed best. However, SAMCRA may possibly be improved, which requires a good understanding of the complexity of QoS Routing itself.…”

Section: Algorithmic Aspects In Qos Routingmentioning

confidence: 99%

“…-Extensions to multicast QoS Routing such as MAMCRA [22] need to be explored further. -Extensions to link-disjoint QoS Routing such as DIMCRA [18] need to be explored further.…”

Section: Algorithmic Aspects In Qos Routingmentioning

confidence: 99%

“…To surmount these disadvantages, other methods have been devised to find a pair of shortest link-disjoint paths with minimal total length. Unfortunately, as shown in [18], these techniques are not easily extended to link-disjoint QoS Routing, where the objective is to find two (maximally) link-disjoint paths that obey the constraints and that preferably have minimal total length. Kuipers …”

Section: Link-disjoint Routingmentioning

confidence: 99%

See 1 more Smart Citation

Research challenges in QoS routing

Masip-Bruin¹,

Yannuzzi

Domingo‐Pascual³

et al. 2006

Computer Communications

View full text Add to dashboard Cite

Quality of Service Routing is at present an active and remarkable research area, since most emerging network services require specialized Quality of Service (QoS) functionalities that cannot be provided by the current QoS-unaware routing protocols. The provisioning of QoS based network services is in general terms an extremely complex problem, and a significant part of this complexity lies in the routing layer. Indeed, the problem of QoS Routing with multiple additive constraints is known to be NP-hard. Thus, a successful and wide deployment of the most novel network services demands that we thoroughly understand the essence of QoS Routing dynamics, and also that the proposed solutions to this complex problem should be indeed feasible and affordable. This article surveys the most important open issues in terms of QoS Routing, and also briefly presents some of the most compelling proposals and ongoing research efforts done both inside and outside the E-Next Community to address some of those issues. q

show abstract

Link‐disjoint paths for reliable QoS routing

Cited by 95 publications

References 19 publications

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

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

An Overview of Algorithms for Network Survivability

Research challenges in QoS routing

Contact Info

Product

Resources

About