Optimal routing for multiclass networks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3954640 (Why is no real title available?)
- scientific article; zbMATH DE number 49749 (Why is no real title available?)
- scientific article; zbMATH DE number 2202834 (Why is no real title available?)
- A Minimum Delay Routing Algorithm Using Distributed Computation
- Braess-like paradoxes in distributed computer systems
- Convex Analysis
- Mathematical optimization and economic theory
- On the convergence of descent methods for monotone variational inequalities
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Optimal static load balancing in distributed computer systems
- Paradoxes in distributed decisions on optimal load balancing for networks of homogeneous computers
- Potential games
- The flow deviation method: An approach to store‐and‐forward communication network design
- Traffic assignment problem for a general network
Cited in
(6)- Optimal Dynamic Routing in Multidestination Networks
- Routeing in a Network with Multi-Class Links
- scientific article; zbMATH DE number 2202834 (Why is no real title available?)
- scientific article; zbMATH DE number 934460 (Why is no real title available?)
- Multi-path routing and resource allocation in active network
- scientific article; zbMATH DE number 3872452 (Why is no real title available?)
This page was built for publication: Optimal routing for multiclass networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q666417)