Queue Content Analysis in a 2-Class Discrete-Time Queueing System under the Slot-Bound Priority Service Rule
The paper we present here introduces a new priority mechanism in discrete-time queueing systems. It is a milder form of priority when compared to HoL priority, but it favors customers of one type over the other when compared to regular FCFS. It also provides an answer to the starvation problem that...
Main Authors: | Sofian De Clercq, Bart Steyaert, Herwig Bruneel |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2012/425630 |
Similar Items
-
The 𝑁×𝐷-BMAP/G/1 Queueing Model: Queue Contents and Delay Analysis
by: Bart Steyaert, et al.
Published: (2011-01-01) -
Brownian models of queueing networks with static classes priority service rule
by: Yu-Ching Chang, et al.
Published: (1999) -
Verification of the Stability of a Two-Server Queueing System With Static Priority
by: Evsey Morozov, et al.
Published: (2018-05-01) -
Priority queues
by: Reed, R. J.
Published: (1971) -
Some aspects of priority queues
by: Chiyoshi, F. Y.
Published: (1973)