Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN
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 co...
Saved in:
Main Authors | , , |
---|---|
Format | Journal Article |
Language | English |
Published |
22.01.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
DOI: | 10.48550/arxiv.1801.07029 |