EuDML | Browse

This paper concerns a discrete time Geo[X]/G/1 retrial queue with general retrial time in which all the arriving customers require first essential service with probability $α_{0}$ while only some of them demand one of other optional services: type − r (r = 1, 2, 3,...M) service with probability $α_{r}$ . The system state distribution, the orbit size and the system size distributions are obtained in terms of generating functions. The stochastic decomposition law holds for the proposed model. Performance measures...

A discrete-time Geo[X]/G/1 retrial queue with general retrial time and M-additional options for service

Muthukrishnan Senthil Kumar (2011)

RAIRO - Operations Research

A discrete-time system with service control and repairs

Ivan Atencia (2014)

International Journal of Applied Mathematics and Computer Science

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

A finite capacity queue with Markovian arrivals and two servers with group services.

Chakravarthy, S., Alfa, Attahiru Sule (1994)

Journal of Applied Mathematics and Stochastic Analysis

A finite-buffer queue with a single vacation policy: an analytical study with evolutionary positioning

Marcin Woźniak, Wojciech M. Kempa, Marcin Gabryel, Robert K. Nowicki (2014)

International Journal of Applied Mathematics and Computer Science

In this paper, application of an evolutionary strategy to positioning a GI/M/1/N-type finite-buffer queueing system with exhaustive service and a single vacation policy is presented. The examined object is modeled by a conditional joint transform of the first busy period, the first idle time and the number of packets completely served during the first busy period. A mathematical model is defined recursively by means of input distributions. In the paper, an analytical study and numerical experiments...

A fixed-size batch service queue with vacations.

Lee, Ho Woo, Lee, Soon Seok, Chae, K.C. (1996)

Journal of Applied Mathematics and Stochastic Analysis

A generalization of the Erlang's B formula

A. Lambros, A. Pombortsis, A. Sideridis, D. Tambouratzis (1989)

RAIRO - Operations Research - Recherche Opérationnelle

A heavy-traffic theorem for the GI/G/1 queue with a Pareto-type service time distribution.

Cohen, J.W. (1998)

Journal of Applied Mathematics and Stochastic Analysis

A linear programming approach to error bounds for random walks in the quarter-plane

Jasper Goseling, Richard J. Boucherie, Jan-Kees van Ommeren (2016)

Kybernetika

We consider the steady-state behavior of random walks in the quarter-plane, in particular, the expected value of performance measures that are component-wise linear over the state space. Since the stationary distribution of a random walk is in general not readily available we establish upper and lower bounds on performance in terms of another random walk with perturbed transition probabilities, for which the stationary distribution is a geometric product-form. The Markov reward approach as developed...

A new approach to the analysis of a discrete round-robin queue

Anna Marcinkowska (2006)

Applicationes Mathematicae

We identify the regions of parameters of the arriving stream in which the ergodic, critical, or supercritical properties of the branching chain are established.