Robust Transient Multi-Server Queues and Feedforward Networks

@inproceedings{Bandi2014RobustTM,
  title={Robust Transient Multi-Server Queues and Feedforward Networks},
  author={Chaithanya Bandi and Dimitris Bertsimas and Nataly Youssef},
  year={2014}
}
We propose an analytically tractable approach for studying the transient behavior of multi-server queueing systems and feedforward networks with deterministic routing. We model the queueing primitives via polyhedral uncertainty sets inspired by the limit laws of probability. These uncertainty sets are characterized by parameters that control the degree of conservatism of the model. Assuming the inter arrival and service times belong to such uncertainty sets, we obtain closed form expressions… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Transient behavior of the M/M/1 queue via laplace transforms

  • J. Abate, W. Whitt
  • Advances in Applied
  • 1987
Highly Influential
5 Excerpts

Stochastic Models in Operations Research: Vol

  • D. P. Heyman, M. J. Sobel
  • 1982
Highly Influential
4 Excerpts

Inequalities in the theory of queues

  • J.F.C.. Kingman
  • Journal of the Royal Statistical Society,
  • 1970
Highly Influential
7 Excerpts

Proof of Theorem 5 Proof of Theorem 5. We prove the result using the technique of mathematical induction

  • A A
  • Initial Step: As presented in Bandi et al
  • 2012
1 Excerpt

Transient and busy period analysis for the gi/g/1 queue; the method

  • ACM.D. Bertsimas, D. Nakazato
  • 2010

Similar Papers

Loading similar papers…