Approximate Formulas for Characteristics of Multichannel LIFO Preemptive-Resume Priority Queueing System
From MaRDI portal
Publication:6402477
arXiv2206.09263MaRDI QIDQ6402477FDOQ6402477
Authors: A. G. Tatashev, O. V. Seleznjev, Marina V. Yashina 
Publication date: 18 June 2022
Abstract: This paper considers a multichannel preemptive-resume priority queueing system with a Poisson input and an arbitrary service time distribution depending on the priority of job. Jobs of the same priority are serviced according to the LIFO rule. If, at moment of job arrival, all servers are busy, and at least one server is busy with the service of a job of a not higher than the priority of arriving job, then the service of a job is preempted such that the priority of preempted job is lowest from the priorities of the jobs in service. The service of a preempted job is resumed later. The paper proposes approximate formulas for the sojourn time of a prescribed priority job and some other characteristics of the system.
Queueing theory (aspects of probability theory) (60K25) Processes in random environments (60K37) Other physical applications of random processes (60K40)
This page was built for publication: Approximate Formulas for Characteristics of Multichannel LIFO Preemptive-Resume Priority Queueing System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6402477)
