Premium
Waiting times for M/G /1 queues with service‐time or delay‐dependent server vacations
Author(s) -
Brill P. H.,
Harris C. M.
Publication year - 1992
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199210)39:6<775::aid-nav3220390604>3.0.co;2-k
Subject(s) - computer science , service (business) , queue , workload , queueing theory , function (biology) , operations research , type of service , real time computing , computer network , mathematics , operating system , evolutionary biology , biology , economy , economics
This article shows how to determine the stationary distribution of the virtual wait in M/G/1 queues with either one‐at‐a‐time or exhaustive server vacations, depending on either service times or accrued workload. For the first type of dependence, each vacation time is a function of the immediately preceding service time or of whether the server finds the system empty after returning from vacation. In this way, it is possible to model situations such as long service times followed by short vacations, and vice versa. For the second type of dependence, the vacation time assigned to an arrival to follow its service is a function of the level of virtual wait reached. By this device, we can model situations in which vacations may be shortened whenever virtual delays have gotten excessive. The method of analysis employs level‐crossing theory, and examples are given for various cases of service and vacation‐time distributions. A closing discussion relates the new model class to standard M/G/1 queues where the service time is a sum of variables having complex dependencies. © 1992 John Wiley & Sons, Inc.