Energy-efficient network routing with discrete cost functions

DOI10.1007/978-3-642-29952-0_32MaRDI QIDQ2898042zbMATH OpenOpenAlexFDO

Authors Antonio Fernández Anta, Fa Zhang, Chenying Hou, Zhi-Yong Liu, Lin Wang

Publication date 16 July 2012

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-29952-0_32

zbMATH Keywords

approximationnetwork optimizationnetwork routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
• Simultaneous routing and flow rate optimization in energy-aware computer networks
• Routing and scheduling for energy and delay minimization in the powerdown model
• Energy consumption minimization in ad hoc wireless and multi-interface networks
• A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing

Cited in

(7)

• Simultaneous routing and flow rate optimization in energy-aware computer networks
• A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing
• scientific article; zbMATH DE number 7403890 (Why is no real title available?)
• Robust energy-aware routing with redundancy elimination
• Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
• Routing and scheduling for energy and delay minimization in the powerdown model
• Grid spanners with low forwarding index for energy efficient networks

This page was built for publication: Energy-efficient network routing with discrete cost functions

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