1998 | OriginalPaper | Buchkapitel
Further Results for the Queue GI/G/1
verfasst von : N. U. Prabhu
Erschienen in: Stochastic Storage Processes
Verlag: Springer New York
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The main topics of this chapter are the remaining workload and the queue length, defined as follows. At any time t ≥0 the remaining workload W(t) is the amount of work that the server has to do to serve all the customers present in the system at that time. The queue length Q(t) is the number of customers present, waiting, or being served at time t. The analysis of the processes {W (t), t ≥ 0} and {Q(t), t ≥ 0} calls for techniques different from those used in Chapter 1.