A finite capacity bulk service queue with single vacation and Markovian arrival process.
Gupta, U.C., Sikdar, Karabi (2004)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Gupta, U.C., Sikdar, Karabi (2004)
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.
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:
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...
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...
Arianna Brugno, Ciro D'Apice, Alexander Dudin, Rosanna Manzo (2017)
International Journal of Applied Mathematics and Computer Science
Similarity:
A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian...
Loris-Teghem, J. (2000)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Loris-Teghem, Jacqueline (2000)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Matendo, Sadrac K. (1994)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Shin, Yang Woo (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Alfa, Attahiru Sule, Dolhun, K.Laurie, Chakravarthy, S. (1995)
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: