Abstract
Abstract Consider a single-server queuing system, where the arrival intervals Ti and the service-times Ui of consecutive customers form two independent sequences of independent and equally distributed random variables. Assume that customers arriving when the server is busy line up and that they are then served in order of arrival. Let Wn be the waiting-time of the nth customer and suppose that the server is idle at the start, i.e. W1 = 0. Put W = lim n ∞ Wn when the limit exists. Furthermore, let Fn (⋅) be the c.d.f. of Wn and put EWn =ω n .
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
