Sojourn time analysis for a cyclic-service tandem queueing model with general decrementing service

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A sojourn time analysis is provided for a cyclic-service tandem queue with general decrementing service which operates as follows: starting once a service of queue 1 in the first stage, a single server continues serving messages in queue 1 until either queue 1 becomes empty, or the number of messages decreases to k less than that found upon the server's last arrival at queue 1, whichever occurs first, where 1 ≤ k ≤ ∞. After service completion in queue 1, the server switches over to queue 2 in the second stage and serves all messages in queue 2 until it becomes empty. It is assumed that an arrival stream is Poissonian, message service times at each stage are generally distributed and switch-over times are zero. This paper analyzes joint queue-length distributions and message sojourn time distributions. © 1995.

Cite

CITATION STYLE

APA

Katayama, T., & Kobayashi, K. (1995). Sojourn time analysis for a cyclic-service tandem queueing model with general decrementing service. Mathematical and Computer Modelling, 22(10–12), 131–139. https://doi.org/10.1016/0895-7177(95)00189-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free