Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

169 Downloads (Pure)

Abstract

In the Cloud Radio Access Network (C-RAN) architecture, the baseband signals from multiple remote radio heads are processed in a centralized baseband unit (BBU) pool. This architecture allows network operators to adapt the BBU’s
computational resources to the aggregate access load experienced at the BBU, which can change in every air-interface access frame. The degree of savings that can be achieved by adapting the resources is a tradeoff between savings, adaptation frequency, and increased queuing time. If the time scale for adaptation of the resource multiplexing is greater than the access frame duration, then this may result in additional access latency and limit the energy savings. In this paper we investigate the tradeoff by considering two extreme time-scales for the resource multiplexing: (i) long-term, where the computational resources are adapted over periods much larger than the access frame durations; (ii) short-term, where the adaption is below the access
frame duration.We develop a general C-RAN queuing model that models the access latency and show, for Poisson arrivals, that long-term multiplexing achieves savings comparable to short-term multiplexing, while offering low implementation complexity.
Original languageEnglish
Title of host publication2017 IEEE International Conference on Communications Workshops (ICC Workshops) : 3rd International Workshop on 5G RAN Design
PublisherIEEE
Publication date3 Jul 2017
Pages772 - 777
ISBN (Electronic)978-1-5090-1525-2
DOIs
Publication statusPublished - 3 Jul 2017
EventIEEE International Conference on Communications (ICC) 2017 Workshop - Paris, France
Duration: 21 May 201725 May 2017
http://icc2017.ieee-icc.org/content/workshops

Workshop

WorkshopIEEE International Conference on Communications (ICC) 2017 Workshop
CountryFrance
CityParis
Period21/05/201725/05/2017
Internet address
SeriesIEEE International Conference on Communications Workshops (ICC Workshops)
ISSN2474-9133

Fingerprint

Multiplexing
Network architecture
Energy conservation
Air

Cite this

Kalør, A. E., Agurto Agurto, M. I., Pratas, N., Nielsen, J. J., & Popovski, P. (2017). Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy. In 2017 IEEE International Conference on Communications Workshops (ICC Workshops): 3rd International Workshop on 5G RAN Design (pp. 772 - 777). IEEE. IEEE International Conference on Communications Workshops (ICC Workshops) https://doi.org/10.1109/ICCW.2017.7962752
Kalør, Anders Ellersgaard ; Agurto Agurto, Mauricio Ignacio ; Pratas, Nuno ; Nielsen, Jimmy Jessen ; Popovski, Petar. / Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy. 2017 IEEE International Conference on Communications Workshops (ICC Workshops): 3rd International Workshop on 5G RAN Design. IEEE, 2017. pp. 772 - 777 (IEEE International Conference on Communications Workshops (ICC Workshops)).
@inproceedings{fbf69e6685654eaa904e0d07c88180da,
title = "Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy",
abstract = "In the Cloud Radio Access Network (C-RAN) architecture, the baseband signals from multiple remote radio heads are processed in a centralized baseband unit (BBU) pool. This architecture allows network operators to adapt the BBU’scomputational resources to the aggregate access load experienced at the BBU, which can change in every air-interface access frame. The degree of savings that can be achieved by adapting the resources is a tradeoff between savings, adaptation frequency, and increased queuing time. If the time scale for adaptation of the resource multiplexing is greater than the access frame duration, then this may result in additional access latency and limit the energy savings. In this paper we investigate the tradeoff by considering two extreme time-scales for the resource multiplexing: (i) long-term, where the computational resources are adapted over periods much larger than the access frame durations; (ii) short-term, where the adaption is below the accessframe duration.We develop a general C-RAN queuing model that models the access latency and show, for Poisson arrivals, that long-term multiplexing achieves savings comparable to short-term multiplexing, while offering low implementation complexity.",
author = "Kal{\o}r, {Anders Ellersgaard} and {Agurto Agurto}, {Mauricio Ignacio} and Nuno Pratas and Nielsen, {Jimmy Jessen} and Petar Popovski",
year = "2017",
month = "7",
day = "3",
doi = "10.1109/ICCW.2017.7962752",
language = "English",
series = "IEEE International Conference on Communications Workshops (ICC Workshops)",
publisher = "IEEE",
pages = "772 -- 777",
booktitle = "2017 IEEE International Conference on Communications Workshops (ICC Workshops)",
address = "United States",

}

Kalør, AE, Agurto Agurto, MI, Pratas, N, Nielsen, JJ & Popovski, P 2017, Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy. in 2017 IEEE International Conference on Communications Workshops (ICC Workshops): 3rd International Workshop on 5G RAN Design. IEEE, IEEE International Conference on Communications Workshops (ICC Workshops), pp. 772 - 777, IEEE International Conference on Communications (ICC) 2017 Workshop, Paris, France, 21/05/2017. https://doi.org/10.1109/ICCW.2017.7962752

Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy. / Kalør, Anders Ellersgaard; Agurto Agurto, Mauricio Ignacio; Pratas, Nuno; Nielsen, Jimmy Jessen; Popovski, Petar.

2017 IEEE International Conference on Communications Workshops (ICC Workshops): 3rd International Workshop on 5G RAN Design. IEEE, 2017. p. 772 - 777 (IEEE International Conference on Communications Workshops (ICC Workshops)).

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

TY - GEN

T1 - Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy

AU - Kalør, Anders Ellersgaard

AU - Agurto Agurto, Mauricio Ignacio

AU - Pratas, Nuno

AU - Nielsen, Jimmy Jessen

AU - Popovski, Petar

PY - 2017/7/3

Y1 - 2017/7/3

N2 - In the Cloud Radio Access Network (C-RAN) architecture, the baseband signals from multiple remote radio heads are processed in a centralized baseband unit (BBU) pool. This architecture allows network operators to adapt the BBU’scomputational resources to the aggregate access load experienced at the BBU, which can change in every air-interface access frame. The degree of savings that can be achieved by adapting the resources is a tradeoff between savings, adaptation frequency, and increased queuing time. If the time scale for adaptation of the resource multiplexing is greater than the access frame duration, then this may result in additional access latency and limit the energy savings. In this paper we investigate the tradeoff by considering two extreme time-scales for the resource multiplexing: (i) long-term, where the computational resources are adapted over periods much larger than the access frame durations; (ii) short-term, where the adaption is below the accessframe duration.We develop a general C-RAN queuing model that models the access latency and show, for Poisson arrivals, that long-term multiplexing achieves savings comparable to short-term multiplexing, while offering low implementation complexity.

AB - In the Cloud Radio Access Network (C-RAN) architecture, the baseband signals from multiple remote radio heads are processed in a centralized baseband unit (BBU) pool. This architecture allows network operators to adapt the BBU’scomputational resources to the aggregate access load experienced at the BBU, which can change in every air-interface access frame. The degree of savings that can be achieved by adapting the resources is a tradeoff between savings, adaptation frequency, and increased queuing time. If the time scale for adaptation of the resource multiplexing is greater than the access frame duration, then this may result in additional access latency and limit the energy savings. In this paper we investigate the tradeoff by considering two extreme time-scales for the resource multiplexing: (i) long-term, where the computational resources are adapted over periods much larger than the access frame durations; (ii) short-term, where the adaption is below the accessframe duration.We develop a general C-RAN queuing model that models the access latency and show, for Poisson arrivals, that long-term multiplexing achieves savings comparable to short-term multiplexing, while offering low implementation complexity.

U2 - 10.1109/ICCW.2017.7962752

DO - 10.1109/ICCW.2017.7962752

M3 - Article in proceeding

T3 - IEEE International Conference on Communications Workshops (ICC Workshops)

SP - 772

EP - 777

BT - 2017 IEEE International Conference on Communications Workshops (ICC Workshops)

PB - IEEE

ER -

Kalør AE, Agurto Agurto MI, Pratas N, Nielsen JJ, Popovski P. Statistical Multiplexing of Computations in C-RAN with Tradeoffs in Latency and Energy. In 2017 IEEE International Conference on Communications Workshops (ICC Workshops): 3rd International Workshop on 5G RAN Design. IEEE. 2017. p. 772 - 777. (IEEE International Conference on Communications Workshops (ICC Workshops)). https://doi.org/10.1109/ICCW.2017.7962752