Joint Virtual Computing and Radio Resource Allocation in Limited Fronthaul Green C-RANs

Luong, Phuong; Gagnon, François; Despins, Charles; Tran, Le-Nam

doi:10.1109/twc.2018.2799859

Cited by 33 publications

(21 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since we are using G k for interference limited case in (3), the throughput of each UE becomes a constant. In (15) the SBS intensity λ k is a variable that the MNO will need to decide when renting the infrastructure from the local 5G OP. We can oSBServe from (15) that increasing the SBS intensity lowers the transmission delay.…”

Section: Modeling Wireless Access Delay In a Cache-enabled Cellulamentioning

confidence: 99%

“…We substitute the expression for E[D Tk ] from (15) in (25), we obtain a lower bound for the SBS intensity required to satisfy the constraint in (25) and hence the constraint in (22) as follows :…”

Section: A Optimization Problem Formulationmentioning

confidence: 99%

“…To tackle this challenge, the concept of proactive caching was introduced [16]- [19] in which popular contents are stored at the edge/radio access network (RAN), e.g., cacheenabled BSs to reduce the wireless access delay. In [15], the virtualization technique in the downlink transmission of limited fronthaul capacity cloud-radio access networks was considered. The authors formulated an optimization problem to maximize network energy efficiency by a joint design of virtual computing resources, transmit beamforming, remote radio head (RRH) selection, and RRH-UE association.…”

Section: Introduction a Motivationmentioning

confidence: 99%

See 2 more Smart Citations

Radio Resource Sharing and Edge Caching with Latency Constraint for Local 5G Operator: Geometric Programming Meets Stackelberg Game

Sanguanpuak

Niyato

Rajatheva

2021

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

The rapidly increasing demand in indoor small cell networks has given rise to the concept of local 5G operator (OP) for local service delivery. In this regard, we develop a novel game-theoretic framework with geometric programming to model and analyze cache-enabled small cell base stations (SBSs) with infrastructure sharing for local 5G OP networks. In such a network, the local 5G OP provides wireless network in indoor area and rent out the infrastructure which are RAN and cache storage to multiple mobile network operators (MNOs) while guarantee the quality-of-experience (QoE) at the users (UEs) of MNOs. We formulate a Stackelberg game model where the local 5G OP is the leader and the MNOs are the followers. The local 5G OP aims to maximize its profit by optimizing its infrastructure rental fee, and the MNOs aim to minimize their renting cost of infrastructure by minimizing the "cache intensity" subject to latency constraint at each UE. Here, the cache intensity is defined as the product of the number of SBSs per unit area and the number of popular files stored in each SBS. The optimization problems of the local 5G OP and the MNOs are transformed into geometric programming. Accordingly, the subgame perfect equilibrium of Stackelberg game is obtained through the succesive geometric programming (SGP) method. Since the MNOs share their rented infrastructure, for cost sharing, we apply the concept of Shapley value to divide the cost among the MNOs. We show that the cost sharing problem can be mapped into a simplified "airport runway cost sharing problem", in which the Shapley value can be computed efficiently. Finally, we present an extensive performance evaluation that reveals interesting insights into designing resource sharing with edge caching in local 5G OP networks.

show abstract

Section: Modeling Wireless Access Delay In a Cache-enabled Cellulamentioning

confidence: 99%

Section: A Optimization Problem Formulationmentioning

confidence: 99%

Section: Introduction a Motivationmentioning

confidence: 99%

See 1 more Smart Citation

Radio Resource Sharing and Edge Caching with Latency Constraint for Local 5G Operator: Geometric Programming Meets Stackelberg Game

Sanguanpuak

Niyato

Rajatheva

2021

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…Research presented by [23] follows a novel approach where the author's distinguishably remark and account the traffic which is present in the network at the time of applying optimization algorithms. Although this research is not in-line with fronthaul or C-RAN, the same logic of accounting traffic which is present in the network is taken into consideration.…”

Section: Related Workmentioning

confidence: 99%

Evaluation of Underlying Switching Mechanism for Future Networks with P4 and SDN (Workshop Paper)

Fernando

Xiao

Che

2019

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Software Defined Networking (SDN) was introduced with a philosophy of decoupling the control plane from the data plane which facilitates network management while ensuring programmability in order to improve performance and monitoring. OpenFlow which enabled SDN was first introduced to match twelve header fields whilst at current it matches forty one which is expected to grow exponentially. Therefore future networks must have the ability to flexibly parse packets through a common interface. Programming Protocol independent Packet Processing (P4) was introduced to achieve the aforementioned by programming the underlying switch, providing instructions and utilizing APIs to populate the forwarding tables. A P4 programmed switch will forward packets through a parser into multiple stages of match+action tables to find the destination node which is considered the most efficient mechanism for routing. This paper takes into the account the latest platform developed for service providers, Open Networking Operating System (ONOS) to deploy two environments configured in the aforementioned technologies in order to test their performance. Four case studies were drawn which were simulated in Mininet which incorporated SDN + P4 switches. A significant increase of performances were recorded when compared with the the performance of cases using SDN only.

show abstract

“…Recently, cloud radio access networks (C-RANs) have been proposed, which are enhancements of classical RAN architectures through the cloudification and virtualizations techniques to comply with the requirements of envisioned 5G mobile networks. In C-RANs, the base station functionalities are split into distributed units known as the remote radio heads (RRHs) and central units known as the baseband units (BBUs), which are virtualized and pool at a central cloud [2]. The C-RANs approach brings several advantages for the network operators, including a reduction in the operational, management, and energy costs, as well as effective implementations of the coordinated multipoint (CoMP) transmission and reception schemes for the inter-cell interference mitigations [3].…”

Section: Introductionmentioning

confidence: 99%

Performance Improvement of Ethernet-Based Fronthaul Bridged Networks in 5G Cloud Radio Access Networks

Waqar

Kim

2019

Applied Sciences

View full text Add to dashboard Cite

Cloud radio access networks (C-RANs) are emerging architectural solutions to anticipate the increased capacity and quality demands of future 5G cellular networks at a reduced cost. In C-RANs, a transport segment referred to as fronthaul has been defined, which become a major constraint in practical implementations due to its high cost. A transport protocol referred to as eCPRI (enhanced common public radio interface), which was specifically designed for the fronthaul networks, imposes stringent end-to-end (E2E) latency and capacity requirements, which can be satisfied through the extortionate optical links. The high implementation cost of optical fronthaul networks significantly increased the system cost and made the fronthaul a hurdle to accomplish the cost–benefits of the C-RANs’ architecture. The globally deployed Ethernet networks could be leveraging solutions, but are inadequate to comply with the eCPRI requirements in fronthaul bridged networks and result in intolerable latencies due to ineffectual traditional quality of service aware forwarding schemes. Therefore, to realize the cost–benefits of ubiquitously deployed Ethernet infrastructure, this paper proposes the E2E latency aware path computation and packet forwarding schemes, which ameliorate the performance of Ethernet-based fronthaul bridged networks to transport the eCPRI traffic at tolerable latencies. The simulation results verify the feasibility of low-cost Ethernet to carry the eCPRI traffic streams up to 100 Gbps with the proposed schemes in fronthaul bridged networks.

show abstract

Joint Virtual Computing and Radio Resource Allocation in Limited Fronthaul Green C-RANs

Abstract: The UCD community has made this article openly available. Please share how this access benefits you. Your story matters! (@ucd_oa) Some rights reserved. For more information, please see the item record link above.

Cited by 33 publications

References 43 publications

Radio Resource Sharing and Edge Caching with Latency Constraint for Local 5G Operator: Geometric Programming Meets Stackelberg Game

Radio Resource Sharing and Edge Caching with Latency Constraint for Local 5G Operator: Geometric Programming Meets Stackelberg Game

Evaluation of Underlying Switching Mechanism for Future Networks with P4 and SDN (Workshop Paper)

Performance Improvement of Ethernet-Based Fronthaul Bridged Networks in 5G Cloud Radio Access Networks

Contact Info

Product

Resources

About