Network Slicing Games: Enabling Customization in Multi-Tenant Networks
Pablo Caballero, Albert Banchs, Gustavo de Veciana, Xavier, Costa-Perez

TL;DR
This paper analyzes a game-theoretic model for network slicing that allows tenants to customize resource allocations, demonstrating convergence to Nash equilibrium and providing bounds on efficiency and fairness.
Contribution
It offers a novel game-theoretic analysis of share-constrained proportional allocation for network slicing, including convergence, efficiency, and fairness guarantees.
Findings
Game converges to Nash equilibrium under certain conditions
Tenants achieve equal or better performance at equilibrium compared to static partitioning
Provides bounds on price of anarchy and envy-freeness
Abstract
Network slicing to enable resource sharing among multiple tenants --network operators and/or services-- is considered a key functionality for next generation mobile networks. This paper provides an analysis of a well-known model for resource sharing, the 'share-constrained proportional allocation' mechanism, to realize network slicing. This mechanism enables tenants to reap the performance benefits of sharing, while retaining the ability to customize their own users' allocation. This results in a network slicing game in which each tenant reacts to the user allocations of the other tenants so as to maximize its own utility. We show that, under appropriate conditions, the game associated with such strategic behavior converges to a Nash equilibrium. At the Nash equilibrium, a tenant always achieves the same, or better, performance than under a static partitioning of resources, hence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
