A multi-constrained distributed QoS routing algorithm

Multi-criteria QoS routing has been regarded by researchers as a vital mechanism to support multimedia communications. Unfortunately, finding a qualified path meeting the multiple criteria is indeed a very difficult problem to solve. Multi-path-constrained routing problems are considered to be NP complete, and most existing QoS routing algorithms are based on maintaining global network state at every node. This paper proposes a multi-constrained flooding-based QoS routing with minimum computation and implementation complexity which relies on local link-state information only. It takes the least delay to establish a QoS connection which meets all QoS requirements and addresses the “over-reservation” problem of the flooding-based QoS routing in an elegant and efficient manner. We study the performance of the proposed algorithm, in terms of blocking probability, routing overhead, and connection set-up time, through simulation