Shortest Path Green Routing and the Importance of Traffic Matrix Knowledge

Mariusz Kamola , Piotr Przemyslaw Arabas


Energy-efficient traffic engineering for wired network poses a number of difficulties due to equipment and protocols diversity and complexity. If emerging optimization are to be formulated exactly, they are intractable. This is why numerous heuristics for approximate solutions are proposed. They differ in assumptions on the routing scheme in the network, and also on the availability (and usefulness) of traffic-related or measurement-based power consumption data. Those most interesting w.r.t. authors' work are presented and classified. The authors propose a number of strategies for switching the links on or off, which are still worthy consideration - while the routing scheme stays in control of some shortest-distance mechanism, like OSPF. Operation of the algorithms is verified for two standard test cases, resulting in proposed further improvements and hints on implementation details. Published in:
Author Mariusz Kamola (FEIT / AK)
Mariusz Kamola,,
- The Institute of Control and Computation Engineering
, Piotr Przemyslaw Arabas (FEIT / AK) - [Scientific and Academic Computer Network (NASK PIB)]
Piotr Przemyslaw Arabas,,
- The Institute of Control and Computation Engineering
- Naukowa i Akademicka Sieć Komputerowa
Publication size in sheets0.5
Book 2013 24th Tyrrhenian International Workshop on Digital Communications – Green ICT, 2013, ISBN 978-1-4799-0755-7
Languageen angielski
Kamola13b.pdf 215.46 KB
Score (nominal)15
Score sourceconferenceIndex
ScoreMinisterial score = 10.0, 18-05-2020, BookChapterMatConfByIndicator
Ministerial score (2013-2016) = 15.0, 18-05-2020, BookChapterMatConfByIndicator
Publication indicators WoS Citations = 5; GS Citations = 3.0
Citation count*3 (2016-01-09)
Share Share

Get link to the record

* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Are you sure?