Abstract

Abstract A general single-server preemptive queueing model with multiple queues, priorities and feedback is considered, which includes the ordinary preemptive policy and Bernoulli feedback. In the model, there are K queues, jobs arrive according to a Poisson process at every queue, and the service time in every queue is exponential. Upon completion of a job in queue k , m l jobs are fed back to queue l for l = 1, 2,…, K with a probability depending on k , m l ,…, m k . Jobs in queue k have preemptive priority over jobs in queue l , when k l . We derive the generating functions of the joint queue-lengths probabilities in stationary state at departure instants, at joint departure and preemption instants, at output instants, and at random instants, along with the Laplace-Stieltjes transform of the total sojourn time of a linear sequence of jobs, for any sequence of their priorities. As a special case, we deal with the two-queue system.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.