-
Previous Article
Performance analysis of a P2P storage system with a lazy replica repair policy
- JIMO Home
- This Issue
-
Next Article
Performance analysis of large-scale parallel-distributed processing with backup tasks for cloud computing
The impact of the $NT$-policy on the behaviour of a discrete-time queue with general service times
1. | SMACS Research Group, TELIN Department, Ghent University, Sint-Pietersnieuwstraat 41, B-9000 Gent, Belgium, Belgium, Belgium |
2. | Supply Networks and Logistics Research Center, Department of Industrial Management, Ghent University, Technologiepark 903, B-9052 Zwijnaarde, Belgium |
We assume a Bernoulli arrival process of customers and independent and identically distributed service times. Using a probability generating functions approach, we obtain expressions for the steady-state distributions of the phase sojourn times, the cycle length, the system content and the customer delay. The influence of the threshold parameters $N$ and $T$ on the mean sojourn times and the expected delay is discussed by means of numerical examples.
References:
[1] |
A. S. Alfa and W. Li, Optimal ($N$,$T$)-policy for M/G/1 system with cost structures,, Performance Evaluation, 42 (2000), 265.
doi: 10.1016/S0166-5316(00)00015-8. |
[2] |
W. Böhm and S. G. Mohanty, On discrete-time Markovian $N$-policy queues involving batches,, Sankhya: The Indian Journal of Statistics, 56 (1994), 144.
|
[3] |
O. J. Boxma and W. P. Groenendijk, Waiting times in discrete-time cyclic-service systems,, IEEE Transactions on Communications, 36 (1988), 164.
doi: 10.1109/26.2746. |
[4] |
H. Bruneel and B. G. Kim, "Discrete-Time Models for Communication Systems Including ATM,", The Springer International Series In Engineering And Computer Science, 205 (1993).
doi: 10.1007/978-1-4615-3130-2. |
[5] |
B. Feyaerts, S. De Vuyst, S. Wittevrongel and H. Bruneel, Analysis of a discrete-time queueing system with an $NT$-policy,, ASMTA '10: 17th International Conference on Analytical and Stochastic Modeling Techniques and Applications, 6148 (2010), 29.
doi: 10.1007/978-3-642-13568-2_3. |
[6] |
P. Flajolet and R. Sedgewick, "Analytic Combinatorics,", Cambridge University Press, (2009).
doi: 10.1017/CBO9780511801655. |
[7] |
A. G. Hernández-Díaz and P. Moreno, Analysis and optimal control of a discrete-time queueing system under the $(m,N)$-policy,, Valuetools '06: Proceedings of the 1st International Conference on Performance Evaluation Methodologies and Tools, (2006). Google Scholar |
[8] |
D. P. Heyman, The T-policy for the M/G/1 queue,, Management Science, 23 (1977), 775.
doi: 10.1287/mnsc.23.7.775. |
[9] |
J.-C. Ke, Optimal $NT$ policies for M/G/1 system with a startup and unreliable server,, Computers & Industrial Engineering, 50 (2006), 248.
doi: 10.1016/j.cie.2006.04.004. |
[10] |
J.-C. Ke, H.-I Huang and Y.-K. Chu, Batch arrival queue with $N$-policy and at most $J$ vacations,, Applied Mathematical Modelling, 34 (2010), 451.
doi: 10.1016/j.apm.2009.06.003. |
[11] |
H. W. Lee and W. J. Seo, The performance of the M/G/1 queue under the dyadic Min($N,D$)-policy and its cost optimization,, Performance Evaluation, 65 (2008), 742. Google Scholar |
[12] |
S. S. Lee, H. W. Lee and K. C. Chae, Batch arrival queue with $N$-policy and single vacation,, Computers & Operations Research, 22 (1995), 173. Google Scholar |
[13] |
P. Moreno, A discrete-time single-server queue with a modified $N$-policy,, International Journal of Systems Science, 38 (2007), 483.
doi: 10.1080/00207720701353405. |
[14] |
H. Takagi, "Queueing Analysis, A Foundation of Performance Evaluation, Volume 3: Discrete-Time Systems,", North-Holland, (1993).
|
[15] |
K.-H. Wang, T.-Y. Wang and W. L. Pearn, Optimal control of the $N$-policy M/G/1 queueing system with server breakdowns and general startup times,, Applied Mathematical Modelling, 31 (2007), 2199.
doi: 10.1016/j.apm.2006.08.016. |
[16] |
T.-Y. Wang, K.-H. Wang and W. L. Pearn, Optimization of the $T$ policy M/G/1 queue with server breakdowns and general startup times,, Journal of Computational and Applied Mathematics, 228 (2009), 270.
doi: 10.1016/j.cam.2008.09.021. |
[17] |
M. Yadin and P. Naor, Queueing systems with a removable service station,, Operational Research Quarterly, 14 (1963), 393. Google Scholar |
show all references
References:
[1] |
A. S. Alfa and W. Li, Optimal ($N$,$T$)-policy for M/G/1 system with cost structures,, Performance Evaluation, 42 (2000), 265.
doi: 10.1016/S0166-5316(00)00015-8. |
[2] |
W. Böhm and S. G. Mohanty, On discrete-time Markovian $N$-policy queues involving batches,, Sankhya: The Indian Journal of Statistics, 56 (1994), 144.
|
[3] |
O. J. Boxma and W. P. Groenendijk, Waiting times in discrete-time cyclic-service systems,, IEEE Transactions on Communications, 36 (1988), 164.
doi: 10.1109/26.2746. |
[4] |
H. Bruneel and B. G. Kim, "Discrete-Time Models for Communication Systems Including ATM,", The Springer International Series In Engineering And Computer Science, 205 (1993).
doi: 10.1007/978-1-4615-3130-2. |
[5] |
B. Feyaerts, S. De Vuyst, S. Wittevrongel and H. Bruneel, Analysis of a discrete-time queueing system with an $NT$-policy,, ASMTA '10: 17th International Conference on Analytical and Stochastic Modeling Techniques and Applications, 6148 (2010), 29.
doi: 10.1007/978-3-642-13568-2_3. |
[6] |
P. Flajolet and R. Sedgewick, "Analytic Combinatorics,", Cambridge University Press, (2009).
doi: 10.1017/CBO9780511801655. |
[7] |
A. G. Hernández-Díaz and P. Moreno, Analysis and optimal control of a discrete-time queueing system under the $(m,N)$-policy,, Valuetools '06: Proceedings of the 1st International Conference on Performance Evaluation Methodologies and Tools, (2006). Google Scholar |
[8] |
D. P. Heyman, The T-policy for the M/G/1 queue,, Management Science, 23 (1977), 775.
doi: 10.1287/mnsc.23.7.775. |
[9] |
J.-C. Ke, Optimal $NT$ policies for M/G/1 system with a startup and unreliable server,, Computers & Industrial Engineering, 50 (2006), 248.
doi: 10.1016/j.cie.2006.04.004. |
[10] |
J.-C. Ke, H.-I Huang and Y.-K. Chu, Batch arrival queue with $N$-policy and at most $J$ vacations,, Applied Mathematical Modelling, 34 (2010), 451.
doi: 10.1016/j.apm.2009.06.003. |
[11] |
H. W. Lee and W. J. Seo, The performance of the M/G/1 queue under the dyadic Min($N,D$)-policy and its cost optimization,, Performance Evaluation, 65 (2008), 742. Google Scholar |
[12] |
S. S. Lee, H. W. Lee and K. C. Chae, Batch arrival queue with $N$-policy and single vacation,, Computers & Operations Research, 22 (1995), 173. Google Scholar |
[13] |
P. Moreno, A discrete-time single-server queue with a modified $N$-policy,, International Journal of Systems Science, 38 (2007), 483.
doi: 10.1080/00207720701353405. |
[14] |
H. Takagi, "Queueing Analysis, A Foundation of Performance Evaluation, Volume 3: Discrete-Time Systems,", North-Holland, (1993).
|
[15] |
K.-H. Wang, T.-Y. Wang and W. L. Pearn, Optimal control of the $N$-policy M/G/1 queueing system with server breakdowns and general startup times,, Applied Mathematical Modelling, 31 (2007), 2199.
doi: 10.1016/j.apm.2006.08.016. |
[16] |
T.-Y. Wang, K.-H. Wang and W. L. Pearn, Optimization of the $T$ policy M/G/1 queue with server breakdowns and general startup times,, Journal of Computational and Applied Mathematics, 228 (2009), 270.
doi: 10.1016/j.cam.2008.09.021. |
[17] |
M. Yadin and P. Naor, Queueing systems with a removable service station,, Operational Research Quarterly, 14 (1963), 393. Google Scholar |
[1] |
Martin Bohner, Sabrina Streipert. Optimal harvesting policy for the Beverton--Holt model. Mathematical Biosciences & Engineering, 2016, 13 (4) : 673-695. doi: 10.3934/mbe.2016014 |
[2] |
Guillaume Bal, Wenjia Jing. Homogenization and corrector theory for linear transport in random media. Discrete & Continuous Dynamical Systems - A, 2010, 28 (4) : 1311-1343. doi: 10.3934/dcds.2010.28.1311 |
[3] |
Jan Prüss, Laurent Pujo-Menjouet, G.F. Webb, Rico Zacher. Analysis of a model for the dynamics of prions. Discrete & Continuous Dynamical Systems - B, 2006, 6 (1) : 225-235. doi: 10.3934/dcdsb.2006.6.225 |
[4] |
W. Cary Huffman. On the theory of $\mathbb{F}_q$-linear $\mathbb{F}_{q^t}$-codes. Advances in Mathematics of Communications, 2013, 7 (3) : 349-378. doi: 10.3934/amc.2013.7.349 |
[5] |
Qiang Guo, Dong Liang. An adaptive wavelet method and its analysis for parabolic equations. Numerical Algebra, Control & Optimization, 2013, 3 (2) : 327-345. doi: 10.3934/naco.2013.3.327 |
[6] |
Martial Agueh, Reinhard Illner, Ashlin Richardson. Analysis and simulations of a refined flocking and swarming model of Cucker-Smale type. Kinetic & Related Models, 2011, 4 (1) : 1-16. doi: 10.3934/krm.2011.4.1 |
[7] |
Rui Hu, Yuan Yuan. Stability, bifurcation analysis in a neural network model with delay and diffusion. Conference Publications, 2009, 2009 (Special) : 367-376. doi: 10.3934/proc.2009.2009.367 |
[8] |
Seung-Yeal Ha, Shi Jin. Local sensitivity analysis for the Cucker-Smale model with random inputs. Kinetic & Related Models, 2018, 11 (4) : 859-889. doi: 10.3934/krm.2018034 |
[9] |
Carlos Fresneda-Portillo, Sergey E. Mikhailov. Analysis of Boundary-Domain Integral Equations to the mixed BVP for a compressible stokes system with variable viscosity. Communications on Pure & Applied Analysis, 2019, 18 (6) : 3059-3088. doi: 10.3934/cpaa.2019137 |
2019 Impact Factor: 1.366
Tools
Metrics
Other articles
by authors
[Back to Top]