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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
