This work shows that efficient offline-optimized routing enables efficient MoE training and inference on direct-connect topologies without the need for MoE traffic matrix or dynamic topology reconfiguration.
Abstract
Optically switched networks suit the regular communication of dense ML models, but MoE introduces sparse, runtime-dependent traffic. We show that efficient offline-optimized routing enables efficient MoE training and inference on direct-connect topologies without the need for MoE traffic matrix or dynamic topology reconfiguration. MoX constructs token-aware multicast trees to reduce bandwidth tax, then uses static, precomputed link weights to balance traffic by solving a restricted multicast tree-packing problem. Using recorded traffic from large MoE models, token-level traces, and ASTRA-sim, we find that MoX accelerates the full MoE block -- dispatch, expert computation, and combine -- by up to 1.8x over min-hop routing. Moreover, it attains nearly ideal packet-switched network performance in random expander topologies. On a 1,024-TPU model of Google's Boardfly topology, MoX reduces the dispatch bottleneck link load by up to 47%. These results show that high-performance MoE on static direct-connect fabrics can be achieved via optimized load-oblivious routing without demand-driven reconfiguration.
SprayCast is proposed, a congestion-adaptive native RDMA multicast scheme for dynamic sparse token Dispatch that uses in-band network telemetry feedback to steer replication away from congested multicast branches and range-based negative acknowledgments for localized loss recovery, saving bandwidth and reducing tail latency in dynamic all-to-all communication.
Yingying Zeng, Ning Xu, Xiaobin Tan et al.· Asia-Pacific Workshop on Net...· 0 citations
The rapid evolution of beyond-5G and emerging 6G networks is driving the need for flexible, reliable, and cost-efficient virtualized Radio Access Network (vRAN) architectures capable of supporting heterogeneous services such as enhanced Mobile Broadband (eMBB), Ultra-Reliable Low-Latency Communication (URLLC), and Massive Machine-Type Communication (mMTC). Future disaggregated RAN systems are expected to rely heavily on network slicing, functional split flexibility, and optical x-haul infrastructures to support stringent performance, scalability, and availability requirements. In this paper, we present an integrated framework for reliable, slice-aware, and functional split-aware Virtual Network Function (VNF) placement with lightpath provisioning in disaggregated vRAN environments. The proposed approach maximizes mobile network operators'profit by jointly optimizing function placement and optical resource allocation under latency, processing, bandwidth, and availability constraints. We formulate the problem as an Integer Linear Programming (ILP) model with two variants: one that employs unshared backups and another that uses a more cost-efficient shared backup scheme. To address ILP complexity, we develop a heuristic algorithm and a Genetic Algorithm (GA)-based metaheuristic that yields near-optimal solutions in real time. Extensive evaluations on topologies up to 128 nodes show that shared backup variants yield up to 18% higher profit, while maintaining up to 5-10% lower normalized CPU usage than unshared counterparts.
Mayank Ramnani, S. Dixit, Sushil Yadav et al.· arXiv.org· 0 citations
This work proposes Double-Channel Graph Attention (DCGA), an end-to-end reinforcement learning framework that isolates network reachability and demand-service logic into separate graph channels and constructs valid routes using a simulator-coupled, constraint-informed decoder.
Hao Sun, Fang He, Congyuan Ji et al.· arXiv.org· 0 citations
ESMP, a multi-graph-based heuristic framework for efficient and stable multicast construction over heterogeneous parallel communication links, is presented and it is shown that an aggregate-edge-delay-constrained decision variant of the formulation is NP-hard.
The proposed Multi-Path Multi-Level Feedback Queueing (MP-MLFQ) leverages the spatial diversity and regularity of DCNs to realize a scheduler with numerous logical priority levels while occupying as low as 2 physical priority queues within network switches.
Alessandro Cornacchia, Andrea Bianco, Paolo Giaccone et al.· 0 citations
This paper surveys multicast forwarding-state capacity across ISP core routers and enterprise routers, and proposes a capacity-aware path-selection algorithm for PIM-SSM based on Shortest Widest Path (SWP), allowing to load-balance multicast joins over paths with remaining multicast hardware entries.
Anthony Doeraene, Olivier Bonaventure· Applied Networking Research...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
