Analysis of a time-limited service priority queueing system with exponential timer and server vacations |
| |
Authors: | Tsuyoshi Katayama |
| |
Institution: | (1) Department of Electronics and Informatics, Toyama Prefectural University, Kosugi Toyama, 939-0398, Japan |
| |
Abstract: | We consider a multi-class priority queueing system with a non-preemptive time-limited service controlled by an exponential
timer and multiple (or single) vacations. By reducing the service discipline to the Bernoulli schedule, we obtain an expression
for the Laplace-Stieltjes transform (LST) of the waiting time distribution via an iteration procedure, and a recursive scheme
to calculate the first two moments. It is noted that we have to select embedded Markov points based on the service beginning
epochs instead of the service completion epochs adopted for most of M/G/1 queueing analyses. Through the queue-length analysis, we obtain a decomposition form for the LST of the waiting time in
each queue having the exhaustive service.
|
| |
Keywords: | Flexible priority system Time-limited service Stochastic decomposition Iterative functional equations |
本文献已被 SpringerLink 等数据库收录! |
|