Skip to content
Book Open access

Odin: Rethinking Congestion Control under All-to-All Traffic

Aug 2026 · Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · pp. 1246-1263 · 1 citation · 29 references
Computer Science

TL;DR

Odin is proposed to enhance CC under A2A traffic, which achieves low TBO and high throughput under A2A traffic, accelerating the training process and keeping strong performance under non-A2A traffic.

Abstract

All-to-All (A2A) communication dominates the training and inference time of large language models, especially under the Mixture-of-Experts (MoE) architecture where expert dispatch induces dense concurrent flows. We observe that A2A traffic consistently builds up large total buffer occupancy (TBO) at switches. Analyzing the accompanying counterintuitive phenomena, we reveal that the A2A traffic saturates ingress bandwidth, interferes with rate adjustment of congestion control (CC) through sparse congestion signals and rate inflation, and causes ingress-egress bandwidth mismatch. Unaware of these issues, existing CC algorithms would be easy to trigger PFC with large TBO, suffer from ineffectual congestion response, and lead to throughput loss. Based on these insights, we propose Odin to enhance CC under A2A traffic. Odin suppresses large TBO based on the switch-level TBO signals, proactively allocate ingress bandwidth to eliminate rate inflation, and make bandwidth compensation for ingress-egress matching. Experiments and simulations show that Odin achieves low TBO and high throughput under A2A traffic, accelerating the training process. Meanwhile, it keeps strong performance under non-A2A traffic.

Read PDF

Similar papers

Preprint Oct 2026

Ofan: Optimal Load Balancing for AI Training

The extreme collective completion time (CCT) demands of AI workloads challenge existing packet spraying algorithms, which can have trouble efficiently load-balancing workloads that are sent at full line rates. We trace this to a structural cause: on a fat tree, once a packet picks its upward path, the downward path to...

Sarah McClure, E. Cohen, Jakob Krebs et al. · 0 citations
2026

dBBR: Enhance BBR Performance With Delay Information

BBR, a model-based congestion control algorithm developed by Google, is known for its high tolerance to random loss and low latency. However, it exhibits limited competitiveness in deep buffers and suffers severe retransmissions in shallow buffers. To address these issues, we propose dBBR, which adjusts the congestion...

Yi-Bo Xiao, Cheng-Yuan Huang, Hong-Wei Yang et al. · 0 citations
2026

FAFC: Fast and Accurate Flow Control in Data Center Networks

In data centers, large-scale many-to-one traffic can rapidly exhaust switch buffers and trigger priority-based flow control (PFC) pause, resulting in increased flow completion time (FCT) for uncongested flows. To address this issue, we propose an innovative switch-side fast and accurate flow control (FAFC) scheme. By d...

Cheng-Di Lu, Yuang Chen, Fangyu Zhang et al. · 0 citations
Conference Open access Sep 2026

SplitScaling: Adaptive Scaling for Disaggregated LLM Serving Against Traffic Bursts via DRL

This work proposes a Deep Reinforcement Learning-based auto-scaling framework tailored for the PD architecture that enables the agent to capture non-linear load dynamics, thereby achieving decoupled and precise scaling for prefill and decode pools.

Wei Xiao, Xue-Feng Huang, Wei-Jia Shi et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Crossflow: Prefill-Decode Elasticity for Agentic LLM Serving

This work presents Crossflow, which makes this boundary elastic without changing node roles, and improves token throughput by 16.2-17.4% on geometric mean over static P/D, and by up to 43.4% at high load, while reducing mean TTFT at every evaluated point.

Yi Xu, Ehsan K. Ardestani, Wen-Yin Fu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.