Solving the top-percentile traffic routing problem by approximate dynamic programming

DOI10.1093/IMAMAN/DPS002MaRDI QIDQ3165706zbMATH OpenOpenAlexFDO

Authors Andreas Grothey, Xinan Yang

Publication date 29 October 2012

Published in IMA Journal of Management Mathematics (Search for Journal in Brave)

Full work available at URL http://repository.essex.ac.uk/11686/1/ERGO-10-003.pdf

zbMATH Keywords

approximate dynamic programmingmultihomingrouting policystochastictop-percentile pricing

Mathematics Subject Classification ID

Internet topics (68M11) Traffic problems in operations research (90B20) Integer programming (90C10) Stochastic programming (90C15) Dynamic programming (90C39)

Recommendations

• Top-percentile traffic routing problem by dynamic programming
• 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
• Optimization of Internet interconnection policy in the top percentile pricing framework
• Top percentile network pricing and the economics of multi-homing

Cited in

(6)

• Top-percentile traffic routing problem by dynamic programming
• An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
• 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: Solving the top-percentile traffic routing problem by approximate dynamic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3165706)