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 ).
Sign-in/Register to access full text options 
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.
