Results 31 to 40 of about 84,208 (194)
Bounds For Markovian Queues With Possible Catastrophes
We consider a general Markovian queueing model with possible catastrophes and obtain new and sharp bounds on the rate of convergence. Some special classes of such models are studied in details, namely, (a) the queueing system with S servers, batch arrivals and possible catastrophes and (b) the queueing model with "attracted" customers and possible ...
Alexander I. Zeifman +5 more
openaire +3 more sources
We have studied the behaviour of a non-Markovian bulk service queueing model with unreliable server, stand-by server, loss and feedback, N-policy and Bernoulli schedule multiple vacation.
G. Ayyappan, S. Karpagam
doaj +1 more source
Application of empirical Bayesian estimation to the optimal decision of a server-dependent queuing system [PDF]
This paper presents a decision model that uses empirical Bayesian estimation to construct a server-dependent M/M/2/L queuing system. A Markovian queue with a number of servers depending upon queue length with finite capacity is discussed. This study uses
Lin Pei-Chun
doaj +1 more source
Laplace transforms play an essential role in the analysis of classical non-Markovian queueing systems. The problem addressed here is whether the Laplace transform approach is still valid for determining the characteristics of such a system in a fuzzy ...
Baudouin Adia Leti Mawa +3 more
doaj +3 more sources
Performance Evaluation of Controlled Arrival Rate System through Matrix Geometric Method Using Transient Analysis [PDF]
Performance evaluation based on transient analysis has significant importance to those systems which never reached at equilibrium. In this paper, we develop and analyze the system through controlled arrival rate using internal limits.
Wajiha Shah +2 more
doaj
Structural and queue characterization of a non-Markovian boundary value problem
In this study, we investigate a single server architecture in which the customer service system is not aware of the length of the line that was sent to them.
K. Karthikeyan +2 more
doaj +1 more source
Analysis of single server finite buffer queue under discouraged arrival and retention of reneging [PDF]
Queuing models where arrival rates go down consequent to increase in the number of customers are called systems with discouraged arrivals. Discouraged arrivals are distinct from balking in the sense that balking implies that arriving customers do not ...
Medhi Pallabi, Choudhury Amit
doaj +1 more source
On identifiability of MAP processes [PDF]
Two types of transitions can be found in the Markovian Arrival process or MAP: with and without arrivals. In transient transitions the chain jumps from one state to another with no arrival; in effective transitions, a single arrival occurs.
Lillo Rodríguez, Rosa Elvira +2 more
core +1 more source
MARKOVIAN QUEUES WITH CORRELATED ARRIVAL PROCESSES [PDF]
In an attempt to examine the effect of dependencies in the arrival process on the steady state queue length process in single server queueing models with exponential service time distribution, four different models for the arrival process, each with marginally distributed exponential inter-arrivals to the queueing system, are considered.
openaire +3 more sources
Analysis of retrial queue with heterogeneous servers and Markovian arrival process
Multi-server retrial queueing system with heterogeneous servers is analyzed. Requests arrive to the system according to the Markovian arrival process. Arriving primary requests and requests retrying from orbit occupy an available server with the highest ...
Mei Liu
doaj +1 more source

