Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Hokstad, Per
1977.
Asymptotic behaviour of the Ek/G/1 queue with finite waiting room.
Journal of Applied Probability,
Vol. 14,
Issue. 02,
p.
358.
Hokstad, Per
1979.
On the eelationship of the transient behaviour of a general queueing model to its idle and busy period distributions.
Mathematische Operationsforschung und Statistik. Series Optimization,
Vol. 10,
Issue. 3,
p.
421.
Nogami, Shinya
Komota, Yasuo
and
Hoshiko, Yukio
1984.
Analysis of the GI/Ek/1 queue with finite waiting room by the supplementary variable approach.
Electronics and Communications in Japan (Part I: Communications),
Vol. 67,
Issue. 1,
p.
10.
Kapadia, Asha Seth
Kazmi, Mohammad Fasihullah
and
Mitchell, A.Cameron
1984.
Analysis of a finite capacity non preemptive priority queue.
Computers & Operations Research,
Vol. 11,
Issue. 3,
p.
337.
Kijima, Masaaki
and
Makimoto, Naoki
1992.
A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes.
Communications in Statistics. Stochastic Models,
Vol. 8,
Issue. 2,
p.
269.
Nicola, V.F.
Hagesteijn, G.A.
and
Kim, B.G.
1994.
Fast simulation of the Leaky Bucket algorithm.
p.
266.
Yang, Ping
1994.
A unified algorithm for computing the stationary queue length distributions inM(k)/G/1/N and GI/M(k)/1/N queues.
Queueing Systems,
Vol. 17,
Issue. 3-4,
p.
383.
Srinivasa Rao, T. S. S.
and
Gupta, U. C.
1995.
ON the GI/M(n)/1/K queue-an alternative approach.
Optimization,
Vol. 35,
Issue. 3,
p.
265.
1998.
APR volume 30 issue 4 Cover and Back matter.
Advances in Applied Probability,
Vol. 30,
Issue. 4,
p.
b1.
Emstad, Peder J.
and
Osland, Per-Oddvar
2001.
Teletraffic Engineering in the Internet Era, Proceedings of the International Teletraffic Congress - ITC-I7.
Vol. 4,
Issue. ,
p.
581.
Kimura, Toshikazu
2003.
A consistent diffusion approximation for finite-capacity multiserver queues.
Mathematical and Computer Modelling,
Vol. 38,
Issue. 11-13,
p.
1313.
Choi, Dae W.
Kim, Nam K.
and
Chae, Kyung C.
2005.
A Two-Moment Approximation for the GI/G/c Queue with Finite Capacity.
INFORMS Journal on Computing,
Vol. 17,
Issue. 1,
p.
75.
Takahashi, Akira
Takahashi, Yoshitaka
Kaneda, Shigeru
and
Shinagawa, Noriteru
2007.
Diffusion Approximations for the GI/G/c/K queue.
p.
681.
Goswami, V.
Samanta, S.K.
Vijaya Laxmi, P.
and
Gupta, U.C.
2008.
Analyzing a multiserver bulk-service finite-buffer queue.
Applied Mathematical Modelling,
Vol. 32,
Issue. 9,
p.
1797.
Gontijo, G. M.
Atuncar, G. S.
Cruz, F. R. B.
Kerbache, L.
and
Li, Ming
2011.
Performance Evaluation and Dimensioning of GIX/M/c/N Systems through Kernel Estimation.
Mathematical Problems in Engineering,
Vol. 2011,
Issue. 1,
Brandwajn, Alexandre
and
Begin, Thomas
2012.
A Recurrent Solution of PH/M/c/N-Like and PH/M/c-Like Queues.
Journal of Applied Probability,
Vol. 49,
Issue. 01,
p.
84.
Grassmann, Winfried
and
Tavakoli, Javad
2014.
Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues.
INFOR: Information Systems and Operational Research,
Vol. 52,
Issue. 4,
p.
197.
Vijaya Laxmi, P.
and
Jyothsna, K.
2015.
Balking and Reneging Multiple Working Vacations Queue with Heterogeneous Servers.
Journal of Mathematical Modelling and Algorithms in Operations Research,
Vol. 14,
Issue. 3,
p.
267.
Legros, Benjamin
2021.
Age-based Markovian approximation of the G/M/1 queue.
Operations Research Letters,
Vol. 49,
Issue. 5,
p.
708.
El-Taha, Muhammad
2021.
An Efficient Convolution Method to Compute the Stationary Transition Probabilities of the G/M/c Model and its Variants.
p.
1.