Statistical multiplexing and traffic shaping games for network slicing

Jiaxiao Zheng, Pablo Caballero, Gustavo De Veciana, Seung Jun Baek, Albert Banchs

Research output: Contribution to journalArticlepeer-review

31 Citations (Scopus)


Next-generation wireless architectures are expected to enable slices of shared wireless infrastructure, which are customized to specific mobile operators/services. Given infrastructure costs and the stochastic nature of mobile services' spatial loads, it is highly desirable to achieve efficient statistical multiplexing among such slices. We study a simple dynamic resource sharing policy, which allocates a 'share' of a pool of (distributed) resources to each slice-share constrained proportionally fair (SCPF). We give a characterization of SCPF's performance gains over static slicing and general processor sharing. We show that higher gains are obtained when a slice's spatial load is more 'imbalanced' than, and/or 'orthogonal' to, the aggregate network load, and that the overall gain across slices is positive. We then address the associated dimensioning problem. Under SCPF, traditional network dimensioning translates to a coupled share dimensioning problem, which characterizes the existence of a feasible share allocation, given slices' expected loads and performance requirements. We provide a solution to robust share dimensioning for SCPF-based network slicing. Slices may wish to unilaterally manage their users' performance via admission control, which maximizes their carried loads subject to performance requirements. We show that this can be modeled as a 'traffic shaping' game with an achievable Nash equilibrium. Under high loads, the equilibrium is explicitly characterized, as are the gains in the carried load under SCPF versus static slicing. Detailed simulations of a wireless infrastructure supporting multiple slices with heterogeneous mobile loads show the fidelity of our models and the range of validity of our high-load equilibrium analysis.

Original languageEnglish
Article number8478215
Pages (from-to)2528-2541
Number of pages14
JournalIEEE/ACM Transactions on Networking
Issue number6
Publication statusPublished - 2018 Dec

Bibliographical note

Funding Information:
Manuscript received July 27, 2017; revised April 20, 2018; accepted August 25, 2018; approved by IEEE/ACM TRANSACTIONS ON NETWORK-ING Editor M. Schapira. Date of publication October 1, 2018; date of current version December 14, 2018. This work was supported by the National Research Foundation of Korea Grant through the Korean Government (MSIP) under Grant 2018R1A2B6007130. The work of J. Zheng was supported by a CISCO Research Gift. The work of A. Banchs was supported in part by the H2020 5G-MoNArch Project under Grant 761445 and in part by the 5GCity Project of the Spanish Ministry of Economy and Competitiveness under Grant TEC2016-76795-C6-3-R. (Corresponding author: Jiaxiao Zheng.) J. Zheng, P. Caballero, and G. de Veciana are with the Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TX 78712 USA (e-mail:

Publisher Copyright:
© 1993-2012 IEEE.


  • RAN-sharing
  • Wireless networks
  • multiplexing
  • network slicing
  • resource allocation
  • traffic shaping

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Statistical multiplexing and traffic shaping games for network slicing'. Together they form a unique fingerprint.

Cite this