PRAN

Programmable radio access networks

Wenfei Wu, Li Erran Li, Aurojit Panda, Scott Shenker

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

With the continued exponential growth of mobile traffic and the rise of diverse applications, the current LTE radio access network (RAN) architecture of cellular operators face mounting challenges. Current RAN suffers from insufficient radio resource coordination, inefficient infrastructure utilization, and inflexible data paths. We present the high level design of PRAN, which centralizes base stations' L1/L2 processing into a cluster of commodity servers. PRAN uses a flexible data path model to support new protocols; multiple base stations' L1/L2 processing tasks are scheduled on servers with performance guarantees; and a RAN scheduler coordinates the allocation of shared radio resources between operators and base stations. Our evaluation shows the feasibility of fast data path control and efficiency of resource pooling (a potential for a 30× reduction on resources).

Original languageEnglish (US)
Title of host publicationProceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014
PublisherAssociation for Computing Machinery, Inc
ISBN (Electronic)9781450332569
DOIs
StatePublished - Jan 1 2014
Event13th ACM SIGCOMM Workshop on Hot Topics in Networks, HotNets 2014 - Los Angeles, United States
Duration: Oct 27 2014Oct 28 2014

Other

Other13th ACM SIGCOMM Workshop on Hot Topics in Networks, HotNets 2014
CountryUnited States
CityLos Angeles
Period10/27/1410/28/14

Fingerprint

Base stations
Servers
Processing
Network architecture
Mountings
Network protocols

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Wu, W., Li, L. E., Panda, A., & Shenker, S. (2014). PRAN: Programmable radio access networks. In Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014 [2673865] Association for Computing Machinery, Inc. https://doi.org/10.1145/2670518.2673865

PRAN : Programmable radio access networks. / Wu, Wenfei; Li, Li Erran; Panda, Aurojit; Shenker, Scott.

Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014. Association for Computing Machinery, Inc, 2014. 2673865.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wu, W, Li, LE, Panda, A & Shenker, S 2014, PRAN: Programmable radio access networks. in Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014., 2673865, Association for Computing Machinery, Inc, 13th ACM SIGCOMM Workshop on Hot Topics in Networks, HotNets 2014, Los Angeles, United States, 10/27/14. https://doi.org/10.1145/2670518.2673865
Wu W, Li LE, Panda A, Shenker S. PRAN: Programmable radio access networks. In Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014. Association for Computing Machinery, Inc. 2014. 2673865 https://doi.org/10.1145/2670518.2673865
Wu, Wenfei ; Li, Li Erran ; Panda, Aurojit ; Shenker, Scott. / PRAN : Programmable radio access networks. Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014. Association for Computing Machinery, Inc, 2014.
@inproceedings{83b62203c8274322b88a67d89597c3d6,
title = "PRAN: Programmable radio access networks",
abstract = "With the continued exponential growth of mobile traffic and the rise of diverse applications, the current LTE radio access network (RAN) architecture of cellular operators face mounting challenges. Current RAN suffers from insufficient radio resource coordination, inefficient infrastructure utilization, and inflexible data paths. We present the high level design of PRAN, which centralizes base stations' L1/L2 processing into a cluster of commodity servers. PRAN uses a flexible data path model to support new protocols; multiple base stations' L1/L2 processing tasks are scheduled on servers with performance guarantees; and a RAN scheduler coordinates the allocation of shared radio resources between operators and base stations. Our evaluation shows the feasibility of fast data path control and efficiency of resource pooling (a potential for a 30× reduction on resources).",
author = "Wenfei Wu and Li, {Li Erran} and Aurojit Panda and Scott Shenker",
year = "2014",
month = "1",
day = "1",
doi = "10.1145/2670518.2673865",
language = "English (US)",
booktitle = "Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

T1 - PRAN

T2 - Programmable radio access networks

AU - Wu, Wenfei

AU - Li, Li Erran

AU - Panda, Aurojit

AU - Shenker, Scott

PY - 2014/1/1

Y1 - 2014/1/1

N2 - With the continued exponential growth of mobile traffic and the rise of diverse applications, the current LTE radio access network (RAN) architecture of cellular operators face mounting challenges. Current RAN suffers from insufficient radio resource coordination, inefficient infrastructure utilization, and inflexible data paths. We present the high level design of PRAN, which centralizes base stations' L1/L2 processing into a cluster of commodity servers. PRAN uses a flexible data path model to support new protocols; multiple base stations' L1/L2 processing tasks are scheduled on servers with performance guarantees; and a RAN scheduler coordinates the allocation of shared radio resources between operators and base stations. Our evaluation shows the feasibility of fast data path control and efficiency of resource pooling (a potential for a 30× reduction on resources).

AB - With the continued exponential growth of mobile traffic and the rise of diverse applications, the current LTE radio access network (RAN) architecture of cellular operators face mounting challenges. Current RAN suffers from insufficient radio resource coordination, inefficient infrastructure utilization, and inflexible data paths. We present the high level design of PRAN, which centralizes base stations' L1/L2 processing into a cluster of commodity servers. PRAN uses a flexible data path model to support new protocols; multiple base stations' L1/L2 processing tasks are scheduled on servers with performance guarantees; and a RAN scheduler coordinates the allocation of shared radio resources between operators and base stations. Our evaluation shows the feasibility of fast data path control and efficiency of resource pooling (a potential for a 30× reduction on resources).

UR - http://www.scopus.com/inward/record.url?scp=84914674830&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84914674830&partnerID=8YFLogxK

U2 - 10.1145/2670518.2673865

DO - 10.1145/2670518.2673865

M3 - Conference contribution

BT - Proceedings of the 13th ACM Workshop on Hot Topics in Networks, HotNets 2014

PB - Association for Computing Machinery, Inc

ER -