Efficient QoS routing

Authors:
Stavroula Siachalou;Leonidas Georgiadis
Affiliations:
Power Systems Laboratory, Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki 54006, Greece;Power Systems Laboratory, Department of Electrical and Computer Engineering, Aristotle University of Thessaloniki, Thessaloniki 54006, Greece
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2003

Citing 9
Cited 6

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Computing shortest paths for any number of hops

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

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

Operations Research Letters

Justifying the Use of a Bespoke Management System for Experimental Research on Programmable Test Beds

BT Technology Journal
Algorithms for precomputing constrained widest paths and multicast trees

IEEE/ACM Transactions on Networking (TON)
Replicated Server Placement with QoS Constraints

IEEE Transactions on Parallel and Distributed Systems
Multiconstrained QoS Routing: A Norm Approach

IEEE Transactions on Computers
Fast and efficient routing algorithms for delay-bounded and dependable channels

Computer Communications
Replicated server placement with qos constraints

QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of routing in a network where quality of service constraints are placed on network traffic. We provide two optimal algorithms that are based on determining the discontinuities of functions related to the optimization at hand. The proposed algorithms have pseudopolynomial worst case running time and for a wide variety of tested networks they have fairly satisfactory running times. They perform significantly better than the algorithm based on the direct application of the dynamic programming equations and can also be used in conjunction with known polynomial-time approximation algorithms to provide good average case behavior, in addition to guaranteeing polymonial worst-case running time.