A Markov Model of Slice Admission Control
Bin Han, Di Feng, Hans D. Schotten

TL;DR
This paper introduces a Markovian state model for slice admission control in 5G networks, providing an analytical approximation to enhance computational efficiency.
Contribution
It proposes a general Markovian state model for slice admission control and an analytical approximation of the transition matrix to reduce complexity.
Findings
Model is proven to be Markovian under weak constraints
Analytical approximation effectively reduces computational complexity
Model facilitates efficient slice management in 5G networks
Abstract
The emerging feature of network slicing in future Fifth Generation (5G) networks calls for efficient slice management. Recent studies have been focusing on the mechanism of slice admission control, which functions in a manner of state machine. This paper proposes a general state model for synchronous slice admission control, and proves it to be Markovian under a set of weak constraints. An analytical approximation of the state transition matrix to reduce computational complexity in practical applications is also proposed and evaluated.
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.
