Metraipolis › archive › dc_0a18b2e628cb
PSP: Low-Overhead Packet-Level Load Balancing for Stale-State and Bandwidth-Asymmetric Networks — arXiv:2608.08425
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.08425
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T08:52:48.798Z
- SHA-256 of the archived text
e1069fc946ba274bd751a5ec0229bec206af0a15e09373e82e0e7f89e50268d0- Stable URL of this page
https://metraipolis.com/documento/dc_0a18b2e628cb
How to cite
PSP: Low-Overhead Packet-Level Load Balancing for Stale-State and Bandwidth-Asymmetric Networks — arXiv:2608.08425 — arXiv (en), https://arxiv.org/abs/2608.08425 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0a18b2e628cb (Metraipolis archive dc_0a18b2e628cb, sha256 e1069fc946ba274bd751a5ec0229bec206af0a15e09373e82e0e7f89e50268d0)
BibTeX
@misc{dc0a18b2e628cb,
title = {PSP: Low-Overhead Packet-Level Load Balancing for Stale-State and Bandwidth-Asymmetric Networks — arXiv:2608.08425},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.08425},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0a18b2e628cb; sha256 e1069fc946ba274bd751a5ec0229bec206af0a15e09373e82e0e7f89e50268d0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.08425. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
With the rapid growth of large language model training and generative artificial intelligence services, data center networks face severe micro-burst traffic and high concurrency. Traditional hash-based flow-level load balancing cannot sense link states, leading to hash collisions, hotspot congestion, and tail latency in multipath Clos networks. Existing packet-level schemes are constrained by stale state information, high hardware complexity, and poor adaptation to heterogeneous links. To address these issues, this paper proposes probabilistic state-proportional (PSP) dispatching, a packet-level load balancing algorithm. Using a Band-based discrete state representation, PSP replaces global sorting with local probability mapping, reducing hardware complexity while suppressing herding and oscillations caused by stale states. Experiments on a cycle-accurate simulator show that PSP is robust across port scales, bandwidth-limited paths, and fixed-flow interference. It outperforms join-the-shortest-queue (JSQ) scheduling and Random in loss rate, 99th-percentile buffer occupancy, and scalability, while remaining competitive with Top-k at lower hardware cost. PSP provides an effective balance among performance, stability, and overhead for artificial intelligence data centers. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-11 in cs.DC). Categorie arXiv: Networking and Internet Architecture (cs.NI) ; Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2608.08425 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-19T08:50:23.778Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).