Back to the roots of the M/D/s queue and the works of Erlang, Crommelin, and Pollaczek

@inproceedings{Janssen2008BackTT,
  title={Back to the roots of the M/D/s queue and the works of Erlang, Crommelin, and Pollaczek},
  author={Augustus J. E. M. Janssen and J. K. van Leeuwaarden},
  year={2008}
}
A.K. Erlang introduced the M/D/s queue in 1917, while F. Pollaczek and C.D. Crommelin formalized the theory using complex analysis and transforms. Let D(s,λ) denote the stationary probability of experiencing no waiting time in the M/D/s queue with arrival rate λ and service requirement 1. We use D(s,λ) as a vehicle to give an overview of some of the results we obtained over the last years, including explicit characterizations of the roots, the derivation of infinite series from expressions in… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS

On Round-Robin routing with FCFS and LCFS scheduling

  • Perform. Eval.
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

Similar Papers

Loading similar papers…