A randomized algorithm for finding a path subject to multiple QoS requirements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Conditions that impact the complexity of QoS routing
IEEE/ACM Transactions on Networking (TON)
Finding a path subject to many additive QoS constraints
IEEE/ACM Transactions on Networking (TON)
Loop-free constrained path computation for hop-by-hop QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Heuristic Route Algorithm of Multiple Restrictions Based on Quality of Service
IIH-MSP '08 Proceedings of the 2008 International Conference on Intelligent Information Hiding and Multimedia Signal Processing
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
| Hi-index | 0.00 |
Computing the multi-constrained quality of service (QoS) routing according to multi-dimensions vector will cause that actual transmission route is inconsistent with optimal theoretical route and that QoS cannot meet requirements. To solve this, a novel multi-constrained QoS routing algorithm based on vector converting is proposed. The multi-dimensions vector space, which is composed of multiple additive parameters of each link, is first converted into the single dimension vector space by using functional concept, and then the all routes from source to other node, which meet QoS requirements, can be searched by adopting greedy algorithm in which separates selection of optimal theoretical path and actual transmission path computation. The rationality of proposed algorithm is theoretically analyzed by combination of mathematical method and physical concept and the validity is furthermore confirmed by the simulation results.