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 journalArticle

3 Citations (Scopus)

Abstract

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
JournalIEEE/ACM Transactions on Networking
DOIs
Publication statusAccepted/In press - 2018 Jan 1

Fingerprint

Multiplexing
Telecommunication traffic
Access control
Costs

Keywords

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

ASJC Scopus subject areas

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

Cite this

Statistical Multiplexing and Traffic Shaping Games for Network Slicing. / Zheng, Jiaxiao; Caballero, Pablo; de Veciana, Gustavo; Baek, Seung Jun; Banchs, Albert.

In: IEEE/ACM Transactions on Networking, 01.01.2018.

Research output: Contribution to journalArticle

Zheng, Jiaxiao ; Caballero, Pablo ; de Veciana, Gustavo ; Baek, Seung Jun ; Banchs, Albert. / Statistical Multiplexing and Traffic Shaping Games for Network Slicing. In: IEEE/ACM Transactions on Networking. 2018.
@article{83f2298687bd497cb895d4e99cd798c8,
title = "Statistical Multiplexing and Traffic Shaping Games for Network Slicing",
abstract = "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.",
keywords = "multiplexing, network slicing, RAN-sharing, resource allocation, traffic shaping., Wireless networks",
author = "Jiaxiao Zheng and Pablo Caballero and {de Veciana}, Gustavo and Baek, {Seung Jun} and Albert Banchs",
year = "2018",
month = "1",
day = "1",
doi = "10.1109/TNET.2018.2870184",
language = "English",
journal = "IEEE/ACM Transactions on Networking",
issn = "1063-6692",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Statistical Multiplexing and Traffic Shaping Games for Network Slicing

AU - Zheng, Jiaxiao

AU - Caballero, Pablo

AU - de Veciana, Gustavo

AU - Baek, Seung Jun

AU - Banchs, Albert

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

KW - multiplexing

KW - network slicing

KW - RAN-sharing

KW - resource allocation

KW - traffic shaping.

KW - Wireless networks

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

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

U2 - 10.1109/TNET.2018.2870184

DO - 10.1109/TNET.2018.2870184

M3 - Article

AN - SCOPUS:85054381062

JO - IEEE/ACM Transactions on Networking

JF - IEEE/ACM Transactions on Networking

SN - 1063-6692

ER -