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)
Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
A randomized algorithm for finding a path subject to multiple QoS requirements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
An improved FPTAS for restricted shortest path
Information Processing Letters
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
An efficient quality of service routing algorithm for delay-sensitive applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Computers
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
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
SoMR: A scalable distributed QoS multicast routing protocol
Journal of Parallel and Distributed Computing
A polynomial time approximation scheme for timing constrained minimum cost layer assignment
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
A fully polynomial-time approximation scheme for timing-constrained minimum cost layer assignment
IEEE Transactions on Circuits and Systems II: Express Briefs
Edge disjoint paths with minimum delay subject to reliability constraint
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Approximation algorithm for QoS routing with multiple additive constraints
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Self-protecting networking using dynamic p-cycle construction within link capacity constraint
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Reliable adaptive multipath provisioning with bandwidth and differential delay constraints
INFOCOM'10 Proceedings of the 29th conference on Information communications
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic light trail routing in WDM optical networks
Photonic Network Communications
Diameter-constrained steiner tree
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
QoS routing algorithms using fully polynomial time approximation scheme
Proceedings of the Nineteenth International Workshop on Quality of Service
Routing with multiple quality-of-services constraints: An approximation perspective
Journal of Network and Computer Applications
Near linear time (1 + ε)-approximation for restricted shortest paths in undirected graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Path approximation for multi-hop wireless routing under application-based accuracy constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Independent directed acyclic graphs for resilient multipath routing
IEEE/ACM Transactions on Networking (TON)
Self-protecting networking using dynamic p-cycle construction within link capacity constraint
Security and Communication Networks
Energy efficient online routing of flows with additive constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
A genetic algorithm for finding a path subject to two constraints
Applied Soft Computing
Efficient algorithms for pursuing moving evaders in terrains
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
Hi-index | 0.00 |
We study the multi-constrained quality-ofservice (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K ≥ 2 additive end-to-end QoS constraints. This problem is NP-hard and is commonly modeled using a graph with n vertices and m edges with K additive QoS parameters associated with each edge. For the case of K = 2, the problem has been well studied, with several provably good polynomial time-approximation algorithms reported in the literature, which enforce one constraint while approximating the other. We first focus on an optimization version of the problem where we enforce the first constraint and approximate the other K - 1 constraints. We present an O(mn log log n + mn/ε) time (1 + ε) (K - 1) -approximation algorithm and an O(mn log log n + m(n/ε)K-1) time (1 + ε) -approximation algorithm, for any ε 0. When K is reduced to 2, both algorithms produce an (1 + ε) -approximation with a time complexity better than that of the best-known algorithm designed for this special case. We then study the decision version of the problem and present an O(m(n/ε)K-1) time algorithm which either finds a feasible solution or confirms that there does not exist a source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint. If there exists an H-hop source-destination path whose first weight is bounded by the first constraint and whose every other weight is bounded by (1 - ε) times the corresponding constraint, our algorithm finds a feasible path in O(m(H/ε)K-1 time. This algorithm improves previous best-known algorithms with O((m + n log n)n/ε) time for K = 2 and O(mn(n/ε)K-1) time for K ≥ 2.