For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Enhanced Fallback+: An Efficient Multiconstraint Path Selection Algorithm for QoS Routing
Kazuhiko KINOSHITA Hideaki TANIOKA Tetsuya TAKINE Koso MURAKAMI
IEICE TRANSACTIONS on Communications
Publication Date: 2004/09/01
Print ISSN: 0916-8516
Type of Manuscript: PAPER
QoS routing, path selection algorithm, multiconstraint optimal path problem, Fallback algorithm, Dijkstra's algorithm,
Full Text: PDF(916.3KB)
>>Buy this Article
In future high-speed networks, provision of diverse multimedia services with strict quality-of-service (QoS) requirements, such as bandwidth, delay and so on, is desired. QoS routing is a possible solution to handle these services. Generally, a path selection for QoS routing is formulated as a shortest path problem subject to multiple constraints. However, it is known to be NP-complete when more than one QoS constraint is imposed. As a result, many heuristic algorithms have been proposed so far. The authors proposed a path selection algorithm Fallback+ for QoS routing, which focuses not only on the path selection with multiple constraints but also on the efficient use of network resources. This paper proposes an enhanced version of Fallback+, named Enhanced Fallback+, where in a shrewd way, it keeps tentative paths produced in the conventional Fallback algorithm with Dijkstra's algorithm. Simulation experiments prove the excellent performance of Enhanced Fallback+, compared with the original Fallback+ and other existing path selection algorithms.