vix.ing · top · new · best · stats · spec

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

2017/03/15 by Anders E. Kalør, Kalør, Anders E., Mauricio I. Agurto +7
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Advanced Wireless Communication Techniques #Advanced Wireless Network Optimization #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Networks Research

paper · pdf · doi:10.48550/arxiv.1703.04995

openalex publication_date 2017/03/15 · openalex created_date 2022/10/06 · openalex updated_date 2026/07/28

Abstract

In the Cloud Radio Access Network (C-RAN) architecture, the baseband signals\nfrom multiple remote radio heads are processed in a centralized baseband unit\n(BBU) pool. This architecture allows network operators to adapt the BBU's\ncomputational resources to the aggregate access load experienced at the BBU,\nwhich can change in every air-interface access frame. The degree of savings\nthat can be achieved by adapting the resources is a tradeoff between savings,\nadaptation frequency, and increased queuing time. If the time scale for\nadaptation of the resource multiplexing is greater than the access frame\nduration, then this may result in additional access latency and limit the\nenergy savings. In this paper we investigate the tradeoff by considering two\nextreme time-scales for the resource multiplexing: (i) long-term, where the\ncomputational resources are adapted over periods much larger than the access\nframe durations; (ii) short-term, where the adaption is below the access frame\nduration. We develop a general C-RAN queuing model that describes the access\nlatency and show, for Poisson arrivals, that long-term multiplexing achieves\nsavings comparable to short-term multiplexing, while offering low\nimplementation complexity.\n

Related