ARS: Adaptive Routing System for Heterogeneous Traffic in Industrial Data Centers

Modern industrial datacenter networks carry latency-sensitive and throughput-oriented applications with diverse requirements. Recent load balancing mechanisms effectively reduce latency and improve throughput for heterogeneous traffic. However, deadline-sensitive flows still often miss deadlines due to being blocked. In this article, we introduce an adaptive routing system (ARS) to avoid missing deadlines. Specifically, an ARS computes a heuristic function using three influence factors, derives the probability of choosing the next node, and finds optimal (re)routing path. The experimental results show that an ARS enhances the throughput for long flows and decreases the average flow completion time and the deadline miss rate by 24% and 55%, respectively, compared to state-of-the-art load balancing schemes.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Industrial Informatics
Published
2025-05-19
DOI
https://doi.org/10.1109/tii.2025.3567376
Citations
8
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
25.97

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ARS: Adaptive Routing System for Heterogeneous Traffic in Industrial Data Centers

Jinbin Hu, Jin Wang, Rui Zhi
8 citations
IEEE Transactions on Industrial Informatics
Cloud Computing and Resource Management
25.97
article

ARS: Adaptive Routing System for Heterogeneous Traffic in Industrial Data Centers

Jinbin Hu, Jin Wang, Rui Zhi
article en
8 citations

Abstract

Modern industrial datacenter networks carry latency-sensitive and throughput-oriented applications with diverse requirements. Recent load balancing mechanisms effectively reduce latency and improve throughput for heterogeneous traffic. However, deadline-sensitive flows still often miss deadlines due to being blocked. In this article, we introduce an adaptive routing system (ARS) to avoid missing deadlines. Specifically, an ARS computes a heuristic function using three influence factors, derives the probability of choosing the next node, and finds optimal (re)routing path. The experimental results show that an ARS enhances the throughput for long flows and decreases the average flow completion time and the deadline miss rate by 24% and 55%, respectively, compared to state-of-the-art load balancing schemes.

IEEE Transactions on Industrial InformaticsVol. 21(8)
Sanya University (CN), Changsha University of Science and Technology (CN)
National Natural Science Foundation of China, Natural Science Foundation of Hunan Province
Industry, innovation and infrastructure
Openalex Percentile: Top 1%
Cloud Computing and Resource Management
25.97
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.

ARS: Adaptive Routing System for Heterogeneous Traffic in Industrial Data Centers — Jinbin Hu, Jin Wang, et al. · IEEE Transactions on Industrial Informatics (2025) | TGRS Research Map | TGRS