A Markov model of slice admission control
IEEE Networking Letters, 2018•ieeexplore.ieee.org
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.
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.
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果