Fast and efficient flooding based QoS routing algorithm

Multi-criteria QoS routing has been regarded by researchers as a vital mechanism to support multimedia communications. Unfortunately, finding an optimal path meeting the multi-criteria is indeed a very difficult problem to solve. This paper proposes a new QoS routing algorithm which can meet multi-criteria routing constraints, is simple to implement, and is robust. In brief, our approach is a bounded flood routing with multiple constraint checking and quick pruning at routers/switches. The quick pruning mechanism releases reserved resources at nodes not belonging to the final path, as early as possible during flooding. Bounding the flooding area within a reasonable scope reduces the routing overhead. Analysis and simulation study demonstrate that the proposed algorithm is superior to a similar flood routing scheme in terms of blocking probability, overhead and connection set-up time