Resilient cloud network mapping with virtualized BBU placement for cloud-RAN

Colman-Meixner, Carlos; Figueiredo, Gustavo B.; Fiorani, Matteo; Tornatore, Massimo; Mukherjee, Biswanath

doi:10.1109/ants.2016.7947790

Cited by 19 publications

(19 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The processing requirements of each function are then used as input to a multistage ILP-based optimization framework that is able to assign each baseband subtask to the suitable GPP in an energy efficient manner. Although the problem of BBU placement has been studied by several authors [3,4,11,20], the vast majority of these consider the BBU chain as a whole, without considering the specificities of its individual construction elements. In this study, however, it is shown that by (i) disaggregating the softwarized BBU into a set of smaller subtasks, (ii) analyzing in depth the computational requirements of each subtask, and (iii) allocating these subtasks to suitable GPPs as appropriate, significant benefits in terms of the operation efficiency of future 5G systems can be achieved.…”

Section: Problem Statementmentioning

confidence: 99%

“…This approach allows the individual allocation of processing functions, associated with a specific FH service, to different servers depending on the nature and volume of their processing requirements. To date, several studies have focused on optimal BBU placement through 5G network topology design [3] and the optimal optical network design serving 5G transport network requirements [4]. For a survey on C-RAN architectures and technologies used, the reader is referred to [5].…”

Section: Introductionmentioning

confidence: 99%

“…However, most of these studies are focusing on the inter-DC network design problem supporting C-RAN services while little attention has been given on the intra-DC domain. Given that the operation of future C-RAN networks will be supported by virtualized BBU that will operate in a combination of general and specific purpose servers [1,4], it is necessary to analyze the specificities and characteristics of the individual processing functions forming the BBU service chain (SC). One of the first studies on the topic has been reported in [13] where a closed-form approximation of the energy consumed at the base stations (BSs) has been developed, where based on the type of BSs (macro, pico, femto), the consumed power at the ASICs supporting BBU processing is estimated.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficiency gains in 5G softwarised radio access networks

Gkatzios

Αναστασόπουλος

Tzanakaki

et al. 2019

J Wireless Com Network

View full text Add to dashboard Cite

This paper proposes the concept of compute resource disaggregation in centralized softwarised radio access networks. This approach allows individual allocation of processing functions to different servers depending on the nature and volume of their processing requirements. The benefits of the proposed approach are evaluated through experiments analyzing the baseband unit (BBU) processing requirements of LTE PHY using an open source suite for wireless systems and a purposely developed multistage linear programming modeling framework. To address the high computational complexity of integer linear programming (ILP), limiting real-time services, a heuristic algorithm was also developed. Our results show that when using the proposed approach, the overall system power consumption is reduced by 40% under high loading scenarios compared to the traditional solution where all BBU functions are hosted in the same physical servers. The heuristic results achieve relatively good agreement with the ILP results (the gap is less than 5%), particularly for low and high loading conditions. At the same time, the heuristic requires less than 0.3 s to identify the optimal allocation policy.

show abstract

Section: Problem Statementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Efficiency gains in 5G softwarised radio access networks

Gkatzios

Αναστασόπουλος

Tzanakaki

et al. 2019

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…More related to our work, ref. [16] defines a protection problem for cloud radio access network against BBUs and link failures. The authors present different approaches based on 1+1 dedicated path protection and 1+1 virtual machine replication through an ILP algorithm, but the authors have not considered delay and link capacity constraints.…”

Section: Introductionmentioning

confidence: 99%

Resilient BBU placement in 5G C-RAN over optical aggregation networks

2019

Self Cite

View full text Add to dashboard Cite

The huge data demand envisioned for the 5G requires radically changes in the mobile network architecture and technology. Centralized Radio Access Network (C-RAN) is introduced as a novel mobile network architecture, designed to effectively support the challenging requirements of the future 5G mobile networks. In C-RAN, BaseBand Units (BBUs) are physically separated from their corresponding Radio Remote Heads (RRHs) and located in a central single physical location called BBU pool. The RRHs are connected to the BBU pool via the socalled fronthaul network. The "centralization" demonstrates remarkable benefits in terms of computational resources as well as power savings. Following this centralization, designing a survivable C-RAN becomes crucial as BBU pool and link failures might cause service outage for large number of users. In this paper, we propose three different approaches for the survivable BBU pool placement problem and traffic routing in C-RAN deployment over a 5G optical aggregation network. Namely we define the following protection scenarios: i) Dedicated Path protection, ii) Dedicated BBU protection and iii) Dedicated BBU and path protection. The three approaches are formalized as Integer Linear Programming (ILP) problems. The ILPs objectives are to minimize the number of BBU pools, the number of used wavelengths and the baseband processing computational resources, in terms of Giga operations Per Second (GOPS). We provide numerical results to compare the aforementioned protection strategies considering different network topologies. The results show the effect of the latency and the transport-network capacity on the BBU placement. We show the trade-off between the centralization degree and the tight latency requirements. Moreover, we discuss important insights about considering the different objective functions for each protection approach.

show abstract

“…Ref. [3] defines a protection problem for cloud radio access network against BBUs and link failures. The authors present different approaches based on 1+1 dedicated path protection and 1+1 virtual machine replication through an ILP algorithm, but the authors have not considered delay and link capacity constraints.…”

Section: Introductionmentioning

confidence: 99%

Survivable BBU Placement for C-RAN over Optical Aggregation Networks

Shehata

Ayoub

Musumeci

et al. 2018

2018 20th International Conference on Transparent Optical Networks (ICTON)

Self Cite

View full text Add to dashboard Cite

Centralized Radio Access Network (C-RAN) is a novel mobile network architecture, designed to effectively support the challenging requirements of future 5G mobile networks. Unlike Distributed RAN (D-RAN), in C-RAN, baseband units (BBUs) are located in a single physical location, called "BBU pool", connected to several Remote Radio Heads (RRHs) via the so-called "fronthaul" network. Following this centralization, designing a survivable C-RAN becomes crucial as BBU pool failures might cause service outage for large number of users. In this paper, we introduce the survivable BBU pool placement problem for C-RAN deployment over an optical aggregation network and formalize it by Integer Linear Programming (ILP). The ILP objective is to minimize the number of BBU pools, the number of used wavelengths and the computational resources. The results compare the aforementioned objectives and show the effect of the latency and of the transport-network capacity on the optimal solution.

show abstract

Resilient cloud network mapping with virtualized BBU placement for cloud-RAN

Cited by 19 publications

References 5 publications

Efficiency gains in 5G softwarised radio access networks

Efficiency gains in 5G softwarised radio access networks

Resilient BBU placement in 5G C-RAN over optical aggregation networks

Survivable BBU Placement for C-RAN over Optical Aggregation Networks

Contact Info

Product

Resources

About