Congestion-Robust Multi-Split Computing System in Data Center Networks

In multi-split computing, to achieve low inference latency and avoid significant accuracy degradation, it is advantageous to distribute sub-models to computing nodes that can exchange intermediate data through paths with a low packet drop rate (PDR). In this paper, we first formulate an optimization problem for multi-split computing to minimize inference latency while guaranteeing sufficiently high accuracy and achieving load balancing among computing nodes. To obtain the optimal solution (i.e., optimal splitting policy) of the formulated problem, we propose a congestion-robust multi-split computing system (CRMC). In CRMC, there are two phases: 1) preparation; and 2) execution. In the preparation phase, a computing node that requires the inference result of a deep neural network model (i.e., task owner) creates accuracy prediction models according to the splitting points and the PDRs. In the execution phase, the task owner collects the amount of available computing resources of the computing nodes, the expected PDRs of paths, and the transmission rate of the wired link. Then, using the prediction models, the task owner generates possible splitting policies (i.e., candidates of the optimal splitting policy) that guarantee sufficiently high accuracy and achieve load balancing among computing nodes. Subsequently, the task owner selects the optimal splitting policy that has the lowest inference latency and executes multi-split computing by following the optimal splitting policy. Evaluation results demonstrate that CRMC effectively reduces inference latency while maintaining accuracy above 80% and ensuring balanced load distribution, with each computing node operating under 110 FLOPs (70% of the total model complexity).

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Vehicular Technology
Published
2025-05-22
DOI
https://doi.org/10.1109/tvt.2025.3572588
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Congestion-Robust Multi-Split Computing System in Data Center Networks

Haneul Ko, Bo-Kyeong Kim
IEEE Transactions on Vehicular Technology
Cloud Computing and Resource Management
article

Congestion-Robust Multi-Split Computing System in Data Center Networks

Haneul Ko, Bo-Kyeong Kim
article en

Abstract

In multi-split computing, to achieve low inference latency and avoid significant accuracy degradation, it is advantageous to distribute sub-models to computing nodes that can exchange intermediate data through paths with a low packet drop rate (PDR). In this paper, we first formulate an optimization problem for multi-split computing to minimize inference latency while guaranteeing sufficiently high accuracy and achieving load balancing among computing nodes. To obtain the optimal solution (i.e., optimal splitting policy) of the formulated problem, we propose a congestion-robust multi-split computing system (CRMC). In CRMC, there are two phases: 1) preparation; and 2) execution. In the preparation phase, a computing node that requires the inference result of a deep neural network model (i.e., task owner) creates accuracy prediction models according to the splitting points and the PDRs. In the execution phase, the task owner collects the amount of available computing resources of the computing nodes, the expected PDRs of paths, and the transmission rate of the wired link. Then, using the prediction models, the task owner generates possible splitting policies (i.e., candidates of the optimal splitting policy) that guarantee sufficiently high accuracy and achieve load balancing among computing nodes. Subsequently, the task owner selects the optimal splitting policy that has the lowest inference latency and executes multi-split computing by following the optimal splitting policy. Evaluation results demonstrate that CRMC effectively reduces inference latency while maintaining accuracy above 80% and ensuring balanced load distribution, with each computing node operating under 110 FLOPs (70% of the total model complexity).

IEEE Transactions on Vehicular TechnologyVol. 74(10)
Kyung Hee University (KR)
Openalex Percentile: Top 84%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.