Skip to main content

Pure Birth and Birth-Death Processes: Applications to Queueing

  • Chapter
Modeling and Analysis of Computer Communications Networks

Part of the book series: Applications of Communications Theory ((ACTH))

  • 265 Accesses

Abstract

Measurements of traffic in voice and in data systems have shown that in a wide range of applications call and message generation can be modeled as a Poisson process. In this instance nature is kind to the system analyst since the Poisson process is particularly tractable from a mathematical point of view. We shall examine the Poisson arrival process in some detail. In particular we show that the Poisson arrival process is a special case of the pure birth process. This leads directly to the consideration of birth-death processes, which model certain queueing systems in which customers having exponentially distributed service requirements arrive at a service facility at a Poisson rate.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Feller, An Introduction to Probability Theory and Its Applications, Vol. I, John Wiley, New York (1957).

    Google Scholar 

  2. L. Kleinrock, Queueing Systems, Vol. I: Theory, John Wiley, New York (1975).

    Google Scholar 

  3. R. B. Cooper, Introduction to Queueing Theory, Macmillan, New York (1972).

    MATH  Google Scholar 

  4. H. Kobayashi, Modeling and Analysis, An Introduction to System Performance EvaluationMethodology, Addison-Wesley, Reading, Massachusetts (1978).

    MATH  Google Scholar 

  5. W. S. Jewell, “A Simple Proof of L = AW,” Operations Research 15(6), 109–116 (1967).

    Article  MathSciNet  Google Scholar 

  6. H. P. Galliher, Notes on Operations Research, M.I.T. Technology Press, Operations Research Center, Cambridge, Massachusetts (1959), Chap 4.

    Google Scholar 

  7. P. A. P. Moran, Theory of Storage, Methuen, New York (1959).

    MATH  Google Scholar 

  8. W. Feller, Ref. 1, pp. 407–411.

    Google Scholar 

  9. D. R. Cox and W. L. Smith, Queues, Methuen, New York (1961).

    Google Scholar 

  10. D. R. Cox, “A Use of Complex Probabilities in Theory of Stochastic Processes,” Proceedings of the Cambridge Philosophical Society 51, 313–319 (1955).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Plenum Press, New York

About this chapter

Cite this chapter

Hayes, J.F. (1984). Pure Birth and Birth-Death Processes: Applications to Queueing. In: Modeling and Analysis of Computer Communications Networks. Applications of Communications Theory. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-4841-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-1-4684-4841-2_3

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4684-4843-6

  • Online ISBN: 978-1-4684-4841-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics