Advertisement

The Busy Period, Output and Queues in Series

  • N. U. Prabhu
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 7)

Abstract

In this chapter we continue the study of the queueing systems M/M/1 and M/M/s. There exists an analogy between branching processes and the busy period in systems with Poisson arrivals. By using the well known properties of the branching process we derive the results for the busy period in M/M/1 and the system busy period in M/M/s. This is done in Section 3.2. In Chapter 7 this analogy will be used for the busy period in M/G/1.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1997

Authors and Affiliations

  • N. U. Prabhu
    • 1
  1. 1.Cornell UniversityIthacaUSA

Personalised recommendations