Statistical Multiplexing Gain Analysis of Heterogeneous Virtual Base Station Pools in Cloud Radio Access Networks
Jingchu Liu, Sheng Zhou, Jie Gong, Zhisheng Niu, Shugong Xu

TL;DR
This paper analyzes the statistical multiplexing gain in cloud radio access networks by modeling VBS pools with a multi-dimensional Markov process, deriving formulas for blocking probability, and evaluating the gain under various conditions.
Contribution
It introduces a multi-dimensional Markov model for VBS pools, providing recursive and closed-form formulas for blocking probability and quantifies the statistical multiplexing gain.
Findings
VBS pools can achieve over 75% of maximum pooling gain with 50 VBSs
Convergence to the upper bound is slow due to diminishing marginal gains
Pooling gain is higher under light traffic and strict QoS requirements
Abstract
Cloud radio access network (C-RAN) is proposed recently to reduce network cost, enable cooperative communications, and increase system flexibility through centralized baseband processing. By pooling multiple virtual base stations (VBSs) and consolidating their stochastic computational tasks, the overall computational resource can be reduced, achieving the so-called statistical multiplexing gain. In this paper, we evaluate the statistical multiplexing gain of VBS pools using a multi-dimensional Markov model, which captures the session-level dynamics and the constraints imposed by both radio and computational resources. Based on this model, we derive a recursive formula for the blocking probability and also a closed-form approximation for it in large pools. These formulas are then used to derive the session-level statistical multiplexing gain of both real-time and delay-tolerant traffic.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
