Skip to main content
Log in

Decomposability in queues with background states

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

A symmetric queue is known to have a nice property, the so-called insensitivity. In this paper, we generalize this for a single node queue with Poisson arrivals and background state, which changes at completion instants of lifetimes as well as at the arrival and departure instants. We study this problem by using the decomposability property of the joint stationary distribution of the queue length and supplementary variables, which implies the insensitivity. We formulate a Markov process representing the state of the queue as an RGSMP (reallocatable generalized semi-Markov process), and give necessary and sufficient conditions for the decomposability. We then establish general criteria to be sufficient for the queue to possess the property. Various symmetric-like queues with background states, including continuous time versions of moving server queues, are shown to have the decomposability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. H. Daduna, Sojourn time distributions in non-product-form queueing networks, Research Report No. 94-7, Hamburg University (1994).

  2. H. Daduna and R. Schassberger, A discrete-time round-robin queue with Bernoulli input and general arithmetic service time distributions, Acta Informatica 15 (1981) 251–263.

    Google Scholar 

  3. H. Daduna and R. Schassberger, Networks of queues in discrete time, Z. Oper. Res. 27 (1983) 159–175.

    Google Scholar 

  4. W. Henderson and P.G. Taylor, Insensitivity in discrete time queues with a moving server, Queueing Systems 11 (1992) 273–297.

    Google Scholar 

  5. F.P. Kelly,Reversibility and Stochastic Networks (Wiley, New York, 1979).

    Google Scholar 

  6. M. Miyazawa, Insensitivity and product-form decomposability of reallocatable GSMP, Adv. Appl. Prob. 25 (1993), 415–437.

    Google Scholar 

  7. M.F. Neuts,Matrix Geometric Solutions in Stochastic Models: An Algorithmic Approach (Johns Hopkins University Press, Baltimore, MD, 1981).

    Google Scholar 

  8. C.A. O'cinneide, TheM/M/∞ queue in a random environment, J. Appl. Prob. 23 (1986) 175–184.

    Google Scholar 

  9. R. Schassberger, On the response time distribution in a discrete round-robin queue, Acta Informatica 16 (1981) 57–62.

    Google Scholar 

  10. R. Schassberger, The doubly stochastic server: A time-sharing model, Z. Oper. Res. 25 (1981) 179–189.

    Google Scholar 

  11. R. Schassberger, Two remarks on insensitive stochastic models, Adv. Appl. Prob. 18 (1986) 791–814.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This author is partially supported by NEC C&C Laboratories.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yamazaki, G., Miyazawa, M. Decomposability in queues with background states. Queueing Syst 20, 453–469 (1995). https://doi.org/10.1007/BF01245329

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01245329

Keywords

Navigation