Table of Contents
International Journal of Stochastic Analysis
Volume 2013, Article ID 196372, 14 pages
http://dx.doi.org/10.1155/2013/196372
Research Article

Analysis of Queue-Length Dependent Vacations and P-Limited Service in BMAP/G/1/N Systems: Stationary Distributions and Optimal Control

School of Basic Sciences, Indian Institute of Technology, Samantapuri, Nandan Kanan Road, Bhubaneswar 751 013, India

Received 27 May 2013; Accepted 26 August 2013

Academic Editor: Enzo Orsingher

Copyright © 2013 A. D. Banik. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. B. T. Doshi, “Queueing systems with vacations—a survey,” Queueing Systems, vol. 1, no. 1, pp. 29–66, 1986. View at Publisher · View at Google Scholar
  2. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vacation and Priority Systems, vol. 1, North-Holland, Amsterdam, The Netherlands, 1991.
  3. H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Finite Systems, vol. 2, North-Holland, New York, NY, USA, 1993.
  4. N. Tian and Z. G. Zhang, Vacation Queueing Models: Theory and Applications, vol. 93 of International Series in Operations Research & Management Science, Springer, New York, NY, USA, 2006.
  5. D. M. Lucantoni, K. S. Meier-Hellstern, and M. F. Neuts, “A single-server queue with server vacations and a class of nonrenewal arrival processes,” Advances in Applied Probability, vol. 22, no. 3, pp. 676–705, 1990. View at Publisher · View at Google Scholar
  6. D. M. Lucantoni, “New results on the single server queue with a batch Markovian arrival process,” Communications in Statistics. Stochastic Models, vol. 7, no. 1, pp. 1–46, 1991. View at Publisher · View at Google Scholar
  7. D. M. Lucantoni, “The BMAP/G/1 queue: a tutorial,” in Performance Evaluation of Computer and Communications Systems, L. Donatiello and R. Nelson, Eds., pp. 330–358, Springer, New York, NY, USA, 1993. View at Google Scholar
  8. M. F. Neuts, “A versatile Markovian point process,” Journal of Applied Probability, vol. 16, no. 4, pp. 764–779, 1979. View at Publisher · View at Google Scholar
  9. N. Akar and E. Arikan, “A numerically efficient method for the BMAP/G/1/N queue via rational approximations,” Queueing Systems, vol. 22, no. 1-2, pp. 97–120, 1996. View at Publisher · View at Google Scholar
  10. S. Nishimura, “A MAP/G/1 queue with an underlying birth-death process,” Stochastic Models, vol. 19, no. 4, pp. 425–447, 2003. View at Publisher · View at Google Scholar
  11. H. W. Lee, N. I. Park, and J. Jeon, “A new approach to the queue length and waiting time of BMAP/G/1/N queues,” Computers & Operations Research, vol. 30, no. 13, pp. 2021–2045, 2003. View at Publisher · View at Google Scholar
  12. A. Dudin, “Optimal multithreshold control for a BMAP/G/1/N service modes,” Queueing Systems, vol. 30, no. 3-4, pp. 273–287, 1998. View at Publisher · View at Google Scholar
  13. A. N. Dudin, A. A. Shaban, and V. I. Klimenok, “Analysis of a queue in the BMAP/G/1/N system,” International Journal of Simulation, vol. 6, pp. 13–23, 2005. View at Google Scholar
  14. B. Kim, J. Lee, and I.-S. Wee, “Tail asymptotics for the fundamental period in the MAP/G/1 queue,” Queueing Systems, vol. 57, no. 1, pp. 1–18, 2007. View at Publisher · View at Google Scholar
  15. F. N. Gouweleeuw, “Calculating the loss probability in a BMAP/G/1/N+1 queue,” Communications in Statistics. Stochastic Models, vol. 12, no. 3, pp. 473–492, 1996. View at Publisher · View at Google Scholar
  16. A. Chydzinski, “Time to reach buffer capacity in a BMAP queue,” Stochastic Models, vol. 23, no. 2, pp. 195–209, 2007. View at Publisher · View at Google Scholar
  17. S. K. Matendo, “Some performance measures for vacation models with a batch Markovian arrival process,” Journal of Applied Mathematics and Stochastic Analysis, vol. 7, no. 2, pp. 111–124, 1994. View at Publisher · View at Google Scholar
  18. J. M. Ferrandiz, “The BMAP/GI/1 queue with server set-up times and server vacations,” Advances in Applied Probability, vol. 25, no. 1, pp. 235–254, 1993. View at Publisher · View at Google Scholar
  19. Z. Niu, T. Shu, and Y. Takahashi, “A vacation queue with setup and close-down times and batch Markovian arrival processes,” Performance Evaluation, vol. 54, no. 3, pp. 225–248, 2003. View at Publisher · View at Google Scholar · View at Scopus
  20. R. O. LaMaire, “An M/G/1 vacation model of an FDDI station,” IEEE Journal on Selected Areas in Communications, vol. 9, no. 2, pp. 257–264, 1991. View at Publisher · View at Google Scholar · View at Scopus
  21. R. O. LaMaire, “M/G/1/N vacation model with varying E-limited service discipline,” Queueing Systems, vol. 11, no. 4, pp. 357–375, 1992. View at Publisher · View at Google Scholar
  22. C. Blondia, “Finite capacity vacation models with nonrenewal input,” Journal of Applied Probability, vol. 28, no. 1, pp. 174–197, 1991. View at Publisher · View at Google Scholar
  23. U. C. Gupta, A. D. Banik, and S. S. Pathak, “Complete analysis of MAP/G/1/N queue with single (multiple) vacation(s) under limited service discipline,” Journal of Applied Mathematics and Stochastic Analysis, no. 3, pp. 353–373, 2005. View at Publisher · View at Google Scholar
  24. A. D. Banik, U. C. Gupta, and S. S. Pathak, “BMAP/G/1/N queue with vacations and limited service discipline,” Applied Mathematics and Computation, vol. 180, no. 2, pp. 707–721, 2006. View at Publisher · View at Google Scholar
  25. A. D. Banik and U. C. Gupta, “Finite buffer vacation queue under E-limited with limit variation service and batch Markovian arrival process,” Quality Technology & Quantitative Management, vol. 5, no. 1, pp. 1–20, 2008. View at Google Scholar
  26. Y. W. Shin and C. E. M. Pearce, “The BMAP/G/1 vacation queue with queue-length dependent vacation schedule,” Australian Mathematical Society B, vol. 40, no. 2, pp. 207–221, 1998. View at Publisher · View at Google Scholar
  27. H.-S. Lee and M. M. Srinivasan, “Control policies for the MX/G/1 queueing system,” Management Science, vol. 35, no. 6, pp. 708–721, 1989. View at Publisher · View at Google Scholar
  28. H. W. Lee and J. O. Park, “Optimal strategy in N-policy production system with early set-up,” Journal of the Operational Research Society, vol. 48, no. 3, pp. 306–313, 1997. View at Google Scholar · View at Scopus
  29. K.-H. Wang and J.-C. Ke, “A recursive method to the optimal control of an M/G/l queueing system with fnite capacity and infnite capacity,” Applied Mathematical Modelling, vol. 24, pp. 899–914, 2000. View at Google Scholar
  30. M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, vol. 2 of Johns Hopkins Series in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, Md, USA, 1981.
  31. W. K. Grassmann, M. I. Taksar, and D. P. Heyman, “Regenerative analysis and steady state distributions for Markov chains,” Operations Research, vol. 33, no. 5, pp. 1107–1116, 1985. View at Publisher · View at Google Scholar