Advertisement

Abstract

In Chapter I *, we described some methods of representing graphically the evolution of realizations of queueing systems containing multiple servers. We described some of the postulates to be made about arrival processes and service times, and gave some hints as to how we would approach the analysis of a system of n servers with n » 1.

Keywords

Service Time Arrival Rate Renewal Process Service Completion Deterministic Approximation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin · Heidelberg 1973

Authors and Affiliations

  • Gordon F. Newell
    • 1
  1. 1.Institute of Transportation and Traffic EngineeringUniversity of CaliforniaBerkeleyUSA

Personalised recommendations