Displaying 201 – 220 of 286

Showing per page

Parallélisation d'une Combinaison des Méthodes de Monte-Carlo et Quasi-Monte-Carlo et Application aux Réseaux de Files d'Attente

Bruno Tuffin, Louis-Marie Le Ny (2010)

RAIRO - Operations Research

We propose a parallel algorithm which uses both Monte-Carlo and quasi-Monte-Carlo methods. A detailed analysis of this algorithm, followed by examples, shows that the estimator's efficiency is a linear function of the processor number. As a concrete application example, we evaluate performance measures of a multi-class queueing network in steady state.

Partially observable Markov decision processes with partially observable random discount factors

E. Everardo Martinez-Garcia, J. Adolfo Minjárez-Sosa, Oscar Vega-Amaya (2022)

Kybernetika

This paper deals with a class of partially observable discounted Markov decision processes defined on Borel state and action spaces, under unbounded one-stage cost. The discount rate is a stochastic process evolving according to a difference equation, which is also assumed to be partially observable. Introducing a suitable control model and filtering processes, we prove the existence of optimal control policies. In addition, we illustrate our results in a class of GI/GI/1 queueing systems where...

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.

Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation

Hiroyuki Okamura, S. Miyahara, T. Dohi (2002)

RAIRO - Operations Research - Recherche Opérationnelle

Long running software systems are known to experience an aging phenomenon called software aging, one in which the accumulation of errors during the execution of software leads to performance degradation and eventually results in failure. To counteract this phenomenon a proactive fault management approach, called software rejuvenation, is particularly useful. It essentially involves gracefully terminating an application or a system and restarting it in a clean internal state. In this paper, we reconsider...

Refined non-homogeneous markovian models for a single-server type of software system with rejuvenation

Hiroyuki Okamura, S. Miyahara, T. Dohi (2010)

RAIRO - Operations Research

Long running software systems are known to experience an aging phenomenon called software aging, one in which the accumulation of errors during the execution of software leads to performance degradation and eventually results in failure. To counteract this phenomenon a proactive fault management approach, called software rejuvenation, is particularly useful. It essentially involves gracefully terminating an application or a system and restarting it in a clean internal state. In this paper, we...

Restricted admissibility of batches into an M / G /1 type bulk queue with modified Bernoulli schedule server vacations

Kailash C. Madan, Walid Abu-Dayyeh (2002)

ESAIM: Probability and Statistics

We investigate the steady state behavior of an M / G /1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various states of...

Restricted Admissibility of Batches into an M/G/1 Type Bulk Queue with Modified Bernoulli Schedule Server Vacations

Kailash C. Madan, Walid Abu–Dayyeh (2010)

ESAIM: Probability and Statistics

We investigate the steady state behavior of an M/G/1 queue with modified Bernoulli schedule server vacations. Batches of variable size arrive at the system according to a compound Poisson process. However, all arriving batches are not allowed into the system. The restriction policy differs when the server is available in the system and when he is on vacation. We obtain in closed form, the steady state probability generating functions for the number of customers in the queue for various states...

Currently displaying 201 – 220 of 286