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
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
Search Space Reduction in QoS Routing
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
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,
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
ICCC '02 Proceedings of the 15th international conference on Computer communication
Implications for QoS provisioning based on traceroute measurements
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
MAMCRA: a constrained-based multicast routing algorithm
Computer Communications
On the complexity of QoS routing
Computer Communications
| Hi-index | 0.00 |
QoS routing is expected to be an essential building block of a future, efficient and scalable QoS-aware network architecture. We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. The complexity of SAMCRA is analyzed. Because SAMCRA is an exact algorithm, most findings can be applied to QoS routing in general.The second part of this paper discusses how routing with multiple independent constraints affects the hopcount distribution. Both the complexity as the hopcount analysis indicate that for a special class of networks, QoS routing exhibits features similar to single-parameter routing.