On the distribution of queueing times for queues with two servers
Initially we consider first come first served queues with two or more servers wherein the intervals between the successive arrivals are independently and identically distributed. The customers1 service times are similarly distributed. The method is to define an embedded Markov chain on the moments just before each arrival and thence recurrences ^ which prelate the state of the system just before the (n+1; arrival to that which existed just before the nth. The problem is then...[Show more]
|Collections||Open Access Theses|
|b10160644_Smith_Norman_Malcolm_Hamilton.pdf||34.01 MB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.