On the role of Rouché's theorem in queueing analysis
From MaRDI portal
Publication:1362316
DOI10.1007/BF01206561zbMATH Open0879.60097OpenAlexW2108410189MaRDI QIDQ1362316FDOQ1362316
Authors: J. W. Cohen, Douglas G. Down
Publication date: 3 August 1997
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01206561
Recommendations
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Markov chains and stochastic stability
- Title not available (Why is that?)
- Spectral analysis of M/G/1 and G/M/1 type Markov chains
- Title not available (Why is that?)
- Queues Solvable without Rouché's Theorem
- Title not available (Why is that?)
- Solutions of the basic matrix equation for M/G/l AND G/M/1 type markov chains
Cited In (6)
- A ruin model with dependence between claim sizes and claim intervals
- Dynamic server assignment in a two-queue model
- On the application of Rouché's theorem in queueing theory
- A two-queue and two-server model with a threshold-based control service policy
- On the modification of Rouche's theorem for the queueing theory problems
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
This page was built for publication: On the role of Rouché's theorem in queueing analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362316)