M/G/1/K system with push-out scheme under vacation policy

DOI10.1155/S1048953396000159MaRDI QIDQ1925148zbMATH OpenFDO

Authors Shoji Kasahara, Hideaki Takagi, Yutaka Takahashi, Toshiharu Hasegawa

Publication date 18 March 1997

Published in Journal of Applied Mathematics and Stochastic Analysis (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/47612

zbMATH Keywords

FCFSLaplace-Stieltjes transformLCFSordinary blocking modelspush-out schemevacation

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

Summary: We consider an M/G/1/K system with push-out scheme and multiple vacations. This model is particularly important in situations where it is essential to provide short waiting times to messages which are selected for service. We analyze the behavior of two types of messages: one that succeeds in transmission and the other that fails. We derive the Laplace-Stieltjes transform of the waiting time distribution for the message which is eventually served. Finally, we show some numerical results including the comparisons between the push-out and the ordinary blocking models.

Recommendations

• Delay analysis of an \(M/G/1/K\) priority queueing system with push-out scheme
• Analysis of waiting time of M/G/1/K system with vacations under random scheduling and LCFS
• ANALYSIS OF AN M/G/1//N QUEUE WITH MULTIPLE SERVER VACATIONS, AND ITS APPLICATION TO A POLLING MODEL
• Transient workload distribution in the M/G/1 finite-buffer queue with single and multiple vacations
• Some waiting time analysis for certain queueing policies

Cited in

(1)

• Delay analysis of an \(M/G/1/K\) priority queueing system with push-out scheme

This page was built for publication: M/G/1/K system with push-out scheme under vacation policy

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