A cyclic queueing network with dependent exponential service times
Jacobs, Patricia A.
MetadataShow full item record
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)
NPS Report NumberNPS-55-77-40
Showing items related by title, author, creator and subject.
Kress, Moshe; Lin, Kyle Y.; Szechtman, Roberto (2008-10);This paper concerns scheduling policies in a surveillance system aimed at detecting a terrorist attack in time. Terrorist suspects arriving at a public area are subject to continuous monitoring, while a surveillance team ...
Developing effective service policies for multiclass queues with abandonment: asymptotic optimality and approximate policy improvement James, Terry; Glazebrook, Kevin; Lin, Kyle (Informs, 2016);We study a single server queuing model with multiple classes and impatient customers. The goal is to determine a service policy to maximize the long-run reward rate earned from serving customers net of holding costs ...
Heavy-traffic analysis of multi-type queueing under probabilistically load-preferential service order Gaver, Donald Paul; Morrison, J. A. (Monterey, California. Naval Postgraduate School, 1990-08); NPS-55-90-18A model of queueing for a single server by several types of customers (messages, or jobs), with a simple dynamic priority rule, is considered. The rule is equivalent to selecting the next server occupant type with a ...