Contention-based Nonminimal Adaptive Routing in High-radix Networks
EstadísticasView Usage Statistics
Full recordShow full item record
AuthorFuentes Saez, Pablo; Vallejo Gutiérrez, Enrique; García González, Marina; Beivide Palacio, Julio Ramón; Rodríguez Herrera, Germán; Minkenberg, Cyriel; Valero Cortés, Mateo
Adaptive routing is an efficient congestion avoidance mechanism for modern Datacenter and HPC networks. Congestion detection traditionally relies on the occupancy of the router queues. However, this approach can hinder performance due to coarse-grain measurements with small buffers, and potential routing oscillations with large buffers.
We introduce an alternative mechanism, labelled Contention-Based Adaptive Routing. Our mechanism adapts routing based on an estimation of “network contention”, the simultaneity of traffic flows contending for a network port. Our system employs a set of counters which track the demand for each output port. This exploits path diversity thanks to earlier detection of adversarial traffic patterns, and decouples buffer size and queue occupancy from contention detection.
We evaluate our mechanism in a Dragonfly network. Our evaluations show this mechanism achieves optimal latency under uniform traffic and similar to best previous routing mechanisms under adversarial patterns, with immediate adaptation to traffic pattern changes.
Enlace a la publicación
Collections to which it belong
- D30 Congresos