Sojourn time distributions in a Markovian G-queue with batch arrival and batch removal.
Shin, Yang Woo (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Shin, Yang Woo (1999)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Gupta, U.C., Sikdar, Karabi (2004)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Tadj, Lotfi (2000)
Mathematical Problems in Engineering
Similarity:
Gupta, U.C., Banik, A.D., Pathak, S.S. (2005)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Chakravarthy, S., Alfa, Attahiru Sule (1994)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Matendo, Sadrac K. (1994)
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:
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...
Shinya Kikuchi, Yoshio Hamamatsu (1991)
The Yugoslav Journal of Operations Research
Similarity:
Dudin, Alexander N., Chakravarthy, Srinivas R. (2003)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Dshalalow, Jewgeni H., Yellen, Jay (1996)
Mathematical Problems in Engineering
Similarity:
Babitsky, Alexander V. (1997)
Mathematical Problems in Engineering
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...
Loris-Teghem, Jacqueline (2000)
Journal of Applied Mathematics and Stochastic Analysis
Similarity: