A Fairness-Based Adaptive Explicit Congestion Control Protocol in Microburst Traffic Scenarios

During Unmanned Aerial Vehicle (UAV) missions, sudden weather changes like strong winds can destabilize UAV flight, making it essential to quickly transmit weather information to improve safety and efficiency. However, these abrupt data surges can lead to network congestion, affecting transmission timeliness and reliability. Current congestion control schemes often prioritize network efficiency but overlook user fairness. This paper introduces an Adaptive Explicit Congestion Control algorithm based on Fairness (AECCF) for handling Microburst traffic, balancing congestion management with fair resource distribution. The AECCF algorithm works as follows: First, the router node monitors its outgoing packet queue and assesses local link congestion state using a double delay threshold. It then calculates and attaches congestion probability, congestion state, and sojourn time to packets, enabling complete congestion feedback to downstream nodes. In cases of burst traffic, the router labels the traffic as heavily congested and activates flow shaping, transferring some packets to a cache queue for staggered forwarding. The consumer then adjusts its interest packet rate based on congestion markings and fair bandwidth allocation, preventing throughput loss from over-adjustment and maintaining network stability and fairness. Finally, the router forwards interest packets based on the proportion of consumer request prefixes on available interfaces, improving data transmission efficiency under sudden traffic. Simulations on ndnSIM show that AECCF achieves higher throughput and fairness in different scenarios compared to existing methods. For dumbbell networks, AECCF reaches 18.64 Mbps throughput with a fairness index of 0.97, and in complex network scenarios, the throughput is 24.9% higher than that of the PCON protocol, and the fairness index is 0.86.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network and Service Management
Published
2025-10-09
DOI
https://doi.org/10.1109/tnsm.2025.3619442
Primary Topic
Mobile Ad Hoc Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Fairness-Based Adaptive Explicit Congestion Control Protocol in Microburst Traffic Scenarios

Jianyue Zhu, Yaqin Xie, Junmin Wu, Yu Zhang et al.
IEEE Transactions on Network and Service Management
Mobile Ad Hoc Networks
article

A Fairness-Based Adaptive Explicit Congestion Control Protocol in Microburst Traffic Scenarios

Jianyue Zhu, Yaqin Xie, Junmin Wu, Yu Zhang, Zhizhong Zhang, Zhongyu Liu
article en

Abstract

During Unmanned Aerial Vehicle (UAV) missions, sudden weather changes like strong winds can destabilize UAV flight, making it essential to quickly transmit weather information to improve safety and efficiency. However, these abrupt data surges can lead to network congestion, affecting transmission timeliness and reliability. Current congestion control schemes often prioritize network efficiency but overlook user fairness. This paper introduces an Adaptive Explicit Congestion Control algorithm based on Fairness (AECCF) for handling Microburst traffic, balancing congestion management with fair resource distribution. The AECCF algorithm works as follows: First, the router node monitors its outgoing packet queue and assesses local link congestion state using a double delay threshold. It then calculates and attaches congestion probability, congestion state, and sojourn time to packets, enabling complete congestion feedback to downstream nodes. In cases of burst traffic, the router labels the traffic as heavily congested and activates flow shaping, transferring some packets to a cache queue for staggered forwarding. The consumer then adjusts its interest packet rate based on congestion markings and fair bandwidth allocation, preventing throughput loss from over-adjustment and maintaining network stability and fairness. Finally, the router forwards interest packets based on the proportion of consumer request prefixes on available interfaces, improving data transmission efficiency under sudden traffic. Simulations on ndnSIM show that AECCF achieves higher throughput and fairness in different scenarios compared to existing methods. For dumbbell networks, AECCF reaches 18.64 Mbps throughput with a fairness index of 0.97, and in complex network scenarios, the throughput is 24.9% higher than that of the PCON protocol, and the fairness index is 0.86.

IEEE Transactions on Network and Service ManagementVol. 22(6)
State Grid Corporation of China (China) (CN), Nanjing University of Information Science and Technology (CN)
Openalex Percentile: Top 67%
Mobile Ad Hoc Networks
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.