Unicast and multicast qos routing with multiple constraints

Authors:
Dan Wang;Funda Ergun;Zhan Xu
Affiliations:
School of Computer Science, Simon Fraser University, Burnaby, Canada;School of Computer Science, Simon Fraser University, Burnaby, Canada;EECS Dept, Case Western Reserve University, Cleveland, OH
Venue:
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Year:
2005

Citing 9
Cited 1

Network flows: theory, algorithms, and applications

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

Mathematics of Operations Research
An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
An improved FPTAS for restricted shortest path

Information Processing Letters
QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters
Evaluation of multicast routing algorithms for real-time communication on high-speed networks

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking

The cost optimal solution of the multi-constrained multicast routing problem

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for the unicast case. We then explore the use of optimization techniques in devising heuristics for QoS routing both in the unicast and multicast settings using algorithmic techniques as well as techniques from optimization theory. We present test results showing that our techniques perform very well in the unicast case. For multicast with multiple constraints, we present the first results that we know of where one can quickly obtain near-optimal, feasible trees.