Abstract

This paper considers a discrete-time queue with N-policy and LAS-DA (late arrival system with delayed access) discipline. By using renewal process theory and probability decomposition techniques, the authors derive the recursive expressions of the queue-length distributions at epochs n −, n +, and n. Furthermore, the authors obtain the stochastic decomposition of the queue length and the relations between the equilibrium distributions of the queue length at different epochs (n −, n +, n and departure epoch D n ).

Full Text
Published version (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