Results 1  10
of
544
BOTTLENECKS IN MARKOVIAN QUEUEING NETWORKS
"... We will consider the problem of identifying regions of congestion in closed queueing networks with statedependent service rates. A particular queue will be called a bottleneck if the number of customers in that queue grows without bound as the total number of customers in the network becomes large. ..."
Abstract
 Add to MetaCart
We will consider the problem of identifying regions of congestion in closed queueing networks with statedependent service rates. A particular queue will be called a bottleneck if the number of customers in that queue grows without bound as the total number of customers in the network becomes large
MQNA Markovian Queueing Networks Analyser ∗
"... This paper describes the MQNA Markovian Queueing Networks Analyser, a software tool to model and obtain the stationary solution of a large class of Queueing Networks. MQNA can directly solve open and closed productform queueing networks using classical algorithms. For finite capacity queueing mode ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper describes the MQNA Markovian Queueing Networks Analyser, a software tool to model and obtain the stationary solution of a large class of Queueing Networks. MQNA can directly solve open and closed productform queueing networks using classical algorithms. For finite capacity queueing
A Fluid Queue Driven by a Markovian Queue
 UNIVERSITY OF RENNES I (FRANCE
, 1997
"... We consider a fluid queue receiving its input from the output of a Markovian queue with finite or infinite waiting room. The input rate of the fluid queue is characterized by a Markov modulated rate process. We derive a new approach for the computation of the stationary buffer content. This approach ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
We consider a fluid queue receiving its input from the output of a Markovian queue with finite or infinite waiting room. The input rate of the fluid queue is characterized by a Markov modulated rate process. We derive a new approach for the computation of the stationary buffer content
Markovian queues with correlated arrival processes
"... 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 interarrivals t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
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 interarrivals
Decay Properties of Stopped Markovian Queues with Batch Arrivals
, 2007
"... Consider Markovian Queue with Batch Arrivals that stops after hitting state 0, or the stopped MX/M/1 queue (crucial in realizing busy period behavior of the queuing systems). The generator matrix,the qmatrix Q = (qij; i, j ∈ Z+), here Z+ stands for the nonnegative integers {0, 1, 2, · · · } is g ..."
Abstract
 Add to MetaCart
Consider Markovian Queue with Batch Arrivals that stops after hitting state 0, or the stopped MX/M/1 queue (crucial in realizing busy period behavior of the queuing systems). The generator matrix,the qmatrix Q = (qij; i, j ∈ Z+), here Z+ stands for the nonnegative integers {0, 1, 2
A Diffusion Approximation for Markovian Queue with Reneging
, 2002
"... Consider a singleserver queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establish that this system can be approximated by either a reflected OrnsteinUhlenbeck process or a refle ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
Consider a singleserver queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establish that this system can be approximated by either a reflected OrnsteinUhlenbeck process or a
Decomposition Approximation for timedependent Markovian queueing networks
 Operations Research Letters
, 1999
"... ..."
Probabilistic Analysis of Buffer Starvation in Markovian Queues
 IEEE INFOCOM 2012
, 2012
"... Our purpose in this paper is to obtain the exact distribution of the number of buffer starvations within a sequence of N consecutive packet arrivals. The buffer is modeled as an M/M/1 queue.When the buffer is empty, the service restarts after a certain amount of packets are prefetched. With this goa ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Our purpose in this paper is to obtain the exact distribution of the number of buffer starvations within a sequence of N consecutive packet arrivals. The buffer is modeled as an M/M/1 queue.When the buffer is empty, the service restarts after a certain amount of packets are prefetched
Analysis of Single StateDependent Markovian Queues
"... A systematic approach to study discrete time queues is developed. Physical constraints on arrivals into and departures from nite buer systems are discussed. Two distinct but interrelated Markov chains are identied to represent the behavior of discrete time queues. Evaluation of performance gures ..."
Abstract
 Add to MetaCart
A systematic approach to study discrete time queues is developed. Physical constraints on arrivals into and departures from nite buer systems are discussed. Two distinct but interrelated Markov chains are identied to represent the behavior of discrete time queues. Evaluation of performance
Results 1  10
of
544