Wiener-Hopf Techniques in Queueing Theory

  • N. U. Prabhu
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 98)

Abstract

In queueing theory Wiener-Hopf techniques were first used in a non-probabilistic context by W. L. Smith, and later in a probabilistic context by F. Spitzer. The specific problem considered by these authors was the solution of the Lindley integral equation for the limit d.f. of waiting times. The more general role played by these techniques in the theory of random walks (sums of independent and identically distributed random variables) is now well known; it has led to considerable simplification of queueing theory.

Now the queueing phenomenon is essentially one that occurs in continuous time, and the basic processes that it gives rise to are continuous time processes, specifically those with stationary independent increments. It is therefore natural to seek an extension of some of the Wiener-Hopf techniques in continuous time. Recent work has yielded several results which can be used to simplify existing theory and generate new results. In the present paper we illustrate this by considering the special case of the compound Poisson process X(t) with a countable state-space. Using the Wiener-Hopf factorization for this process, we shall derive in a simple manner all of the properties of a single-server queue for which X(t) represents the net input.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Feller, William (1966): Infinitely divisible distributions and Bessel functions associated with random walks. J. SIAM Appl. Math. 14, 864–875.CrossRefMATHMathSciNetGoogle Scholar
  2. Lindley, D. V. (1952): The theory of queues with a single server. Proc. Carob. Phil. Soc. 48, 277–289.CrossRefMathSciNetGoogle Scholar
  3. Luchak, G. (1958): The continuous time solution of the equations of the single channel queue with a general class of server time distributions by the method of generating functions. J. Roy. Stat. Soc. B 20, 176–181.Google Scholar
  4. Prabhu, N. U. (1965): Queues and Inventories.New York: John Wiley.Google Scholar
  5. Prabhu, N. U. (1970): Ladder variables for a continuous time stochastic process. Z. Wahrscheinlichkeitstheorie verw. Gieb. 16, 157–164.CrossRefMATHMathSciNetGoogle Scholar
  6. Prabhu, N. U. and Rubinovitch,M. (1971): On a continuous time extension of Feller’s lemma. Z. Wahrscheinlichkeitstheorie verw. Gieb. 17, 220–226.Google Scholar
  7. Prabhu, N. U. and Rubinovitch,M. (1973): Further results for ladder processes in continuous time. Stoch. Proc. and Their Appl. 1 151–168.MATHMathSciNetGoogle Scholar
  8. Rubinovich, M. (1971): Ladder phenomena in stochastic processes with stationary independent increments. Z. Wahrscheinlichkeitstheorie verw. Gieb. 20, 58–74.Google Scholar
  9. Smith, W. L. (1953): On the distribution of queueing times. Proc. Camb. Phil. Soc. 49, 449–461.Google Scholar
  10. Spitzer, F. (1957): The Wiener-Hopf equation whose kernel is a probability density. Duke Math J. 24, 327–344.CrossRefMATHMathSciNetGoogle Scholar
  11. Spitzer, F. (1960): The Wiener-Hopf equation whose kernel is a probability density II. Duke Math. J. 27, 363–372.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1974

Authors and Affiliations

  • N. U. Prabhu
    • 1
  1. 1.Cornell UniversityUSA

Personalised recommendations