Accession Number : ADA187601

Title :   A Queueing System with Independent Markov Input Streams.

Descriptive Note : Technical rept. 1 Jan-31 Dec 87,

Corporate Author : VIRGINIA UNIV CHARLOTTESVILLE DEPT OF ELECTRICAL ENGINEERING

Personal Author(s) : Stavrakakis, I ; Dazakos, D

PDF Url : ADA187601

Report Date : Jan 1987

Pagination or Media Count : 20

Abstract : In this work, a discrete time single server queueing system with arbitrary (finite) number of input streams, is considered. The input streams are assumed to be independent but successive arrivals in a single stream are not. More specifically, it is assumed that for each stream, arrivals are governed by an underlying finite state space Markov chain and that a visit to a state corresponds to one or none arrivals, according to a stationary mapping rule. The first in-first out service policy is adopted. For the system described above we develop a method to calculate the average number of customers in the queuing system. Then, the mean time that a customer spends in the system is calculated by using Little's theorem.

Descriptors :   *TIME, *QUEUEING THEORY, *MARKOV PROCESSES, MEAN, STREAMS, INPUT, MAPPING(TRANSFORMATIONS), INPUT OUTPUT PROCESSING

Subject Categories : Statistics and Probability

Distribution Statement : APPROVED FOR PUBLIC RELEASE