Analysis of a bulk queue with unreliable server and single vacation.
Haridass, M., Arumuganathan, R. (2008)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Haridass, M., Arumuganathan, R. (2008)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Kawasaki, Norikazu, Takagi, Hideaki, Takahashi, Yutaka, Hong, Sung-Jo, Hasegawa, Toshiharu (2000)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
V. Jailaxmi, R. Arumuganathan, M. Senthil Kumar (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
This paper analyses an M/G/1 retrial queue with working vacation and constant retrial policy. As soon as the system becomes empty, the server begins a working vacation. The server works with different service rates rather than completely stopping service during a vacation. We construct the mathematical model and derive the steady-state queue distribution of number of customer in the retrial group. The effects of various performance measures are derived.
Gupta, U.C., Sikdar, Karabi (2004)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Kumar, M.Senthil, Arumuganathan, R. (2009)
International Journal of Open Problems in Computer Science and Mathematics. IJOPCM
Similarity:
Kasahara, Shoji, Takagi, Hideaki, Takahashi, Yutaka, Hasegawa, Toshiharu (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Jau-Chuan Ke (2004)
The Yugoslav Journal of Operations Research
Similarity:
Lee, Ho Woo, Lee, Soon Seok, Chae, K.C. (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Gupta, U.C., Banik, A.D., Pathak, S.S. (2005)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Babitsky, Alexander V. (1997)
Mathematical Problems in Engineering
Similarity:
Ivan Atencia (2016)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper considers a discrete-time queueing system in which an arriving customer can decide to follow a last come first served (LCFS) service discipline or to become a negative customer that eliminates the one at service, if any. After service completion, the server can opt for a vacation time or it can remain on duty. Changes in the vacation times as well as their associated distribution are thoroughly studied. An extensive analysis of the system is carried out and, using a probability...
Cooper, Robert B., Niu, Shun-Chen, Srinivasan, Mandyam M. (1998)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Andrzej Chydziński, Łukasz Chróst (2011)
International Journal of Applied Mathematics and Computer Science
Similarity:
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical...
Dshalalow, Jewgeni H. (1996)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Veena Goswami, Umesh C. Gupta, Sujit K. Samanta (2006)
RAIRO - Operations Research
Similarity:
This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time...
Ivan Atencia (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
P. Vijaya Laxmi, Kanithi Jyothsna (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
This paper analyzes a discrete-time finite buffer renewal input queue with multiple working vacations where services are performed in batches of maximum size “”. The service times both during a regular service period and vacation period and vacation times are geometrically distributed. Employing the supplementary variable and imbedded Markov chain techniques, we derive the steady-state queue length distributions at pre-arrival, arbitrary and outside observer’s observation epochs. Based...