Graduate School and Research Center in Digital Sciences

Efficient multi-service RAN slice management and orchestration

Schmidt, Robert; Nikaein, Navid

NOMS 2020, IEEE/IFIP Network Operations and Management Symposium, 20-24 April 2020, Budapest, Hungary

The 5G mobile network is supposed to handle a variety of services with different requirements. By means of virtualization, network slices form customized virtual networks transporting services with associated service guarantees. Especially the radio access network (RAN) requires an efficient multiplexing of multiple services onto the sparse radio resources. In this demo, we show how a RAN can be dynamically customized without service interruptions for different slices. In particular, our solution considers the slice requirements and adapts the slicing algorithm without interrupting other slices in the network. This allows an efficient resource usage while respecting isolation and performance requirements, in particular latency. Furthermore, dynamic end-to-end slicing is enabled by automatically adding core networks as required by the slice owner. Finally, this solution allows to compare different slice algorithm implementations.

Document Bibtex

Title:Efficient multi-service RAN slice management and orchestration
Type:Poster / Demo
Language:English
City:Budapest
Country:HUNGARY
Date:
Department:Communication systems
Eurecom ref:6240
Copyright: © 2020 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Bibtex: @poster / demo{EURECOM+6240, year = {2020}, title = {{E}fficient multi-service {RAN} slice management and orchestration}, author = {{S}chmidt, {R}obert and {N}ikaein, {N}avid}, number = {EURECOM+6240}, month = {04}, institution = {Eurecom} address = {{B}udapest, {HUNGARY}}, url = {http://www.eurecom.fr/publication/6240} }
See also: