Answer First
The M/M/1 queue models a system with Poisson arrivals, exponential service times, and one server. It provides closed‑form formulas for average waiting time, queue length, and system performance, making it one of the most widely used models in operations and service analytics.
Model Assumptions
- M (Markovian arrivals): arrivals follow a Poisson process with rate λ
- M (Markovian service): service times are exponential with rate μ
- 1 server
- FIFO queue discipline
- Infinite queue capacity
- System is stable when λ < μ
Key Performance Measures
Utilization
\[ \rho = \frac{\lambda}{\mu} \]
Fraction of time the server is busy.
Average number in system
\[ L = \frac{\rho}{1 – \rho} \]
Average number in queue
\[ L_q = \frac{\rho^2}{1 – \rho} \]
Average time in system
\[ W = \frac{1}{\mu – \lambda} \]
Average waiting time in queue
\[ W_q = \frac{\rho}{\mu – \lambda} \]
Step-by-Step Solution
1. Arrivals are random (Poisson)
Customers arrive independently at rate λ.
2. Service times are random (exponential)
Each customer’s service time is memoryless, with average 1/μ.
3. The system behaves like a birth‑death process
State n = number of customers in system.
4. Steady‑state probabilities exist when λ < μ
\[ P_n = (1 – \rho)\rho^n \]
5. Closed‑form formulas follow from geometric probabilities
This makes the M/M/1 queue uniquely simple and powerful.
Intuition
The M/M/1 queue is like a single checkout lane with random arrivals and random service times. If customers arrive faster than they can be served, the line grows without bound. If service is faster than arrivals, the system stabilizes and predictable averages emerge.
Common Exam Mistakes
- Forgetting the stability condition λ < μ.
- Confusing W (time in system) with Wq (waiting time).
- Using μ − λ incorrectly in denominators.
- Mixing up L and Lq.
Why This Matters
The M/M/1 queue is used in call centers, hospitals, restaurants, IT support desks, and any system with a single server. It provides fast, accurate estimates of congestion, wait times, and staffing needs—critical for operations management.
Final Summary
The M/M/1 queue models a single‑server system with Poisson arrivals and exponential service times. It provides simple, powerful formulas for waiting times, queue lengths, and system performance, making it a foundational tool in operations and service analytics.
This explanation belongs to the broader Management Science Tutoring pillar.
If you want help working through these ideas for coursework, projects, or exams, you can talk directly to a tutor, not a marketer.
Call/Text: 510-398-0006
Email: tutor@californiagraduatetutor.com