Journal article Open Access

A Markov Model of Slice Admission Control

Han, Bin; Feng, Di; Schotten, Hans

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>Han, Bin</dc:creator>
  <dc:creator>Feng, Di</dc:creator>
  <dc:creator>Schotten, Hans</dc:creator>
  <dc:description>The emerging feature of network slicing in future fifth generation 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 letter 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</dc:description>
  <dc:description>© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.</dc:description>
  <dc:source>IEEE Networking Letters 1(1) 2 - 5</dc:source>
  <dc:title>A Markov Model of Slice Admission Control</dc:title>
Views 82
Downloads 235
Data volume 91.0 MB
Unique views 79
Unique downloads 234


Cite as