Concepts of Exact QoS Routing Algorithms

Mieghem, Piet Van; Kuipers, Fernando A.

doi:10.1109/tnet.2004.836112

Cited by 221 publications

(202 citation statements)

References 35 publications

Supporting

Mentioning

201

Contrasting

Unclassified

Order By: Relevance

“…To our knowledge, few works have been proposed to solve the ID-MCP problem using distributed methods. The algorithm proposed in [7] extends the exact algorithm SAMCRA [3] to an interdomain level to solve the ID-MCP problem. The drawback of this algorithm is its high complexity.…”

Section: Definitionmentioning

confidence: 99%

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Frikha

Lahoud

Cousin

2011

Smart Spaces and Next Generation Wired/Wireless Networking

View full text Add to dashboard Cite

Abstract. In this paper we tackle the challenging problem of Quality of Service (QoS) routing in multiple domains. We propose a novel inter-domain QoS routing algorithm named HID-MCP. HID-MCP benefits from two major concepts that ensure high performance in terms of success rate and computational complexity. First, HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Second, HID-MCP integrates crankback mechanisms for improving the path computation results in a single domain or in multiple domains. Extensive simulations confirm the efficiency of our algorithm on randomly generated topologies.

show abstract

Section: Definitionmentioning

confidence: 99%

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Frikha

Lahoud

Cousin

2011

Smart Spaces and Next Generation Wired/Wireless Networking

View full text Add to dashboard Cite

show abstract

“…Therefore the MC(O)P problem has been interpreted as intractable, which, in turn, has spurred the proposals of many heuristics. Only a few exact QoS Routing algorithms such as SAMCRA (Self-Adaptive Multiple Constraints Routing Algorithm [5]) exist. Although QoS Routing algorithmic issues still require attention, the larger part seems to be reasonably well understood.…”

Section: Introductionmentioning

confidence: 99%

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

“…delay variation (jitter). The exact QoS routing algorithm SAMCRA [17] can handle an arbitrarily large amount m of QoS measures (such as time, distance, cost, jitter, etc.) and even returns the optimal path in the m-dimensional space subject to a constraints vector.…”

Section: Introductionmentioning

confidence: 99%

The stability of paths in a dynamic network

Kuipers

Wang

Mieghem

2005

Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology - CoNEXT'05

View full text Add to dashboard Cite

Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information, and in wireless ad hoc networking, signal strength fluctuations complicate the choice of stable paths. In this paper we will focus on the stability of paths in a network with dynamically changing link weights. The level of path stability has a direct relation to the number of updates that are necessary to maintain an accurate view of the network state. If a small change in the network state does not affect the shortest path, then such a change need not be distributed throughout the network. We evaluate path stability by adding noise and observing the change in paths.

show abstract

Concepts of Exact QoS Routing Algorithms

Cited by 221 publications

References 35 publications

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Research challenges in QoS routing

The stability of paths in a dynamic network

Contact Info

Product

Resources

About