QoS routing algorithms using fully polynomial time approximation scheme

Authors:
Jun Huang;Yoshiaki Tanaka
Affiliations:
Beijing University of Posts and Telecommunications, Beijing, China, GITI, Waseda University, Tokyo, Japan;Waseda University, Tokyo, Japan
Venue:
Proceedings of the Nineteenth International Workshop on Quality of Service
Year:
2011

Citing 9
Cited 0

Approximation of Pareto optima in multiple-objective, shortest-path problems

Operations Research
Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Introduction to Algorithms

Introduction to Algorithms
An improved FPTAS for restricted shortest path

Information Processing Letters
Finding a path subject to many additive QoS constraints

IEEE/ACM Transactions on Networking (TON)
Polynomial time approximation algorithms for multi-constrained QoS routing

IEEE/ACM Transactions on Networking (TON)
MOEAQ: A QoS-Aware Multicast Routing algorithm for MANET

Expert Systems with Applications: An International Journal
An overview of constraint-based path selection algorithms for QoS routing

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

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Routing with end-to-end Quality-of-Service (QoS) guarantees is a key to the widespread deployment of recent emerged services. Developing QoS routing algorithm in the network is an important open topic. This paper investigates the QoS routing related problems and proposes a Fully Polynomial Time Approximation Scheme (FPTAS) for QoS routing. In the proposed FPTAS, a graph-extending based dynamic programming approach is developed, and an extended version of the proposed algorithm is studied. The theoretical analyses show that the proposed algorithms outperform the previous best-known studies.