Multi-postpath-based lookahead multiconstraint QoS routing
From MaRDI portal
(Redirected from Publication:378623)
Recommendations
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- A flow and routing control policy for communication networks with multiple competitive users
- Algorithms for finding paths with multiple constraints
- Approximation Schemes for the Restricted Shortest Path Problem
- Helping ants for adaptive network routing
- Highly responsive and efficient QoS routing using pre- and on-demand computations along with a new normal measure
- Multicast routing algorithm of multiple QoS based on widest-bandwidth
- On the complexity of quality of service routing
- The shortest path problem with two objective functions
Cited in
(4)- scientific article; zbMATH DE number 1955773 (Why is no real title available?)
- scientific article; zbMATH DE number 1969707 (Why is no real title available?)
- Loop-free constrained path computation for hop-by-hop QoS routing
- To converge more quickly and effectively -- mean field annealing based optimal path selection in WMN
This page was built for publication: Multi-postpath-based lookahead multiconstraint QoS routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378623)