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 ).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bharah-Kumar K, Discrete time queueing systems and their networks, IEEE Trans. Comm. Com., 1980, 28: 260–263.
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.
H. Takagi and K. Leung, Analysis of a discrete time queueing system with time-limited service, Queueing Systems, 1994, 18: 183–197.
Z. Niu, T. Shu, and Y. Takahashi, A vacation queue with setup and close-down time and batch Markovian arrival processes, Performance Evaluation, 2003, 54: 225–248.
R. B. Cooper, Introduction to Queueing Theory, Elsevier North Holland, New York, 1981.
N. Tian, Discrete Time Queue Theory, Science Press, Beijing, 2007: 87–108.
L. Tadj and G. Choudhury, Optimal design and control of queues, Top, 2005 13: 359–412.
M. Yadin and P. Naor, Queueing systems with a removable service station, Operational Research Quarterly, 1963, 14: 393–405.
J. Li and N. Tian, The discrete-time Geo/Geo/1 queue with single working vacation, Quality Technology and Quantitation Managgement, 2008, 5: 77–89.
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper was supported by the National Natural Science Foundation of China under Grant No. 70871084, The Specialized Research Fund for the Doctoral Program of Higher Education of China under Grant No. 200806360001, a grant from the “project 211 (Phase III)” of the Southwestern University of Finance and Economics, Scientific Research Fund of Southwestern University of Finance and Economics.
This paper was recommended for publication by Editor Hanqin ZHANG.
Rights and permissions
About this article
Cite this article
Luo, C., Tang, Y., Li, W. et al. The recursive solution of queue length for Geo/G/1 queue with N-policy. J Syst Sci Complex 25, 293–302 (2012). https://doi.org/10.1007/s11424-012-9313-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-012-9313-3