Deterministic Scheduling of Periodic Messages for Cloud RAN

📅 2018-01-22
🏛️ International Conference on Telecommunications
📈 Citations: 6
Influential: 0
📄 PDF
🤖 AI Summary
To address the challenge of deterministic low-latency scheduling for periodic message transmission between antennas and remote processing units in Cloud-RAN—where strict protocol deadlines must be met while avoiding buffering and collision delays induced by statistical multiplexing—this paper pioneers the application of deterministic conflict-free scheduling to Cloud-RAN fronthaul networks. We propose two algorithms: (i) an analytical zero-buffer scheduling algorithm tailored for short-path or light-load scenarios, and (ii) PMLS (Periodic Message Latency Scheduling), a heuristic algorithm supporting bounded buffering. We theoretically prove that a zero-buffer feasible schedule always exists under short-path or low-load conditions. Experimental results demonstrate that PMLS achieves zero-delay deterministic schedules with high probability even under full load, significantly enhancing latency predictability and resource utilization.
📝 Abstract
A recent trend in mobile networks is to centralize in distant data-centers the processing units which were attached to antennas until now. The main challenge is to guarantee that the latency of the periodic messages sent from the antennas to their processing units and back, fulfills protocol time constraints. We show that traditional statistical multiplexing does not allow such a low latency, due to collisions and buffering at nodes. Hence, we propose in this article to use a deterministic scheme for sending periodic messages without collisions in the network thus saving the latency incurred by buffering. We give several algorithms to compute such schemes for a common topology where one link is shared by all antennas. We show that there is always a solution when the routes are short or the load is small. When the parameters are unconstrained, and some buffering is allowed in the processing units, we propose an algorithm (PMLS) adapted from a classical scheduling method. The experimental results show that even under full load, most of the time PMLS finds a deterministic sending scheme with no latency.
Problem

Research questions and friction points this paper is trying to address.

Minimize latency in Cloud-RAN periodic message transmission
Eliminate buffering-induced delays in deterministic scheduling
Ensure low-latency coexistence with random network traffic
Innovation

Methods, ideas, or system contributions that make the work stand out.

Deterministic scheduling eliminates buffering latency
PMLS algorithm ensures minimal latency at high load
Polynomial-time scalable solution for hundreds of antennas
🔎 Similar Papers
No similar papers found.
Université de Versailles Saint-Quentin | LINEACT | CESI
D
D. Barth
DAVID laboratory, Université de Versailles Saint-Quentin, 45 Av. des Etats Unis, Versailles, 78000, France.
M
Maël Guiraud
LINEACT, CESI, 93 Bd de la Seine, Nanterre, 92000, France.
Y
Yann Strozecki
DAVID laboratory, Université de Versailles Saint-Quentin, 45 Av. des Etats Unis, Versailles, 78000, France.