Analyses of priority queues with server control

MaRDI QIDQ761343zbMATH OpenFDO

Authors J. George Shanthikumar

Publication date 1984

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

Laplace-Stieltjes transformslevel crossing analysesremovable serverseveral non-preemptive priority classessingle server queuesingle server queueswaiting time distributions

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Review text

This paper is concerned with waiting time distributions in single server queues with several non-preemptive priority classes of customers. The arrival pattern is Poissonian for all classes. Such queueing systems have been analysed in the literature and this paper considers two models where the server may take a vacation when the queue is empty. In the first model the server scans the queue after a time period T once a busy period ends. Service is suspended for this interval of time. It starts after the scan if customers are present. If the queue is empty at the time of the scan another scan is made after a time T. The duration T of the server vacation is also assumed to be a random variable. The second model is a variation of the first where the server makes only one scan and stays alert till the start of the next busy period. This alert period is a waiting period for the server. At the end of every busy period a server vacation occurs. The author derives the Laplace-Stieltjes transforms of the waiting time and its first two moments for both these models. A recursive relation is given for the higher moments. The method makes use of level crossing analyses for regenerative processes.

Recommendations

• scientific article; zbMATH DE number 4041013
• Waiting time analysis for \(\text{M}^X/\text{G}/1\) priority queues with/without vacations under random order of service discipline
• Virtual waiting times in priority-\(M/G/1\) queues with vacations
• The stationary waiting time process in single-server priority queues with general low priority arrival process
• An Invariance in the Priority Queue with Generalized Server Vacations and Structured Batch Arrivals

Cited in

(8)

• Control of the service process in a queueing system
• A priority M/G/1 queue with application to voice/data communication
• Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue
• Priority queues with batch Poisson arrivals
• Virtual waiting times in priority-\(M/G/1\) queues with vacations
• Optimal Control of an M/G/1 Priority Queue Via N-Control
• An N-Server Cutoff Priority Queue
• scientific article; zbMATH DE number 4126452 (Why is no real title available?)

This page was built for publication: Analyses of priority queues with server control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q761343)