Top-percentile traffic routing problem by dynamic programming
From MaRDI portal
Publication:2443403
Recommendations
- Solving the top-percentile traffic routing problem by approximate dynamic programming
- Approximate dynamic programming with Bézier curves/surfaces for top-percentile traffic routing
- Top percentile network pricing and the economics of multi-homing
- Traffic regulation with single- and dual-homed isps under a percentile-based pricing policy
- Optimization of Internet interconnection policy in the top percentile pricing framework
Cites work
- A manufacturing network design model based on processor and worker capabilities
- Approximate Dynamic Programming
- Competitive routing in networks with polynomial costs
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Introduction to Stochastic Programming
- Top percentile network pricing and the economics of multi-homing
Cited in
(5)- Solving the top-percentile traffic routing problem by approximate dynamic programming
- Optimization of Internet interconnection policy in the top percentile pricing framework
- Approximate dynamic programming with Bézier curves/surfaces for top-percentile traffic routing
- Traffic regulation with single- and dual-homed isps under a percentile-based pricing policy
- Top percentile network pricing and the economics of multi-homing
This page was built for publication: Top-percentile traffic routing problem by dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2443403)
