A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing

DOI10.1007/978-3-642-21527-8_51MaRDI QIDQ3091530zbMATH OpenOpenAlexDBLPWikidataFDO

Authors E. Amaldi, Antonio Capone, Luca G. Gianoli, Luca Mascetti

Publication date 9 September 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-21527-8_51

Mathematics Subject Classification ID

Internet topics (68M11) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Energy-aware routing algorithm based on combination optimization theory
• Simultaneous routing and flow rate optimization in energy-aware computer networks
• Approximating energy efficient paths in wireless multi-hop networks
• Energy-efficient network routing with discrete cost functions
• A hybrid multicommodity routing algorithm for traffic engineering
• scientific article; zbMATH DE number 7121919

Cited in

(8)

• Model-based evaluation of the power versus performance of network routing algorithms
• Minimizing energy and link utilization in ISP backbone networks with multi-path routing: a bi-level approach
• Simultaneous routing and flow rate optimization in energy-aware computer networks
• Energy-efficient network routing with discrete cost functions
• Energy-aware survivable networks
• Robust energy-aware routing with redundancy elimination
• Survivable green traffic engineering with shared protection
• Two-stage algorithm for bi-objective black-box traffic engineering

This page was built for publication: A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing

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