Enhanced Fallback+ : An Efficient Multiconstraint Path Selection Algorithm for QoS Routing
-
- KINOSHITA Kazuhiko
- Department of Information Networking, Graduate School of Information Science and Technology, Osaka University
-
- TANIOKA Hideaki
- Department of Information Systems Engineering, Graduate School of Engineering, Osaka University
-
- TAKINE Tetsuya
- Department of Communication Engineering, Graduate School of Engineering, Osaka University
-
- MURAKAMI Koso
- Department of Information Networking, Graduate School of Information Science and Technology, Osaka University
この論文をさがす
抄録
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 Fallbacks, 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 Fallbacks, compared with the original Fallback+ and other existing path selection algorithms.
収録刊行物
-
- IEICE transactions on communications
-
IEICE transactions on communications 87 (9), 2708-2718, 2004-09-01
一般社団法人電子情報通信学会
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1574231877062546432
-
- NII論文ID
- 110003222551
-
- NII書誌ID
- AA10826261
-
- ISSN
- 09168516
-
- 本文言語コード
- en
-
- データソース種別
-
- CiNii Articles