Single-path routing of stochastic flows in networks
From MaRDI portal
Publication:2275571
Recommendations
Cites work
- A survey on statistical bandwidth sharing
- Algorithms for the single-source uncapacitated minimum concave-cost network flow problem
- An approach to robust network design in telecommunications
- Chance-constrained stochastic programming for integrated services network management
- Evolving system architectures for multimedia network design
- scientific article; zbMATH DE number 1187214 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 932427 (Why is no real title available?)
- Multi-layer MPLS network design: The impact of statistical multiplexing
- Optimal routing for minimizing the maximal link congestion
- Robust capacity assignment in telecommunications
- Robust solutions of linear programming problems contaminated with uncertain data
- Routing of uncertain traffic demands
- The Price of Robustness
- Time-Varying Network Tomography: Router Link Data
Cited in
(3)
This page was built for publication: Single-path routing of stochastic flows in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275571)