Average case complete problems
SIAM Journal on Computing
Generating correlated random variates based on an analogy between correlation and force
WSC '94 Proceedings of the 26th conference on Winter simulation
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
On the complexity of quality of service routing
Information Processing Letters
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
Complexity-theoretic models of phase transitions in search problems
Theoretical Computer Science
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
Computational Complexity and Phase Transitions
COCO '00 Proceedings of the 15th Annual IEEE Conference on Computational Complexity
PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH
Probability in the Engineering and Informational Sciences
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
On the complexity of QoS routing
Computer Communications
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Performance evaluation of constraint-based path selection algorithms
IEEE Network: The Magazine of Global Internetworking
Two additive-constrained path selection in the presence of inaccurate state information
Computer Communications
QUORUM: quality of service in wireless mesh networks
Mobile Networks and Applications
Multi-cost job routing and scheduling in Grid networks
Future Generation Computer Systems
Design and performance analysis of an inductive QoS routing algorithm
Computer Communications
QUORUM: quality of service routing in wireless mesh networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
A distributed parallel QoS routing algorithm with multi-path probing
CCDC'09 Proceedings of the 21st annual international conference on Chinese Control and Decision 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
Quality of Service in mobile ad hoc networks: a survey
International Journal of Ad Hoc and Ubiquitous Computing
Solving QoS routing problems by DCA
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Unicast QoS routing in overlay networks
Network performance engineering
Optimized multi constrained path quality of service routing protocol
WSEAS Transactions on Information Science and Applications
A state-dependent time evolving multi-constraint routing algorithm
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
A novel paths algebra-based strategy to flexibly solve the link mapping stage of VNE problems
Journal of Network and Computer Applications
Hi-index | 0.00 |
Finding a path in a network based on multiple constraints (the MCP problem) is often considered an integral part of quality of service (QoS) routing. QoS routing with constraints on multiple additive measures has been proven to be NP-complete. This proof has dramatically influenced the research community, resulting into the common belief that exact QoS routing is intractable in practice. However, to our knowledge, no one has ever examined which "worst cases" lead to intractability. In fact, the MCP problem is not strong NP-complete, suggesting that in practice an exact QoS routing algorithm may work in polynomial time. The goal of this paper is to argue that in practice QoS routing may be tractable. We will provide properties, an approximate analysis, and simulation results to indicate that NP-completeness hinges on four conditions, namely: 1) the topology; 2) the granularity of link weights; 3) the correlation between link weights; and 4) the constraints. We expect that, in practice, these conditions are manageable and therefore believe that exact QoS routing is tractable in practice.