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 Dn).
Bharah-Kumar K, Discrete time queueing systems and their networks, IEEE Trans. Comm. Com., 1980, 28: 260–263.CrossRefGoogle Scholar
I. Rubin and L. F. Morness, Message delay analysis for polling and token multiple-access schemes for local communication networks, IEEE J. Selected Areas in Communications, 1983, SAC-1, 5: 935–947.CrossRefGoogle Scholar