A Cyclic Queueing Network with Dependent Exponential Service Times

Abstract

A cyclic queueing network with two servers and a finite number of customers is studied. The service times for server 1 form an EARMA(1,1) process (exponential mixed autoregressive moving average process both of order 1) which is a sequence of positively correlated exponential random variables; the process in general is not Markovian. The service times for the other server are independent with a common exponential distribution. Limiting results for the number of customers in queue and the virtual waiting time at server 1 are obtained. Comparisons are made with the case of independent exponential service times for server 1.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1977
Accession Number
ADA050219

Entities

People

  • P. A. Jacobs

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • California
  • Computer Science
  • Data Science
  • Equations
  • Information Science
  • Markov Chains
  • Markov Processes
  • Mathematics
  • Operations Research
  • Probability
  • Random Number Generators
  • Random Variables
  • Schools
  • Sequences
  • Simulations
  • Stochastic Processes
  • Time Intervals

Fields of Study

  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.
  • Psychological Intervention/Treatment for Stress, Anxiety, PTSD, and Related Emotional and Cognitive Health Symptoms.