About This Model
The classic Markovian single-server queue with Poisson arrivals and exponential service times. The foundation of queueing theory.
Characteristics
- Poisson arrivals (M)
- Exponential service (M)
- Single server (1)
- Infinite capacity (∞)
- FIFO discipline
Symbols
λArrival rate
μService rate
ρUtilization (λ/μ)
LAvg customers in system
LqAvg customers in queue
WAvg time in system
WqAvg waiting time
Stability
System is stable only when ρ = λ/μ < 1. If λ ≥ μ, the queue grows unboundedly.
Input Parameters
Select Operations
Metrics to Calculate
Output Options