Performance Evaluation of v-eNodeB using Virtualized Radio Resource Management

With the demand upsurge for high bandwidth services, continuous increase in the number of cellular subscriptions, adoption of Internet of Things (IoT), and marked growth in Machine-to-Machine (M2M) traffic, there is great stress exerted on cellular network infrastructure. The present wireline and wireless networking technologies are rigid in nature and heavily hardware-dependent, as a result of which the process of infrastructure upgrade to keep up with future demand is cumbersome and expensive. Software-defined networks (SDN) hold the promise to decrease network rigidity by providing central control and flow abstraction, which in current network setups are hardware-based. The embrace of SDN in traditional cellular networks has led to the implementation of vital network functions in the form of software that are deployed in virtualized environments. This approach to move crucial and hardware intensive network functions to virtual environments is collectively referred to as network function virtualization (NFV). Our work evaluates the cost reduction and energy savings that can be achieved by the application of SDN and NFV technologies in cellular networks. In this thesis, we implement a virtualized eNodeB component (Radio Resource Management) to add agility to the network setup and improve performance, which we compare with a traditional resource manager. When combined with dynamic network resource allocation techniques proposed in Elastic Handoff, our hardware agnostic approach can achieve a greater reduction in capital and operational expenses through optimal use of network resources and efficient energy utilization. Advisor: Jitender S. Deogu

Slice allocation and pricing framework for virtualized millimeter wave cellular networks

Traditionally, the cellular spectrum is allocated to operators (OPs) through auctions, as ideal mechanisms to discover market prices and allocate scarce resources. Even though spectrum is indeed scarce in sub-6 GHz bands, it becomes abundant in millimeter-wave (mmWave) bands. Interestingly, in that context, it is base station (BS) density which is limiting, and thus a critical factor, due to the outage phenomena in urban environments. Facing BS scarcity is one of the main reasons to foster virtualization techniques aimed at improving utilization and lowering costs. We consider a scenario with an infrastructure provider (InP) owner of a number of BSs and a set of OPs with their users (UEs). We propose a three-phase framework to price network infrastructure slices (NISs) and allocate them to OPs and to efficiently associate UEs with those NISs. The framework stages are: 1) an initial association, 2) a distributed auction mechanism across the BSs to allocate resources to Ops, and 3) a re-association process where the OPs can optimize the NISs they are awarded. The auction incentivizes OPs to bid truthfully and the outcome yields both socially optimal NISs and Vickrey-Clarke-Groves (VCG) prices. For the re-association phase, we propose deterministic and stochastic exchange-matching algorithms and demonstrate their convergence to stable matching and stable-optimal matching, respectively.Ministerio de Economía, Industria y Competitividad | Ref. TEC2016-76465-C2-2-RXunta de Galicia | Ref. GRC 2018/5

Energy efficiency using cloud management of LTE networks employing fronthaul and virtualized baseband processing pool

The cloud radio access network (C-RAN) emerges as one of the future solutions to handle the ever-growing data traffic, which is beyond the physical resources of current mobile networks. The C-RAN decouples the traffic management operations from the radio access technologies, leading to a new combination of a virtualized network core and a fronthaul architecture. This new resource coordination provides the necessary network control to manage dense Long-Term Evolution (LTE) networks overlaid with femtocells. However, the energy expenditure poses a major challenge for a typical C-RAN that consists of extended virtualized processing units and dense fronthaul data interfaces. In response to the power efficiency requirements and dynamic changes in traffic, this paper proposes C-RAN solutions and algorithms that compute the optimal backup topology and network mapping solution while denying interfacing requests from low-flow or inactive femtocells. A graph-coloring scheme is developed to label new formulated fronthaul clusters of femtocells using power as the performance metric. Additional power savings are obtained through efficient allocations of the virtualized baseband units (BBUs) subject to the arrival rate of active fronthaul interfacing requests. Moreover, the proposed solutions are used to reduce power consumption for virtualized LTE networks operating in the Wi-Fi spectrum band. The virtualized network core use the traffic load variations to determine those femtocells who are unable to transmit to switch them off for additional power savings. The simulation results demonstrate an efficient performance of the given solutions in large-scale network models

Antenna allocation and pricing in virtualized massive MIMO networks via Stackelberg game

We study a resource allocation problem for the uplink of a virtualized massive multiple-input multiple-output (MIMO) system, where the antennas at the base station are priced and virtualized among the service providers (SPs). The mobile network operator (MNO) who owns the infrastructure decides the price per antenna, and a Stackelberg game is formulated for the net profit maximization of the MNO, while minimum rate requirements of SPs are satisfied. To solve the bi-level optimization problem of the MNO, we first derive the closed-form best responses of the SPs with respect to the pricing strategies of the MNO, such that the problem of the MNO can be reduced to a single-level optimization. Then, via transformations and approximations, we cast the MNO’s problem with integer constraints into a signomial geometric program (SGP), and we propose an iterative algorithm based on the successive convex approximation (SCA) to solve the SGP. Simulation results show that the proposed algorithm has performance close to the global optimum. Moreover, the interactions between the MNO and SPs in different scenarios are explored via simulations

Resource slicing in virtual wireless networks: a survey

New architectural and design approaches for radio access networks have appeared with the introduction of network virtualization in the wireless domain. One of these approaches splits the wireless network infrastructure into isolated virtual slices under their own management, requirements, and characteristics. Despite the advances in wireless virtualization, there are still many open issues regarding the resource allocation and isolation of wireless slices. Because of the dynamics and shared nature of the wireless medium, guaranteeing that the traffic on one slice will not affect the traffic on the others has proven to be difficult. In this paper, we focus on the detailed definition of the problem, discussing its challenges. We also provide a review of existing works that deal with the problem, analyzing how new trends such as software defined networking and network function virtualization can assist in the slicing. We will finally describe some research challenges on this topic.Peer ReviewedPostprint (author's final draft