Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Dynamic control policy for the discrete-time queue

Dynamic control policy for the discrete-time queue In queueing system, when the server is idle, one of control policy for determining the timing of server activated is when a fixed number N of customers accumulates for service in the system. However, on some practical situations such as watching video file online, the threshold value N may vary depending on different situations. For such situation, this paper studies a random N-policy Geo/G/1 queue, where N is determined as each new cycle begins. We derive some system characteristics, such as system size, idle period, busy period and sojourn time, by using the probability generating function and supplementary variable technique. We also prove that the system size of a continuous-time random N-policy M/G/1 queue can be approximated by the presented discrete-time model. Keywords: random N-policy; system length; busy period; sojourn time. Reference to this paper should be made as follows: Wang, T-Y. and Chang, F-M. (2016) `Dynamic control policy for the discrete-time queue', Int. J. Services Operations and Informatics, Vol. 8, No. 2, pp.79­93. Biographical notes: Tsung-Yin Wang is a Professor in the Department of Accounting Information, National Taichung University of Science and Technology, Taiwan. He received his MA in Statistics from National Chengchi University, Taiwan, and his http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Services Operations and Informatics Inderscience Publishers

Dynamic control policy for the discrete-time queue

Loading next page...
 
/lp/inderscience-publishers/dynamic-control-policy-for-the-discrete-time-queue-iwk0frBWeK
Publisher
Inderscience Publishers
Copyright
Copyright © 2016 Inderscience Enterprises Ltd.
ISSN
1741-539X
eISSN
1741-5403
DOI
10.1504/IJSOI.2016.080074
Publisher site
See Article on Publisher Site

Abstract

In queueing system, when the server is idle, one of control policy for determining the timing of server activated is when a fixed number N of customers accumulates for service in the system. However, on some practical situations such as watching video file online, the threshold value N may vary depending on different situations. For such situation, this paper studies a random N-policy Geo/G/1 queue, where N is determined as each new cycle begins. We derive some system characteristics, such as system size, idle period, busy period and sojourn time, by using the probability generating function and supplementary variable technique. We also prove that the system size of a continuous-time random N-policy M/G/1 queue can be approximated by the presented discrete-time model. Keywords: random N-policy; system length; busy period; sojourn time. Reference to this paper should be made as follows: Wang, T-Y. and Chang, F-M. (2016) `Dynamic control policy for the discrete-time queue', Int. J. Services Operations and Informatics, Vol. 8, No. 2, pp.79­93. Biographical notes: Tsung-Yin Wang is a Professor in the Department of Accounting Information, National Taichung University of Science and Technology, Taiwan. He received his MA in Statistics from National Chengchi University, Taiwan, and his

Journal

International Journal of Services Operations and InformaticsInderscience Publishers

Published: Jan 1, 2016

There are no references for this article.