Sample-path analysis of the proportional relation and its constant for discrete-time single-server queues.
Semi-Markov-based approach for the analysis of open tandem networks with blocking and truncation
This paper describes an analytical study of open two-node (tandem) network models with blocking and truncation. The study is based on semi-Markov process theory, and network models assume that multiple servers serve each queue. Tasks arrive at the tandem in a Poisson fashion at the rate λ, and the service times at the first and the second node are nonexponentially distributed with means sA and sB , respectively. Both nodes have buffers with finite capacities. In this type of network, if the second...
Sensitivity error bounds for non-exponential stochastic networks
Sensitivity examination of the simulation result of discrete event dynamic systems with perturbation analysis.
Simulation completed with perturbation analysis provides a new approach for the optimal control of queuing network type systems. The objective of this paper is to calculate the sensitivity range of finite zero-order perturbation, that is, to determine the maximum and minimum size of perturbation within which zero-order propagation rules can be applied. By the introduction of the concept of virtual queue and first and second level no-input and full-output matrices, an algorithm is provided which...
Simulation of Machine Interference in Randomly Changing Environments
Single retrial queues with service option on arrival.
Single server queueing networks with varying sevice times and renewal input.
Single server tandem queues and queueing networks with non-correlated successive service times.
Sojourn time distributions in a Markovian G-queue with batch arrival and batch removal.
Solution of a Transient State, Limited Space Queueing Problem with Arrival and Departure Rates Depending on Queue Length
Some aspects of balking and reneging in finite buffer queues
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
Some aspects of balking and reneging in finite buffer queues
In this paper, a single server finite buffer Markovian queuing system is analyzed with the additional restriction that customers may balk as well as renege. Reneging considered in literature is usually of position independent type where the reneging rate is constant irrespective of the position of the customer in the system. However there are many real world situations where this assumption does not hold. This paper is an attempt to model balking with position dependent reneging. Explicit closed...
Some performance measures for vacation models with a batch Markovian arrival process.
Some reflections on the renewal-theory paradox in queueing theory.
Stability of queueing network system with two stations and classes.
Stability of queueing networks.
Stability of retrial queues with versatile retrial policy.
Stochastic analysis of the departure and quasi-input processes in a versatile single-server queue.
Study of the stability of the queueing network of Lu-Kumar-Bramson by the fluid limit method. (Étude par la méthode des limites fluides de la stabilité du réseau de file d'attente de Lu-Kumar-Bramson.)
Synergistic modeling of call center operations.