A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Constraint-based routing is an invaluable part of a full-fledged Quality of Service architecture. Unfortunately, QoS routing with multiple additive constraints is known to be a NP-complete problem. Hence, accurate constraint-based routing algorithms with a fast running time are scarce, perhaps even non-existent. The expected impact of such an efficient constraint-based routing algorithm has resulted in the proposal of numerous heuristics and a few exact QoS algorithms. This chapter presents adoi:10.1002/9781119114864.ch4 fatcat:dqz5ireoprbk5cey4lk2qvfpg4