A Queueing System with Independent Markov Input Streams.

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1987
Accession Number
ADA187601

Entities

People

  • D. Dazakos
  • I. Stavrakakis

Organizations

  • University of Virginia

Tags

Communities of Interest

  • Biomedical

DTIC Thesaurus Topics

  • Air Force
  • Air Force Facilities
  • Applied Mathematics
  • Business Administration
  • Communication Systems
  • Computer Science
  • Electrical Engineering
  • Engineering
  • Equations
  • Markov Chains
  • Markov Models
  • Markov Processes
  • Materials Science
  • Probability
  • Probability Distributions
  • Scientific Research
  • Steady State

Readers

  • Mathematical Modeling and Probability Theory.

Technology Areas

  • Space