Page 1

Displaying 1 – 9 of 9

Showing per page

Performance analysis of single server non-markovian retrial queue with working vacation and constant retrial policy

V. Jailaxmi, R. Arumuganathan, M. Senthil Kumar (2014)

RAIRO - Operations Research - Recherche Opérationnelle

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.

Product form solution for g-networks with dependent service

Pavel Bocharov, Ciro D'Apice, Evgeny Gavrilov, Alexandre Pechinkin (2004)

RAIRO - Operations Research - Recherche Opérationnelle

We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: (0) an exponential node with c n servers, infinite buffer and FIFO discipline; (1) an infinite-server node; (2) a single-server node with infinite buffer and LIFO PR discipline; (3) a single-server...

Product form solution for g-networks with dependent service

Pavel Bocharov, Ciro D'Apice, Evgeny Gavrilov, Alexandre Pechinkin (2010)

RAIRO - Operations Research

We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: Negative customers arriving at each node also form a Poisson flow. A negative customer entering a node with k customers in service, with probability 1/k chooses one of served positive customer...

Currently displaying 1 – 9 of 9

Page 1