Markov Chain Based Priority Queueing Model for Packet Scheduling and Bandwidth Allocation

2017 ◽  
pp. 91-103 ◽  
Author(s):  
Reema Sharma ◽  
Navin Kumar ◽  
T. Srinivas
Keyword(s):  
Markov Chain ◽  
Bandwidth Allocation ◽  
Packet Scheduling ◽  
Queueing Model ◽  
Priority Queueing

scholarly journals ON THE STABILITY OF A BANDWIDTH PACKING ALGORITHM

2000 ◽  
Vol 14 (1) ◽  
pp. 57-79 ◽  
Author(s):  
Jean-François Dantzer ◽  
Mostafa Haddani ◽  
Philippe Robert
Keyword(s):  
Markov Chain ◽  
Bandwidth Allocation ◽  
Transient Behavior ◽  
Finite Markov Chain ◽  
Countable State Space ◽  
Countable State ◽  
The Stability ◽  
Bandwidth Packing ◽  
Bandwidth Allocation Algorithm ◽  
Transient Markov Chain

The stability properties of the bandwidth allocation algorithm First Fit are analyzed for some distributions on the sizes of the requests. Fluid limits are used to get the ergodicity results. When there are two possible sizes, the description of the transient behavior involves a finite Markov chain on the exit states of a transient Markov chain on a countable state space. The explicit expression of this exit matrix is given.

Sign in / Sign up

Export Citation Format

Share Document