DASE7034 Chap.10 Queueing Foundations and Little's Law
Queueing Foundations and Little's Law
Queueing analysis separates arrivals, waiting, service and departures. A/B/s notation identifies inter-arrival and service-time distributions plus the number of servers.
Queue measures exclude service, system measures include it, and Little's Law connects long-run average number, arrival rate and time when the boundary and population are consistent.
Draw the system boundary first
Identify where customers enter, where the waiting line begins, when service starts and where departure occurs. This boundary determines which people and time intervals are counted.
Lq and Wq refer only to the queue before service, while L and W refer to the entire system including service. A customer in service belongs in L but not Lq.
Changing the boundary changes both the population and the time measure, so formulas cannot be combined across inconsistent definitions.
Read queue notation as assumptions
The first symbol in A/B/s describes the inter-arrival distribution, the second describes service time and s gives the number of parallel servers.
M denotes a memoryless exponential-time assumption, while D denotes deterministic time and G allows a general distribution with stated moments. Further features include capacity, calling population and service discipline.
Writing M/M/1 is therefore a compact claim about a stochastic process, not merely a label for a convenient formula.
Apply Little's Law with consistent flow
For a stable long-run system, average number equals throughput rate multiplied by average time: L equals lambda W, and the queue-only version is Lq equals lambda Wq when the same admitted population is used.
Convert minutes to hours or rates to matching time units before multiplication. In a finite-capacity system, offered arrivals can exceed admitted throughput, so the effective rate through the chosen boundary is needed.
Little's Law is an accounting identity and does not by itself require exponential distributions.
Check stability and interpretation
A queue with long-run input exceeding service capacity cannot have a finite steady-state mean under the usual infinite-buffer model. Stability must be tested before steady-state waiting formulas are used.
Even when average capacity exceeds demand, variability can produce substantial delay, so utilisation alone does not describe service performance. Report the model assumptions, rate units, queue or system measure requested and the operational implication. A numerical answer should make clear whether it describes waiting before service, total time, customers admitted or potential customers who may be blocked.
What this chapter covers
- 01
Queue anatomy and discipline
- 02
Arrival and service rates
- 03
Utilisation and stability
- 04
Little's Law
- 05
Poisson and birth-death processes
Worked example · free
Convert time to rate before using Little's Law
- 2Convert five minutes to one twelfth hour.
- 2Apply Lq equal to lambda times Wq.
- 1Report one expected customer in queue.
Key terms
- Arrival Rate
- The expected number of arrivals per unit time, usually denoted by lambda.
- Utilisation
- The fraction of total service capacity demanded by the arrival stream.
- Little's Law
- The long-run identity linking expected number, throughput rate and expected time within a consistent boundary.
Queueing Foundations and Little's Law FAQ
What is the difference between W and Wq?
W is total expected time in the system and includes service, while Wq is expected waiting time before service. Under the basic model, their difference is mean service time.
Does Little's Law require exponential times?
No. It is a broad long-run flow identity, but the measured population, throughput and time must use the same boundary and the system must have a meaningful stable average.
How should utilisation be calculated with several servers?
Divide the arrival rate by total service capacity, s times the per-server service rate. Dividing by one server's rate can falsely suggest overload in a parallel-server system.
Exam move
Create a four-box diagram for Lq, L, Wq and W and mark whether service is included. Practise converting between minutes and hours before inserting rates. Use Little's Law twice on every worked result to check both queue and system measures. Draw the arrival, waiting, service and departure stages and mark the exact boundary for each measure.
Before using a formula, write the customer population, throughput rate and time unit on one line. Convert all times and rates to a common basis, then check that customers per hour multiplied by hours produces customers. Distinguish offered arrivals from admitted throughput whenever capacity or blocking is present. Test stability before quoting a steady-state average.
Create paired exercises where one asks for queue time and the other for total system time, and explain the service-time difference rather than memorising two expressions. Use Little's Law to cross-check both queue-only and system-wide results for the same population.
Finish by writing one interpretive sentence that names whether the answer describes people waiting, people in service as well, time before service or total time until departure.
Working through Queueing Foundations and Little's Law in DASE7034? Sia is AskSia’s AI Mathematics tutor — ask any DASE7034 Queueing Foundations and Little's Law question and get a clear, step-by-step explanation grounded in how DASE7034 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.