Results 131 to 140 of about 10,042,261 (173)
Some of the next articles are maybe not open access.
A Non Markovian Retrial Queueing System
2022Researches on retrial queues with non-geometrical retrial times is motivated by real computers and telecommunication networks, where retrial times can hardly be geometrical distributed. The inherent difficulty with non-geometrical retrial times is caused by the fact that queueing models must keep track of the elapsed retrial time for each of possibly a
Atencia-McKillop, Iván +6 more
openaire +1 more source
On the equivalence of three types of blocking in non-Markovian tandem queues
Queueing Systems, 1994For a \(K\)-stage tandem queueing system with varying number of servers and waiting room sizes three types of blocking are considered. By sample path arguments it is shown that under certain conditions on the waiting room sizes these blocking mechanisms generate the same service initiation epochs.
Hirotaka Sakasegawa, Takeshi Kawashima
openaire +2 more sources
A study on the investigation of mathematical modelling in non markovian queue
AIP Conference Proceedings, 2019This paper manages a non markovian lining model in which benefit is rendered in two phases. The first period of administration is basic and the second stage is optional. After culmination of administration, the server ought to go for a necessary vacation. Here the get-away is of two kind’s viz. short get - away and long excursion.
S. Maragathasundari, S. Radha
openaire +1 more source
Journal of Intelligent & Fuzzy Systems, 2023
This paper explores the behaviour of a Bulk Arrival Retrial Queue Model (BARQ) with two phases of service under the Bernoulli Vacation schedule and Breakdown (BVSB). Each batch of customers arriving the system finds if the server is available, instantly utilizes the service.
J. Bharathi, S. Nandhini
openaire +1 more source
This paper explores the behaviour of a Bulk Arrival Retrial Queue Model (BARQ) with two phases of service under the Bernoulli Vacation schedule and Breakdown (BVSB). Each batch of customers arriving the system finds if the server is available, instantly utilizes the service.
J. Bharathi, S. Nandhini
openaire +1 more source
Non-Markovian Networks of Queues
1987In Chapter 3 we developed regenerative simulation methods for networks of queues with exponential service times and Markovian job routing. In this chapter, we derive analogous estimation procedures for networks with general service times. The development requires that we restrict attention to networks that have a “single state” in which all jobs are at
openaire +1 more source
Analysis of a non-Markovian queueing model: Bayesian statistics and MCMC methods
Monte Carlo Methods and Applications, 2019AbstractThe stationary distribution is the key of any queueing system; its determination is sufficient to infer the corresponding characteristics. This paper deals with theEr/M/1{\mathrm{Er}/M/1}queue. Bayesian inference is developed to estimate the system parameters, specially the root of the relative equation which allows the determination of the ...
Hayette Braham +3 more
openaire +2 more sources
On a non-Markovian time-dependent queueing system
Journal of Applied Probability, 1989This paper studies the transient and steady-state behaviour of a continuous and discrete-time queueing system with non-Markovian type of departure mechanism. The Laplace transforms of the probability generating function of the time-dependent queue length distribution in the transient state are obtained and the probability generating function of the ...
openaire +1 more source
Simulation for passage times in non-Markovian networks of queues
1986An appropriate state vector for simulation of closed networks of queues with priorities among job classes is a linear “job stack”, an enumeration of service center and job class of all the jobs. Simulation for passage times can be based on observation of an augmented job stack process which maintains the position of an arbitrarily chosen “marked job ...
Donald L. Iglehart, Gerarld S. Shedler
openaire +1 more source
Many-server Gaussian limits for overloaded non-Markovian queues with customer abandonment
Queueing Systems, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Korhan Aras, Xinyun Chen, Yunan Liu
openaire +3 more sources
Rare event simulation of non-Markovian queueing networks using RESTART method
Simulation Modelling Practice and Theory, 2013Abstract RESTART is an accelerated simulation technique that allows the probabilities of rare events to be evaluated. In this method, a number of simulation retrials are performed when the process enters regions of the state space where the chance of occurrence of a rare event of interest is higher. These regions are defined by means of a function of
José Villén-Altamirano +1 more
openaire +1 more source