Data networks (2nd ed.)
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A Power Benchmarking Framework for Network Devices
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Energy-aware traffic engineering
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Routing and scheduling for energy and delay minimization in the powerdown model
INFOCOM'10 Proceedings of the 29th conference on Information communications
Energy-aware routing in data center network
Proceedings of the first ACM SIGCOMM workshop on Green networking
Greening backbone networks: reducing energy consumption by shutting off cables in bundled links
Proceedings of the first ACM SIGCOMM workshop on Green networking
GreenTE: Power-aware traffic engineering
ICNP '10 Proceedings of the The 18th IEEE International Conference on Network Protocols
Identifying and using energy-critical paths
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Routing for power minimization in the speed scaling model
IEEE/ACM Transactions on Networking (TON)
Update: Energy-Efficient Ethernet
IEEE Spectrum
Energy efficient online routing of flows with additive constraints
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Energy inefficiencies in current networks provide both challenges and opportunities for energy saving. Recently, there are many works focusing on minimizing energy cost from the routing perspective. However, most existing work view them as optimization problems and solve them in a centralized manner such as with a solver or using approximations. In this paper, we focus on a network-wide bi-objective optimization problem, which simultaneously minimizes the total energy consumption using speed scaling and the total traffic delay. We propose a hop-by-hop dynamic distributed routing scheme for the implementation of this network-wide optimization problem. Our scheme is more practical to realize in large distributed networks compared with current centralized energy minimization methods. We can also achieve near global optimal in a distributed manner, while most used shortest path routing protocols such as OSPF cannot make it. Our routing scheme is totally distributed and maintains loop-free routes in every instant. Simulations conducted in real data sets show that the distributed loop-free routing scheme converges to near Pareto optimal values. Also, our method outperforms the widely applied shortest path routing strategy by 30% in energy saving.