@article{10902/37941,
year = {2025},
month = {3},
url = {https://hdl.handle.net/10902/37941},
abstract = {Low-diameter network topologies require non-minimal routing, such as Valiant routing, to avoid network congestion under challenging traffic patterns like the so-called adversarial. However, this mechanism tends to increase the average path length, base latency, and network load. The use of shorter non-minimal paths has the potential to enhance performance, but it may also introduce congestion depending on the traffic patterns. This article introduces LIA (Latency-Improved Adaptive), a routing mechanism for Dragonfly networks which dynamically exploits minimal and non-minimal paths. LIA harnesses the traffic counters already present in contemporary switches to determine when it is safe to shorten non-minimal paths and to adjust routing decisions based on their information about the network conditions. Evaluations reveal that LIA achieves nearly optimal latency, outperforming state-of-the-art adaptive routing mechanisms by reducing latency by up to 30% while maintaining stable throughput and fairness.},
organization = {This work has been supported by the Spanish Ministry of Science and Innovation under contracts PID2022-136454NB-C21 (MCIN/AEI/10.13039/501100011033/FEDER) and TED2021-131176B-I00, and the Barcelona Supercomputing Center under projects MEEP with grant agreement 946002 and DITREA with grant agreement CONSER02023011NG.},
publisher = {Association for Computing Machinery (ACM)},
publisher = {ACM Transactions on Architecture and Code Optimization, 2025, 22(1), 39},
title = {LIA: latency-improved adaptive routing for dragonfly networks},
author = {Benito Hoz, Mariano and Vallejo Gutiérrez, Enrique and Beivide Palacio, Ramón},
}