Path selection under multiple QoS constraints - a practical approach

Authors:
Ran Giladi;Ephraim Korach;Rony Ohayon
Affiliations:
Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel;Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, 84105, Israel;Dept. of Comm. Sys. Eng., Ben-Gurion Univ. of the Negev and Dept. of Indust. Eng. and Mgmt., Ben-Gurion Univ. of the Negev, Beer-Sheva, 84105, Israel (Correspd. ohayonr@bgumail.bgu.ac.il or ronyo@ ...
Venue:
Journal of High Speed Networks
Year:
2004

Citing 13
Cited 1

Solving k-shortest and constrained shortest path problems efficiently

Annals of Operations Research
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
The network inhibition problem

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
QoS routing in networks with uncertain parameters

IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with inaccurate information: theory and algorithms

IEEE/ACM Transactions on Networking (TON)
Routing with end-to-end QoS guarantees in broadband networks

IEEE/ACM Transactions on Networking (TON)
An efficient algorithm for finding a path subject to two additive constraints

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An Approximation Algorithm for Combinatorial Optimization Problems with Two Parameters

An Approximation Algorithm for Combinatorial Optimization Problems with Two Parameters
Search Space Reduction in QoS Routing

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Research: Congestion control based dynamic routing in ATM networks

Computer Communications
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters
Routing subject to quality of service constraints in integrated communication networks

IEEE Network: The Magazine of Global Internetworking

Dynamic SPT update for multiple link state decrements in network routing

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Path selection under multiple additive QoS constraints in high-speed networks is an NP-complete problem. Most of the algorithms proposed for QoS routing suffer from either excessive computational complexities or low performance. In this paper, we propose two practical heuristic algorithms that are based on iterative shortest-path computations with a dynamic cost function. The cost function comprises a combination of several QoS constraints and a single optimization metric. A simulation program evaluates the performance of the algorithms. The simulation results indicate that our algorithms give very high performance and fast running time.