Papers
Topics
Authors
Recent
Search
2000 character limit reached

PlaceRAN: Optimal Placement of Virtualized Network Functions in the Next-generation Radio Access Networks

Published 25 Feb 2021 in cs.NI | (2102.13192v4)

Abstract: The fifth-generation mobile evolution enables several transformations on Next Generation Radio Access Networks (NG-RAN). The RAN protocol stack is splitting into eight possible disaggregated options combined into three network units, i.e., Central, Distributed, and Radio. Besides that, further advances allow the RAN software to be virtualized on top of general-purpose vendor-neutral hardware, dealing with the concept of virtualized RAN (vRAN). The disaggregated network units initiatives reach full interoperability based on the Open RAN (O-RAN). The combination of NG-RAN and vRAN results in vNG-RAN, enabling the management of disaggregated units and protocols as a set of radio functions. The placement of these functions is challenging since the best decision can be based on multiple constraints, such as the RAN protocol stack split, routing paths of transport networks with restricted bandwidth and latency requirements, different topologies and link capabilities, asymmetric computational resources, etc. This article proposes the first exact model for the placement optimization of radio functions for vNG-RAN planning, named PlaceRAN. The main objective is to minimize the computing resources and maximize the aggregation of radio functions. The PlaceRAN evaluation considered two realistic network topologies. Our results reveal that the PlaceRAN model achieves an optimized high-performance aggregation level, it is flexible for RAN deployment overcoming the network restrictions, and it is up to date with the most advanced vNG-RAN design and development.

Citations (8)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.