Hostname: page-component-78c5997874-s2hrs Total loading time: 0 Render date: 2024-11-10T16:40:17.267Z Has data issue: false hasContentIssue false
  • English
  • Français

On the system queue length distributions of LCFS-P queues with arbitrary acceptance and restarting policies

Part of: Special processes Stochastic processes Operations research and management science

Published online by Cambridge University Press:  14 July 2016

Masakiyo Miyazawa
Masakiyo Miyazawa*
Affiliation:
Science University of Tokyo
*
∗Postal address: Department of Information Sciences, Science University of Tokyo, Noda-city, Chiba 278, Japan.
Get access Rights & Permissions [Opens in a new window]

Abstract

Shanthikumar and Sumita (1986) proved that the stationary system queue length distribution just after a departure instant is geometric for GI/GI/1 with LCFS-P/H service discipline and with a constant acceptance probability of an arriving customer, where P denotes preemptive and H is a restarting policy which may depend on the history of preemption. They also got interesting relationships among characteristics. We generalize those results for G/G/1 with an arbitrary restarting LCFS-P and with an arbitrary acceptance policy. Several corollaries are obtained. Fakinos' (1987) and Yamazaki's (1990) expressions for the system queue length distribution are extended. For a Poisson arrival case, we extend the well-known insensitivity for LCFS-P/resume, and discuss the stationary distribution for LCFS-P/repeat.

Keywords

SINGLE-SERVER QUEUESTATIONARY INPUTPRODUCT FORMINSENSITIVITYRATE CONSERVATION LAW

MSC classification

Primary: 60K25: Queueing theory
Secondary: 60G10: Stationary processes 90B22: Queues and service
Type
Research Papers
Information
Journal of Applied Probability , Volume 29 , Issue 2 , June 1992 , pp. 430 - 440
Copyright
Copyright © Applied Probability Trust 1992 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

The author is supported in part by NEC C&C Laboratories.

References

Baccelli, F. and Bremaud, P. (1987) Palm Probability and Stationary Queueing Systems. Lecture Notes in Statistics 41, Springer-Verlag, Heidelberg.CrossRefGoogle Scholar
Fakinos, D. (1981) The G/G/1 queueing system with a particular queue discipline. J. R. Statist. Soc. B43, 190–196.Google Scholar
Fakinos, D. (1987) The single server queue with service depending on queue size and with preemptive resume last-come-first-served queue discipline. J. Appl. Prob. 24, 758–767.CrossRefGoogle Scholar
Franken, P., König, D., Arndt, U. and Schmidt, V. (1982) Queues and Point Processes. Wiley, Chichester.Google Scholar
Kijima, M. and Makimoto, N. (1992) A unified approach to GI/M(n)/1/K and M(n)/G/1/K queues vis finite quasi-birth-death process. Stoch. Models. To appear.CrossRefGoogle Scholar
Miyazawa, M. (1983) The derivation of invariance relations in complex queueing systems with stationary inputs. Adv. Appl. Prob. 15, 874–885.CrossRefGoogle Scholar
Miyazawa, M. (1985) The intensity conservation law for queues with randomly changed service rate. J. Appl. Prob. 22, 408–418.Google Scholar
Miyazawa, M. (1991) The characterization of the stationary distributions of the supplemented self-clocking jump process. Math. Operat. Res. 16, 547–565.CrossRefGoogle Scholar
Miyazawa, M. (1990) Derivation of Little's and related formulas by rate conservation law with mutiplicity. Res. Rep. of Science University of Tokyo, ISSUT/0-90-6.Google Scholar
Shanthikumar, J. G. and Sumita, U. (1986) On G/G/1 queues with LIFO-P service discipline. J. Operat. Res. Soc. Japan 29, 220–231.Google Scholar
Stidham, S. Jr. and El Taha, M. (1989) Sample-path analysis of processes with imbedded point processes. QUESTA 4, 131–166.Google Scholar
Wolff, R. W. (1989) Stochastic Modeling and the Theory of Queues. Prentice Hall, Englewood Cliffs, NJ.Google Scholar
Yamazaki, G. (1982) The G/G/1 queue with last-come-first-served. Ann. Inst. Statist. Math. 34, 599–644.Google Scholar
Yamazaki, G. (1984) Invariance relations of GI/G/1 queueing systems with preemptive-resume last-come-first-served queue discipline. J. Operat. Res. Soc. Japan 27, 338–346.Google Scholar
Yamazaki, G. (1990) Invariance relations in single server queues with LCFS service discipline. Ann. Inst. Statist. Math. 42, 475–488.CrossRefGoogle Scholar