Algorithm for multi-constrained path selection based on experimental analysis
From MaRDI portal
Recommendations
- Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure
- Multi-constraint QoS routing algorithm based on selective flooding in IPv6
- A quality of service multi-constraints routing algorithm based on dynamic programming
- Delay-constrained least-cost routing algorithm
- Efficient QoS routing.
Cited in
(6)- A fuzzy-based path ordering algorithm for QoS routing in non-deterministic communication networks
- A quality of service multi-constraints routing algorithm based on dynamic programming
- Multi-constraint QoS routing algorithm based on selective flooding in IPv6
- scientific article; zbMATH DE number 1981025 (Why is no real title available?)
- To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN
- scientific article; zbMATH DE number 2202216 (Why is no real title available?)
This page was built for publication: Algorithm for multi-constrained path selection based on experimental analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423685)