Approximation of Pareto optima in multiple-objective, shortest-path problems
Operations Research
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for Multiconstrained Quality-of-Service Routing
IEEE Transactions on Computers
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Two techniques for fast computation of constrained shortest paths
IEEE/ACM Transactions on Networking (TON)
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
RSVP: a new resource reservation protocol
IEEE Communications Magazine - Part Anniversary
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
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Finding a path that satisfies multiple Quality-of-Service (QoS) constraints is vital to the deployment of current emerged services. However, existing algorithms are not very efficient and effective at finding such a path. Moreover, few works focus on three or more QoS constraints. In this paper, we present an enhanced version of fully polynomial time approximation scheme (EFPTAS) for multiconstrainted path optimal (MCOP) problem. Specifically, we make four major contributions. We first allow the proposed algorithm to construct an auxiliary graph, through which the QoS parameters on each of the finding path can be guaranteed not to exceed the given constraints. Then we adopt a concept, called nonlinear definition of path constraints in EFPTAS for reducing both time and space complexity. Also, we enable EFPTAS to run iteratively to facilitate a progressive refinement of the finding result. In addition to these, we identify some ''deployment'' issues for proposed algorithm, the essential steps that how and when the EFPTAS takes place are presented. By analyzing the proposed algorithm theoretically, we find that the presented EFPTAS can find a (1+@e)-approximation path in the network with time complexity O(|E||V|/@e) (where |E| is the number of edges and |V| is the number of nodes), which outperforms the previous best-known algorithm for MCOP. We conduct an extensive comparison between the algorithm presented in this paper and previous best-known study experimentally, our results indicate that EFPTAS can find a path with low complexity and preferable quality.