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)
Routing in the Internet (2nd ed.)
Routing in the Internet (2nd ed.)
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Introduction to Algorithms
An improved FPTAS for restricted shortest path
Information Processing Letters
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
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
Multiconstrained QoS Routing: A Norm Approach
IEEE Transactions on Computers
Approximation algorithm for the temperature-aware scheduling problem
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
SoMR: A scalable distributed QoS multicast routing protocol
Journal of Parallel and Distributed Computing
Polynomial time approximation algorithms for multi-constrained QoS routing
IEEE/ACM Transactions on Networking (TON)
Engineering of Software-Intensive Systems: State of the Art and Research Challenges
Software-Intensive Systems and New Computing Paradigms
A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths
EUNICE '09 Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future
Adaptive configuration of pervasive computing system with QoS consideration
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
A multi-constrained quality of service routing algorithm based on vector converting
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Reliable adaptive multipath provisioning with bandwidth and differential delay constraints
INFOCOM'10 Proceedings of the 29th conference on Information communications
Quality of Service in mobile ad hoc networks: a survey
International Journal of Ad Hoc and Ubiquitous Computing
Routing through an integrated communication and social network
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
International Journal of Communication Networks and Distributed Systems
A survey on multi-constrained optimal path computation: Exact and approximate algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
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
Computing mobile agent routes with node-wise constraints in distributed communication systems
MICAI'11 Proceedings of the 10th Mexican international conference on Advances in Artificial Intelligence - Volume Part I
Energy efficient online routing of flows with additive constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design of human-centric adaptive multimodal interfaces
International Journal of Human-Computer Studies
Exploring routing with multiple Quality of Service parameters in High-Speed Networks
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Multi-robot navigation based QoS routing in self-organizing networks
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
A fundamental problem in quality-of-service (QoS) routing is to find a path between a source-destination node pair that satisfies two or more end-to-end QoS constraints. We model this problem using a graph with n vertices and m edges with K additive QoS parameters associated with each edge, for any constant K ≥ 2. This problem is known to be NP-hard. Fully polynomial time approximation schemes (FPTAS) for the case of K = 2 have been reported in the literature. We concentrate on the general case and make the following contributions. 1) We present a very simple O(Km + nlogn) time K -approximation algorithm that can be used in hop-by-hop routing protocols. 2) We present an FPTAS for one optimization version of the QoS routing problem with a time complexity of O(m(n/ε)K-1).3) We present an FPTAS for another optimization version of the QoS routing problem with a time complexity of O(n log n + m(H/ε)K-1) when there exists an H-hop path satisfying all QoS constraints. When K is reduced to 2, our results compare favorably with existing algorithms. The results of this paper hold for both directed and undirected graphs. For ease of presentation, undirected graph is used.