GROVE: A Cost-Efficient Green Radio over Ethernet Architecture for Next Generation Radio Access Network
Abstract
Centralized/Cloud Radio Access Network (C-RAN) comes into prominence to reduce the rising energy consumptions and maintenance difficulties of the next-generation networks. However, C-RAN has strict delay requirements, and it needs large fronthaul bandwidth. Function splitting and Radio over Ethernet are two promising approaches to reduce these drawbacks of the C-RAN architecture. Meanwhile, the usage of renewable energy sources (RESs) in a C-RAN boosts the energy-efficiency potential of this network. In this paper, we propose a novel model, which is called Green Radio OVer Ethernet (GROVE), that merges these three approaches to maximize the benefits of C-RAN while maintaining the economic feasibility of this architecture. We briefly explain this model and formulate an operational expenditure minimization problem by considering the several restrictions due to the network design and the service provisioning. Then we linearize the quadratic routing decision constraints in the problem to solve it with a mixed-integer linear programming (MILP) solver. Results show that it is cost-effective to choose routing, function splitting, and RES decisions together. Our solution surpasses classical disjoint approaches for all studied cases. Besides, we provide a network scalability analysis to determine the MILP solver's limits for larger network topologies.
Keywords
Cite
@article{arxiv.2005.09081,
title = {GROVE: A Cost-Efficient Green Radio over Ethernet Architecture for Next Generation Radio Access Network},
author = {Turgay Pamuklu and Cem Ersoy},
journal= {arXiv preprint arXiv:2005.09081},
year = {2021}
}
Comments
Copyright 20XX IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works