Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-14T03:26:34.325Z Has data issue: false hasContentIssue false
  • English
  • Français

The single-server queue with independent GI/G and M/G input streams

Published online by Cambridge University Press:  01 July 2016

Teunis J. Ott
Teunis J. Ott*
Affiliation:
Bell Communications Research
*
∗Postal address: Bell Communications Research, 435 South Street, Morristown, NJ 07960-1961, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper studies the single-server queueing system with two independent input streams: a GI/G and an M/G stream. A new proof is given of an old result which shows how this system can be transformed into an equivalent ‘single input stream’ GI/G/1 queue, and methods to study that equivalent system numerically are given. As part of the numerical analysis, algorithms are given to compute the moments and the distribution function of busy periods in the M/G/1 queue, and of other related busy periods. Special attention is given to the single-server queue with independent D/G and M/G input streams.

This work is to be used in the modeling of real-time computer systems, which can often be described as a single-server queueing system with independent D/G and M/G input streams, see for example Ott (1984b).

Keywords

MULTIPLE INPUT STREAMSNUMERICAL METHODSBUSY PERIODPHASE-TYPE METHODSWIENER–HOPFALMOST PHASE TYPEGENERALIZED PHASE TYPEPOLLACZEK–KHINCHINESTOCHASTIC DECOMPOSITION
Type
Research Article
Information
Advances in Applied Probability , Volume 19 , Issue 1 , March 1987 , pp. 266 - 286
Copyright
Copyright © Applied Probability Trust 1987 

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.)

References

Barberis, G. (1980) A useful tool in the theory of priority queueing. IEEE Trans. Comm. 26, 1757–1762.Google Scholar
Bhat, U. N., Wheeler, A. C. and Fisher, M. J. (1974) On the existence of limiting distributions in stochastic systems with secondary inputs. Opsearch 11, 81–89.Google Scholar
Cohen, J. W. (1969) The Single Server Queue. Wiley Interscience, New York.Google Scholar
Doshi, B. T. (1985) A note on stochastic decomposition in a GI/G/1 queue with vacations or set-up times. J. Appl. Prob. 22, 419–428.CrossRefGoogle Scholar
Fisher, M. J. (1977) In approximation of queueing systems with interruptions. Management Sci. 24, 338–344.Google Scholar
Fuhrmann, S. W. and Cooper, R. B. (1985) Stochastic decompositions in the M/G/1 queue with generalized vacations. Operat. Res. 33, 1117–1129.CrossRefGoogle Scholar
Hooke, J. A. (1972) A priority queue with low priority arrivals general. Operat. Res. 20, 373–380.CrossRefGoogle Scholar
Kamoun, F. (1976) Design Considerations for Large Computer Communications Networks. Ph.D. Thesis, UCLA.Google Scholar
Kingman, J. F. C. (1962) Some inequalities of the queue GI/G/1. Biometrika 49, 315–324.CrossRefGoogle Scholar
Kleinrock, L. and Kamoun, F. (1976) Data communication through large packet switching networks. Proc. 8th Teletraffic Congr., Melbourne.Google Scholar
Kuczura, A. (1972a) Queues with mixed renewal and Poisson inputs. Bell System Tech. J. 51, 1305–1326.CrossRefGoogle Scholar
Kuczura, A. (1972b) Loss systems with mixed renewal and Poisson inputs. Operat. Res. 21, 787–795.Google Scholar
Ott, T. J. (1984a) On the M/G/1 queue with additional inputs. J. Appl. Prob. 21, 129–142.Google Scholar
Ott, T. J. (1984b) Clocked operating systems, queues, and power series. Proc. ITC Seminar Fundamentals of Traffic Theory, Moscow.Google Scholar
Ott, T. J. (1985) The single-server queue with independent D/G and M/G input streams. Internal document, Bell Communications Research.Google Scholar
Ott, T. J. (1987) On the stationary waiting time distribution in the GI/G/1 queue, I: transform methods and almost phase type distributions. Adv. Appl. Prob. 19, 240–265.Google Scholar
Sahin, I. (1971) Equilibrium behavior of a stochastic system with secondary input. J. Appl. Prob. 8, 252–260.CrossRefGoogle Scholar
Sahin, I. (1978) Moment inequalities for a class of stochastic systems. Stoch. Proc. Appl. 7, 123–130.Google Scholar
Sahin, I. and Bhat, U. N. (1971) A stochastic system with scheduled secondary inputs. Operat. Res. 18, 436–446.CrossRefGoogle Scholar
Schassberger, R. (1974) A broad analysis of single server priority queues with two independent input streams, one of them Poisson. Adv. Appl. Prob. 6, 666–688.Google Scholar
Sumita, S. (1984) Analysis of single server preemptive priority queues with a renewal process as high-priority input stream. Electron. Comm. Japan. 67, 10–19.CrossRefGoogle Scholar
Takács, L. (1962) Introduction to the Theory of Queues. Oxford University Press, New York.Google Scholar