On the role of Rouché's theorem in queueing analysis

DOI10.1007/BF01206561zbMath0879.60097OpenAlexW2108410189MaRDI QIDQ1362316

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

zbMATH Keywords

Rouché's theoremqueueing theoryergodicity conditionscoupled random walks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

A ruin model with dependence between claim sizes and claim intervals ⋮ A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)] ⋮ Dynamic server assignment in a two-queue model ⋮ A two-queue and two-server model with a threshold-based control service policy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Markov chains and stochastic stability
• Queues Solvable without Rouché's Theorem
• Solutions of the basic matrix equation for M/G/l AND G/M/1 type markov chains
• Spectral analysis of M/G/1 and G/M/1 type Markov chains