A quality of service multi-constraints routing algorithm based on dynamic programming

DOI10.11908/J.ISSN.0253-374X.2015.02.023MaRDI QIDQ3193755zbMATH OpenFDO

Authors Dalu Zhang, Zhiguo Hu, Zengmei Kuang

Publication date 28 October 2015

Full work available at URL https://doi.org/10.11908/J.ISSN.0253-374X.2015.02.023

zbMATH Keywords

dynamic programmingmulti-constraintsquality-of-serviceself-adaptive

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Dynamic programming (90C39)

Recommendations

• Efficient QoS routing.
• Multi-constraint quality of service routing algorithm for dynamic topology networks
• Delay-constrained least-cost routing algorithm
• scientific article; zbMATH DE number 2220137
• Algorithm for multi-constrained path selection based on experimental analysis

Cited in

(12)

• A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks
• A service recovery method based on Bellman dynamic programming
• Multi-constraint quality of service routing algorithm for dynamic topology networks
• Algorithms for the Multi-constrained Routing Problem
• Delay-constrained least-cost routing algorithm
• Algorithm for multi-constrained path selection based on experimental analysis
• Multi-constraint QoS routing algorithm based on selective flooding in IPv6
• Optimal path algorithm with multi-constrained condition
• Interpolative Boolean algebra based multicriteria routing algorithm
• An approach of service recovery decision-making based on Bellman dynamic programming
• Precomputation for multi-constrained QoS routing in GMPLS networks
• QCOLONY: A MULTI-PHEROMONE BEST-FIT QoS ROUTING ALGORITHM AS AN ALTERNATIVE TO SHORTEST-PATH ROUTING ALGORITHMS

This page was built for publication: A quality of service multi-constraints routing algorithm based on dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3193755)