8
Views
20
CrossRef citations to date
0
Altmetric
Original Articles

A Quorum Queueing System with a Random Setup Time under N-policy and with Bernoulli Vacation Schedule

, &
Pages 145-160 | Received 01 Mar 2005, Accepted 01 Sep 2005, Published online: 09 Feb 2016

References

  • Abolnikov, L. and Dukhovny, A. (1991). Markov chains with transition delta matrix: Ergodicity conditions, invariant probability measures and applications. Journal of Applied Mathematics and Stochastic Analysis, 4(4), 333–356.
  • Anabosi, R. F. and Madan, K. C. (2003). A single server queue with two types of service, Bernoulli schedule server vacations and a single vacation policy. Pakistan Journal of Statistics, 19(3), 331–342.
  • Artalejo, J. R. and Choudhury, G. (2004). Steady state analysis of an M/G/1 queue with repeated attempts and two-phase service. Quality Technology and Quantitative Management, 1(2), 189–199.
  • Atencia, I., Bouza, G. and Rico, R. (2002). A queueing system with constant repeated attempts and Bernoulli schedule, in: Fifth International Conference on Operations Research, La Habana.
  • Atencia, I. and Moreno, P. (2005). A single-server retrial queue with general retrial times and Bernoulli schedule. Applied Mathematics and Computation, 162, 855–880.
  • Bertsimas, D. and Papaconstantinou, X. (1988). On the steady state solution of the M/C 2 (a,b)/s queueing system. Transportation Sciences, 22, 125–138.
  • Chaudhry, M. L. and Templeton, J. G. C. (1983). A First Course in Bulk Queues. New York, Wiley.
  • Choi, B. D. and Park, K. K. (1990). The M/G/1 retrial queue with Bernoulli schedule. Queueing Systems, 7, 219–228.
  • Choudhury, G. (1997). A Poisson queue under N-policy with a general setup time. Indian Journal of Pure and Applied Mathematics, 28, 1595–1608.
  • Choudhury, G. and Madan, K. C. (2004). A two phase batch arrival queueing system with a vacation time under Bernoulli schedule. Applied Mathematics and Computation, 149, 337–349.
  • Choudhury, G. and Madhuchanda, P. (2004). Analysis of a two phases batch arrival queueing model with Bernoulli vacation schedule. Revista Investigatión Operacional, 25(3), 217–228.
  • Choudhury, G. and Madhuchanda, P. (2004). A batch arrival queue with an additional service channel under N-policy. Applied Mathematics and Computation, 156, 115–130.
  • Doshi, B. T. (1986). Queueing systems with a vacation — A survey. Queueing Systems, 1, 29–66.
  • Doshi, B. (1990). Single server queues with vacations. In Stochastic Analysis of Computer and Communication Systems, H. Takagi (Editor) 217–265.
  • Feng, W., Kowada, M. and Adachi, K. (1998). A two-queue model with Bernoulli service schedule and switching times. Queueing Systems, 30, 405–434.
  • Ghafir, H. M. and Silio, C. B. (1993). Performance analysis of a multiple access ring network. IEEE Transections on Communications, 41, 1494–1506.
  • Harris, C. M. and Marchal, W. G. (1988). State dependence in M/G/1 server vacation models. Operations Research, 36, 560–565.
  • Jiang, Y., Tham, C.-K. and Ko, C.-C. (2002). Delay analysis of a probabilistic priority discipline. European Transactions on Telecommunications.
  • Katayama, T. and Takajashi, Y. (1992). Analysis of a two-class priority queue with Bernoulli schedules. Journal of the Operations Research Society of Japan, 35(3), 236–249.
  • Keilson, J. and Servi, L. D. (1989). Blocking probability for M/G/1 vacation systems with occupancy level dependent schedules. Operations Research, 37(1), 134–140.
  • Keilson, J. and Servi, L. D. (1987). Dynamics of the M/G/1. Operations Research, 35, 575–582.
  • Keilson, J. and Servi, L. D. (1986). Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedule. Journal of Applied Probability, 23, 790–802.
  • Kella, O. (1990). Optimal control of the vacation scheme in an M/G/1 queue. Operations Research, 38(4), 724–728.
  • Kumar, B. Krishna and Arivudainambi, D. (2002). The M/G/1 retrial queue with Bernoulli schedules and general retrial times. Computers and Mathematics with Applications, 43, 15–30.
  • Kumar, B. Krishna, Arivudainambi, D. and Vijayakumar, A. (2002). On the M X/G/1 retrial queue with Bernoulli schedules and general retrial times. Asia-Pacific Journal of Operational Research, 19(2), 177–194.
  • Lee, D. S. (1997). Analysis of a two-queue model with Bernoulli schedules. Journal of Applied Probability, 34, 176–191.
  • Lee, H. W., Lee, S. S. and Chae, K. C. (1996). A fixed sized batch service queue with vacations, Journal of Applied Mathematics and Stochastic Analysis, 9, 205–219.
  • Levy, H. (1991). Binomial-gated service: A method for effective operation and optimization of polling systems. IEEE Transactions on Communications, 39(9), 1341–1350.
  • Li, H. and Yang, T. (1998). Geo/G/1 discrete time retrial queue with Bernoulli schedule. European Journal of Operational Research, 111, 629–649.
  • Madan, K. C. (2000). On a single server queue with two stage general heterogeneous service and binomial schedule server vacations. The Egyptian Statistical Journal, 44, 39–55.
  • Madan, K. C. (2001). On a single server queue with two stage general heterogeneous service and deterministic server vacations. International Journal of System Science, 32, 837–844.
  • Madan, K.C. and Al-Rub, A. Z. Abu. (2004). On a single server queue with optional phase type server vacations based on exhaustive deterministic service and a single vacation policy. Applied Mathematics and Computation, 149, 723–734
  • Madan, K. C. and Al-Rub, A. Z. Abu. (2004). Transient and steady state solution of a single server queue with modified Bernoulli schedule vacations based on exhaustive service and a single vacation policy. Revista Investigatión Operacional, 25(2), 158–165.
  • Madan, K. C. and Saleh, M. F. (2001). On M/D/1 queue with general server vacations. International Journal of Information and Management Sciences, 12(2), 25–37.
  • Madan, K. C. and Saleh, M. F. (2001). On single server vacation queues with deterministic service or deterministic vacations. Calcutta Statistical Association Bulletin, 51, 225–241.
  • Madan, K. C. and Saleh, M. F. (2001). On an M/D/1 queue with deterministic server vacations. Systems Science Journal, 27, 107–118.
  • Madan, K., Abu-Dayyeh, C. W. and Tayyan, F. (2003). Steady state analysis of an M/D/2 queue with Bernoulli schedule server vacations. Journal of Modern Applied StatisticalMehods, 2(1), 202–209.
  • Madan, K., Abu-Dayyeh, C. W. and Tayyan, F. (2003). A two server queue with Bernoulli schedules and a single vacation policy. Applied Mathematics and Computation, 145, 59–71.
  • Medhi, J. and Templeton, J. G. C. (1992). A Poisson input queue under N-policy and with a general start-up time. Computers and Operations Research, 19, 35–41.
  • Mukherjee, B. and Meditch, J. S. (1988). The pi-persistent protocol for unidirectional broadcast bus networks. IEEE Transactions on Communications, 36(12), 1277–1286.
  • Ramaswami, R. and Servi, L. D. (1988). The busy period of the M/G/1 vacation model with a Bernoulli schedule. Stochastic Models, 4(3), 507–521.
  • Servi, L. D. (1986). Average delay approximations of M/G/1 cyclic service queue with Bernoulli schedule. IEEE Selected Areas of Communication, 4(6), 813–820.
  • Shin, Y. W. and Pearce, C. E. M. (1998). The BMAP/G/1 vacation queue with queue-length dependent vacation schedule. Journal of the Australian Mathematical Society, Ser. B 40, 207–221.
  • Tadj, L. and Choudhury, G. Optimal design and control of queues. TOP (to appear).
  • Tadj, L. and Ke, J-. C. (2005). Control policy of a hysteretic bulk queueing system. Mathematical and Computer Modelling, 41, 571–579.
  • Tadj, L. and Ke, J-. C. (2003). Control policy of a hysteretic queueing system. Mathematical Methods of Operations Research, 57(3), 367–376.
  • Takagi, H. (1991). Queueing Analysis: A Foundation of Performance Evaluation, Vol. 1, Vacation and Priority Systems, Part 1. North-Holland, Amsterdam.
  • Wortman, M. A., Disney, R. L. and Kiessler, P. C. (1991). The M/G/1 Bernoulli feedback queue with vacations. Queueing Systems, 9, 353–364.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.