A cyclic queueing network with dependent exponential service times
Loading...
Authors
Jacobs, Patricia A.
Subjects
Cyclic queues, Distribution, time Markov chains,
EARMA(1,1) dependent upon service time, with generalized state space, Limit theorems Multiprogrammed computer systems, Simulation
Advisors
Date of Issue
1977-07
Date
1977-07
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
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. (Author)
Type
Technical Report
Description
Series/Report No
Department
Operations Research
Identifiers
NPS Report Number
NPS-55-77-40
Sponsors
supported in part by funds
provided directly from the Chief of Naval Research under Grant NR-42-284.
Funder
Chief of Naval Research, Arlington, VA
Format
Citation
Distribution Statement
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.