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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
