CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Transient Analysis of Markovian Queueing Model with Bernoulli Schedule and Multiple Working Vacations

by Indra, Renu
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 20 - Number 5
Year of Publication: 2011
Authors: Indra, Renu
10.5120/2426-3257

Indra, Renu . Transient Analysis of Markovian Queueing Model with Bernoulli Schedule and Multiple Working Vacations. International Journal of Computer Applications. 20, 5 ( April 2011), 43-48. DOI=10.5120/2426-3257

@article{ 10.5120/2426-3257,
author = { Indra, Renu },
title = { Transient Analysis of Markovian Queueing Model with Bernoulli Schedule and Multiple Working Vacations },
journal = { International Journal of Computer Applications },
issue_date = { April 2011 },
volume = { 20 },
number = { 5 },
month = { April },
year = { 2011 },
issn = { 0975-8887 },
pages = { 43-48 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume20/number5/2426-3257/ },
doi = { 10.5120/2426-3257 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:07:20.106685+05:30
%A Indra
%A Renu
%T Transient Analysis of Markovian Queueing Model with Bernoulli Schedule and Multiple Working Vacations
%J International Journal of Computer Applications
%@ 0975-8887
%V 20
%N 5
%P 43-48
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Present study obtains the time dependent probabilities of exactly i arrivals and j departures by time t for M/M/1 queueing model with Bernoulli schedule and Multiple working vacation. When a customer has just been served and other customers are present, the server accepts a customer with fix probability p or commences a working vacation of random duration with probability (1- p). Whenever no customers are present, after a service completion or a vacation completion, the server always takes a vacation. And the server is allowed to work at a lower rate during the vacation period. And it is shown that the transient state probabilities can be easily computed with recurrence relations. Also, some important performance measures of this model are evaluated numerically and represented graphically.

References
  1. Baba, Y., (2005), Analysis of a GI/M/1 queue with multiple working vacations. Oper. Res. Lett. 33, 201–209.
  2. Banik, A.D., Gupta, U.C., Pathak, S.S. (2007), On the GI/M/1/N queue with multiple working vacations -analytic analysis and computation Appl. Math. Modell. 31(9), 1701–1710.
  3. Doshi, B.T. (1986),Queueing systems with vacations- a survey, queueing systems, Vol. 1, p.p.29-66.
  4. Indra, (1994), Some two-state single server queueing models with vacation or latest arrival run, Ph.D. thesis, Kurukshetra University, Kurukshetra.
  5. Indra and Renu, (2009), Utilization of idle time of M/M/1 queueing model with Bernoulli Schedule, Operations and Management sciences 2010, pp. 271-285.
  6. Indra and Ruchi, (2009), Transient analysis of two-dimensional M/M/1 queueing system with working vacations, JMASS, Vol. 5, No. 2, pp. 110-128.
  7. Keilson J. and Servi, L.D., (1987), Dynamics of the M/G/1 vacation model, Opns. Res., Vol. 35, No. 4, p.p.575-582.
  8. Kim, J.D., Choi, D.W., Chae, K.C, (2003), Analysis of queue-length distribution of the M/G/1 queue with working vacations. In Hawaii International Conference on Statistics and Related Fields.
  9. L.D. Servi (1986), Average delay approximation of /G/1 cyclic service queue with Bernoulli schedules, IEEE Selected Area of Communication 4, 813-820.
  10. Liu, W., Xu, X., Tian, N.(2007): Stochastic decompositions in the M/M/1 queue with working vacations. Oper. Res. Lett. 35, 595–600.
  11. N. Tian and Z.G. Zhang(2006), Vacation Queueing Models: Theory and Applicati ons, Springer, New York.
  12. Pegden, C.D. and Rosenshine, M. (1982), Some new results for the M/M/1 queue, Mgt. Sc.,Vol. 28, 821-828.
  13. R. Ramaswami, L.D. Servi(1988), The busy period of the M/G/1 vacation model with a Bernoulli schedule, Stochastic Models 4, 507-521.
  14. Servi, L.D. and Finn, S.G., (2002), M/M/1 queues with working vacations (M/M/1/WV), Performance Evaluation, Vol. 50, pp 41-52.
  15. Takagi, H. (1991). Queueing Analysis: A Foundation of Performance evaluation, vacation and priority systems, Part 1, North-Holland, Amsterdam.
  16. Wu, D., Takagi, H., (2006), M/G/1 queue with multiple working vacations. Perform. Eval. 63(7), 654–681.
Index Terms

Computer Science
Information Sciences

Keywords

Two-dimensional state model Bernoulli schedule Multiple working vacation Laplace transform

Powered by PhDFocusTM