Annals of the Institute of Statistical Mathematics

, Volume 42, Issue 3, pp 475–488 | Cite as

Invariance relations in single server queues with LCFS service discipline

  • Genji Yamazaki
Stochastic Processes
Received:
Revised:

Abstract

This paper is concerned with single server queues having LCFS service discipline. We give a condition to hold an invariance relation between time and customer average queue length distributions in the queues. The relation is a generalization of that in an ordinary GI/M/1 queue. We compare the queue length distributions for different single server queues with finite waiting space under the same arrival process and service requirement distribution of customer and derive invariance relations among them.

Key words and phrases

Queue last-come-first-served invariance relation loss system 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fakinos, D. (1981). The G/G/I queueing system with a particular queue discipline. J. Roy. Statist. Soc. Ser. B. 43, 190–196.Google Scholar
  2. Fakinos, D. (1987). The single server queue with service depending on queue size and with the preemptive resume last-come-first-served queue discipline. J. Appl. Probab., 24, 758–767.Google Scholar
  3. Franken, P., König, D., Arndt, U. and Schmidt, V. (1981). Queues and Point Processes. Akademic-Verlag, Berlin.Google Scholar
  4. Kelly, F. P. (1976). The departure process from a queueing system, Math. Camb. Phil. Soc., 80, 283–285.Google Scholar
  5. Miyazawa, M. (1979). A formal approach to queueing processes in the steady state and their applications. J. Appl. Probab., 16, 332–346.Google Scholar
  6. Miyazawa, M. (1983). The derivation of invariance relations in complex queueing systems with stationary inputs. Adv. in Appl. Probab., 15, 874–885.Google Scholar
  7. Miyazawa, M. (1986). Approximation of the queue-length distribution of an M/GI/s queue by the basic equations. J. Appl. Probab., 23, 443–458.Google Scholar
  8. Miyazawa, M. and Yamazaki, G. (1988). The basic equations for supplemented GSMP and its applications to queues. J. Appl. Probab., 25, 565–578.Google Scholar
  9. Shanthikumar, J. G. and Sumita, U. (1986). On G/G/1 queue with LIFO-P service discipline. J. Oper. Res. Soc. Japan, 29, 220–231.Google Scholar
  10. Stoyan, D. (1983). Comparison Methods for Queues and Other Stochastic Models, Wiley, New York.Google Scholar
  11. Yamazaki, G. (1982). The GI/G/1 queue with last-come-first-served, Ann. Inst. Statist. Math., 34, 599–644.Google Scholar
  12. Yamazaki, G. (1984). Invariance relations of GI/G/1 queueing systems with preemptive-resume last-come-first-served queue discipline, J. Oper. Res. Soc. Japan, 27, 338–346.Google Scholar

Copyright information

© The Institute of Statistical Mathematics 1990

Authors and Affiliations

  • Genji Yamazaki
    • 1
  1. 1.Department of Engineering ManagementTokyo Metropolitan Institute of TechnologyTokyoJapan

Personalised recommendations