EXPONENTIAL ERGODICITY OF THE M/G/1 QUEUE.

Abstract

If an M (verticle line) G (verticle line) 1 queue has a service time distribution which is exponentially bounded, then most all important quantities of the queue have distributions, which are exponentially bounded. This is proved for the busy period, the number of customers served during a busy period, the waitingtime, the queuelength in continuous and in discrete time. The method of proof is based on the exponential ergodicity theorems for semi-Markov processes. (Author)

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1967
Accession Number
AD0664471

Entities

People

  • Jozef L. Teugels
  • Marcel F. Neuts

Organizations

  • Purdue University

Tags

DTIC Thesaurus Topics

  • Ergodic Processes
  • Markov Processes
  • Mathematics
  • Probability

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.