A Scheduling algorithm for joint flow control and resource allocation for dual-connectivity MQMS systems

Abstract This paper proposes a cross-layer scheduling algorithm for joint flow control and resource allocation to optimize the time-average utility function for the dual-connectivity multi-queue multi-server (D-C MQMS) system with a stochastic arrival process. First, we derive the capacity region of the D-C MQMS system by a finite set of linear inequalities. The capacity region characterizes the maximum input rate supported by the system, which is useful for network management. Furthermore, the characterization of the distance between the input rate vector and the boundary of capacity region is exhibited when the channel model is an ON/OFF channel. Then we consider two cases: (I) input rates within the capacity region, and (II) input rates exceeding the capacity region. Two scheduling algorithms for joint flow control and resource allocation, FCRA-I and FCRA-II, are proposed by Lyapunov optimization method. Next, the performance on the utility function and queue delay is analyzed. Finally, by comparing the proposed method with the single-connectivity (S-C) system, we verify the algorithm’s effectiveness by evaluating the average system throughput, system user perceived throughput (SUPT), the throughput-fairness utility function, and the average system backlog.

Authors

Institutions

Publication Details

Journal
Journal on Wireless Communications and Networking
Published
2026-07-16
DOI
https://doi.org/10.1186/s13638-026-02656-z
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Scheduling algorithm for joint flow control and resource allocation for dual-connectivity MQMS systems

yake li, Y ongxing Zhang, Zhongfa Liang
Journal on Wireless Communications and Networking
Advanced Queuing Theory Analysis
article

A Scheduling algorithm for joint flow control and resource allocation for dual-connectivity MQMS systems

yake li, Y ongxing Zhang, Zhongfa Liang
article en

Abstract

Abstract This paper proposes a cross-layer scheduling algorithm for joint flow control and resource allocation to optimize the time-average utility function for the dual-connectivity multi-queue multi-server (D-C MQMS) system with a stochastic arrival process. First, we derive the capacity region of the D-C MQMS system by a finite set of linear inequalities. The capacity region characterizes the maximum input rate supported by the system, which is useful for network management. Furthermore, the characterization of the distance between the input rate vector and the boundary of capacity region is exhibited when the channel model is an ON/OFF channel. Then we consider two cases: (I) input rates within the capacity region, and (II) input rates exceeding the capacity region. Two scheduling algorithms for joint flow control and resource allocation, FCRA-I and FCRA-II, are proposed by Lyapunov optimization method. Next, the performance on the utility function and queue delay is analyzed. Finally, by comparing the proposed method with the single-connectivity (S-C) system, we verify the algorithm’s effectiveness by evaluating the average system throughput, system user perceived throughput (SUPT), the throughput-fairness utility function, and the average system backlog.

Journal on Wireless Communications and Networking
ZTE (China) (CN), Xi'an University of Finance and Economics (CN)
Decent work and economic growth
Openalex Percentile: Top 5%
Advanced Queuing Theory Analysis
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.