Comparison methods for queues and other stochastic models

@article{Whitt1986ComparisonMF,
  title={Comparison methods for queues and other stochastic models},
  author={Ward Whitt and Dietrich Stoyan and Daryl J. Daley},
  journal={Journal of the American Statistical Association},
  year={1986},
  volume={81},
  pages={266}
}
Studies stochastic models of queueing, reliability, inventory, and sequencing in which random influences are considered. One stochastic mode--rl is approximated by another that is simpler in structure or about which simpler assumptions can be made. After general results on comparison properties of random variables and stochastic processes are given, the properties are illustrated by application to various queueing models and questions in experimental design, renewal and reliability theory, PERT… 
Stochastic Monotonicity of the Queue Lengths in Closed Queueing Networks
TLDR
It is shown that increasing the job population will stochastically increase the queue-length vector process, provided that all stations have nondecreasing service rates.
The Best Order for Queues in Series
TLDR
Approximation methods recently developed for networks of queues are applied to obtain approximation formulas and useful heuristic design principles for queueing systems.
M/G/1 queueing systems with returning customers
Single-channel queues with Poisson arrivals, general service distributions, and no queue capacity are studied. A customer who finds the server busy either leaves the system for ever or may return to
Stability and bounds for single server queues in random environment
We consider a single server queue where the speed of the server is a function of a random environment. The only assumptions concerning the arrival process (arrival dates and service requirements) and
APPROXIMATION OF PERIODIC QUEUES
In this paper we demonstrate how some characteristics of queues with the periodic Poisson arrivals can be approximated by the respective characteristics in queues with Markov modulated input. These
Quantitative evaluation of discrete event systems: Models, performances and techniques
TLDR
Queuing networks, whose theory has been stimulated by needs in the computing field, are presented and a more recent formalism, that of extended Petri nets, is presented, which allows more sophisticated Markovian models to be solved mathematically.
Stationary Distribution and Perturbation Bounds for a Stochastic Inventory Model
  • B. Rabta
  • Mathematics
    Journal of Mathematical Sciences
  • 2019
In this paper, we use the theory of generalized inverses to compute the stationary distribution of the (s, S) inventory model directly from the transition matrix of the underlying Markov chain and to
Stochastic Comparison Results for Non-Blocking Switches with Output Queueing
We propose a systematic approach to quantify the impact of nonuniform traffic on the performance of non-blocking switches with output queueing. We do so in the context of a simple queueing model
Strong and weak stochastic bounds for multidimensional Markov chains
TLDR
This paper proposes different queueing systems in the sense of the strong and weak stochastic ordering for a general queueing network model in order to compute performance measure bounds as blocking probabilities and discusses the accuracy of the bounds under different input parameter values.
...
1
2
3
4
5
...