Home // GREEN 2024, The Ninth International Conference on Green Communications, Computing and Technologies // View article

Evaluating Trade-offs for Green Routing in Communication Networks

Authors:
Jan Kitanovski
Kaspar Zimmermann
Line M. P. Larsen
Sarah Ruepp

Keywords: Green-Routing; Denmark; Path-Finding; algorithms; latency; overhead; carbon cost.

Abstract:
With the demand for high-speed, high-capacity networking increasing each year, it is important to focus on the infrastructure and software running on the networking backbone. A crucial component of this focus is the need for efficient pathfinding algorithms, which can determine the best route for data to travel across a network, and ensuring optimal resource usage and performance. This paper promotes the importance of selecting the best routing algorithm for a specific purpose of data transport, highlighting the trade-offs involved in green routing. It also presents the work and results of a network simulator that uses four different algorithms (Dijkstra’s, A*, Floyd-Warshall, and Depth-First Search) to determine which performs best in a set environment. In terms of latency, Floyd-Warshall showed a 64% improvement over Dijkstras, whereas A* showed a 57% improvement over Dijkstra's. Results indicate that the tradeoff of choosing an algorithm with a lower latency can also result in higher carbon cost.

Pages: 10 to 14

Copyright: Copyright (c) IARIA, 2024

Publication date: November 3, 2024

Published in: conference

ISSN: 2519-8483

ISBN: 978-1-68558-203-6

Location: Nice, France

Dates: from November 3, 2024 to November 7, 2024