Effective Capacity for Renewal Service Processes with Applications to HARQ Systems

Zheng Shi, Theodoros A. Tsiftsis, Weiqiang Tan, Guanghua Yang, Shaodan Ma, Mohamed-Slim Alouini

Abstract

This work provides a breakthrough in cross-layer network design by deriving the first exact analytical expressions for the Effective Capacity (EC) of renewal service processes. By applying these mathematical tools to various Hybrid Automatic Repeat Request (HARQ) schemes, the authors demonstrate how to accurately evaluate and optimize system throughput while strictly adhering to 5G-grade quality of service (QoS) constraints like latency and buffer limits. The proposed exact formulas replace previous loose approximations, offering a robust framework for designing ultra-reliable low-latency communication (URLLC) systems.

Introduction

The push toward 5G and beyond necessitates more than just high raw data rates; it requires ultra-reliability and low latency. Traditional physical-layer metrics often ignore the behavior of the data queue. If a system exhibits high average throughput but high jitter or long bursts of errors, the data buffer will overflow, causing delays that are unacceptable for mission-critical applications like autonomous driving or remote surgery.

Effective Capacity (EC) is a cross-layer metric that addresses this by defining the maximum arrival rate a link can support while meeting a specific statistical delay constraint, represented by the QoS exponent $\theta$. However, calculating EC is notoriously difficult for systems using HARQ, where packets are retransmitted until successful. HARQ creates a "renewal process"—a sequence of random service events—that complicates the underlying mathematics. Previous research relied on loose approximations that failed when QoS requirements were strict. This paper replaces those approximations with exact analytical formulas.

System model of the HARQ-based communication system, illustrating the buffer, channel coding, and the HARQ protocol over fading channels.

Methodology

The authors employ a rigorous approach based on Z-transforms and Laplace transforms to move away from standard small-exponent approximations.

  1. Renewal Reward Theory: The communication process is modeled as a renewal reward process, where each successful transmission cycle is a "renewal" and the bits delivered are the "reward."
  2. Z-Transform Analysis: For discrete service processes like HARQ, Z-transforms are used to derive a closed-form expression for the moment-generating function of the accumulated service.
  3. Matrix Representation: A novel theorem using Vandermonde matrices is introduced to simplify the inverse Z-transform process, resulting in a compact matrix-form expression for Effective Capacity.
  4. Generalization: The math is extended from simple constant-reward processes to complex scenarios with variable rewards and variable transmission rates, including Variable-Rate HARQ (VR-HARQ) and Cross-Packet HARQ (XP-HARQ).

Key Insights and Results

The paper proves that previous approximations significantly overestimate capacity when QoS constraints are tight (high $\theta$). The new exact formulas remain accurate across the entire range of QoS requirements.

Performance of HARQ Schemes

  • Monotonicity and Bounds: Effective Capacity is shown to be a monotonically decreasing function of the QoS exponent. The authors establish clear upper and lower bounds, providing a "performance envelope" for system design.
  • The Power of Variable Rates: A comparison between HARQ types reveals that VR-HARQ and XP-HARQ schemes perform significantly better under delay constraints than Fixed-Rate HARQ (FR-HARQ) due to their ability to adapt to channel fluctuations.
  • Rate Selection: Selecting the correct initial transmission rate is critical; a poorly chosen rate can cause the effective capacity to drop to nearly zero, even at high average SNR.

Numerical results perfectly corroborate the analytical derivations, showing a significant gap between the new exact results and old approximations at higher QoS exponents. Under a delay constraint of $\theta = 10^{-3}$, optimized HARQ-IR (Incremental Redundancy) significantly outperforms Type I HARQ and Chase Combining (CC).

Conclusion and Future Work

While the paper provides exact formulas for evaluating capacity, several areas remain for future exploration. The current model assumes instantaneous and error-free HARQ feedback. In real-world satellite or long-distance links, feedback delay and errors could significantly impact the renewal process. Furthermore, maximizing capacity requires an exhaustive search over transmission rates due to the non-convex nature of the objective function, suggesting a need for more efficient optimization algorithms. Finally, extending these expressions to time-correlated channels would better model slow-moving mobile scenarios.

Summary updated

BibTeX
@article{shi2019effective,
  author = {Zheng Shi and Theodoros A. Tsiftsis and Weiqiang Tan and Guanghua Yang and Shaodan Ma and Mohamed-Slim Alouini},
  title = {{Effective Capacity for Renewal Service Processes with Applications to HARQ Systems}},
  journal = {IEEE Trans. Communications},
  year = {2019},
  url = {https://openreview.net/forum?id=ZM98asYGHuh},
}
Figure