FORS: fault-adaptive optimized routing and scheduling for DAQ networks
Open Access
- 3 April 2025
- journal article
- research article
- Published by Springer Nature in Computing and Software for Big Science
- Vol. 9 (1) , 1-23
Abstract
Data acquisition (DAQ) networks, widely used in scientific research and industrial applications, are composed of numerous interconnected servers, exchanging substantial data volumes produced by large scientific instruments. One traffic matrix generally used in such networks is the all-to-all collective exchange, which demands substantial network resources, making network failures particularly challenging to mitigate. If not mitigated, the effects of network failures severely hamper the performance of the DAQ network, potentially leading to the loss of valuable experimental data. In the context of DAQ networks using a fat-tree topology, we propose FORS: a scheduling and associated routing solution to support the all-to-all collective exchange under network failures. FORS optimizes bandwidth utilization in the face of any failure scenarios, ensuring robust performance compared to the existing approaches. We propose an algorithm to solve the scheduling. For the routing, we design an algorithm for simple failure scenarios, along with a linear programming model to address more complex failure scenarios. We validate our proposed solution using a real-world DAQ network as a case study. Results demonstrate significant performance degradation in existing approaches and FORS’ consistent ability to achieve higher throughput across various failure scenarios.Keywords
Funding Information
- CERN
- Université de Strasbourg
- Université Catholique de Louvain
- CERN
This publication has 60 references indexed in Scilit:
- The CMS Orbit Builder for the HL-LHC at CERNEPJ Web of Conferences, 2024
- Realizing Optimal All-to-All Personalized Communication Using Butterfly-Based NetworksIEEE Access, 2023
- Adaptive Routing in InfiniBand Hardware2022
- Towards an efficient combination of adaptive routing and queuing schemes in Fat-Tree topologiesJournal of Parallel and Distributed Computing, 2021
- Predictive Analytics on Genomic Data with High-Performance Computing2020
- Fast parallel multidimensional FFT using advanced MPIJournal of Parallel and Distributed Computing, 2019
- Optimized InfiniBandTMfat‐tree routing for shift all‐to‐all communication patternsConcurrency and Computation: Practice and Experience, 2009
- The LHCb Detector at the LHCJournal of Instrumentation, 2008
- Two algorithms for barrier synchronizationInternational Journal of Parallel Programming, 1988
- On rearrangeable and non-blocking switching networksJournal of Computer and System Sciences, 1978