On the complexity of QoS routing

Authors:
P. Van Mieghem;F. A. Kuipers
Affiliations:
Information Technology and Systems, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands;Information Technology and Systems, Delft University of Technology, P.O. Box 5031, 2600 GA Delft, The Netherlands
Venue:
Computer Communications
Year:
2003

Citing 9
Cited 11

Average case complete problems

SIAM Journal on Computing
On the Average Number of Maxima in a Set of Vectors and Applications

Journal of the ACM (JACM)
Hop-by-hop quality of service routing

Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS Routing: Average Complexity and Hopcount in m Dimensions

COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH

Probability in the Engineering and Informational Sciences
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,

Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
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

Survey of QoS routing

ICCC '02 Proceedings of the 15th international conference on Computer communication
Concepts of exact QoS routing algorithms

IEEE/ACM Transactions on Networking (TON)
Conditions that impact the complexity of QoS routing

IEEE/ACM Transactions on Networking (TON)
Multi-constrained soft-QoS provisioning in wireless sensor networks

QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Traffic driven multiple constraint-optimisation for QoS routing

International Journal of Internet Protocol Technology
Multiconstrained QoS multipath routing in wireless sensor networks

Wireless Networks
Cross-Layer Design for QoS in Wireless Mesh Networks

Wireless Personal Communications: An International Journal
Approximation algorithm for QoS routing with multiple additive constraints

ICC'09 Proceedings of the 2009 IEEE international conference on Communications
A survey on multi-constrained optimal path computation: Exact and approximate algorithms

Computer Networks: The International Journal of Computer and Telecommunications Networking
Joint multi-cost routing and power control in wireless ad hoc networks

Wireless Networks
Solving QoS routing problems by DCA

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II

Quantified Score

Hi-index	0.24

Visualization

Abstract

We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. Because SAMCRA is an exact algorithm, its complexity also characterizes that of QoS routing in general. The complexity of SAMCRA is simulated in specific classes of graphs. Since the complexity of an algorithm involves a scaling of relevant parameters, the second part of this paper analyses how routing with multiple independent link weights affects the hopcount distribution. Both the complexity and the hopcount analysis indicate that for a special class of networks, QoS routing exhibits features similar to single-parameter routing. These results suggest that there may exist classes of graphs in which QoS routing is not NP-complete.