1. Queuing Theory For Dummies Jean-Yves Le Boudec 1

2. All You Need to Know About Queuing Theory Queuing is essential to understand the behaviour of complex computer and communication systems In depth analysis of queuing systems is hard Fortunately, the most important results are easy We will study this topic in two modules 1. simple concepts (this module) 2. queuing networks (later) 2

3. 1. Deterministic Queuing Easy but powerful Applies to deterministic and transient analysis Example: playback buffer sizing 3

4. Use of Cumulative Functions 4

5. Solution of Playback Delay Pb 5 A(t) A’(t)D(t) time bits d(0)d(0) -  d(0) +  (D1): r(t - d(0) +  ) (D2): r (t - d(0) -  ) d(t) A.

6. 2. Operational Laws Intuition: Say every customer pays one Fr per minute present Payoff per customer = R Rate at which we receive money = N In average λ customers per minute, N = λ R 6

7. Little Again Consider a simulation where you measure R and N. You use two counters responseTimeCtr and queueLengthCtr. At end of simulation, estimate R = responseTimeCtr / NbCust N = queueLengthCtr / T where NbCust = number of customers served and T=simulation duration Both responseTimeCtr=0 and queueLengthCtr=0 initially Q: When an arrival or departure event occurs, how are both counters updated ? A: queueLengthCtr += (t new - t old ). q(t old ) where q(t old ) is the number of customers in queue just before the event. responseTimeCtr += (t new - t old ). q(t old ) thus responseTimeCtr == queueLengthCtr and thus N = R. NbCust/T ; now NbCust/T is our estimator of 7

8. Other Operational Laws 8

9. The Interactive User Model 99

10. Network Laws 10

11. Bottleneck Analysis Apply the following two bounds 1. 2. 11  Example (1) (2) 17

12. Throughput Bounds 12

13. Bottlenecks 13 A

14. DASSA Intuition: within one busy period: to every departure we can associate one arrival with same number of customers left behind 14

15. 3. Single Server Queue 15

16. 16 i.e. which are event averages (vs time averages ?)

17. 17

18. 18

19. 19

20. Non Linearity of Response Time 20

21. Impact of Variability 21

22. Optimal Sharing Compare the two in terms of Response time Capacity 22

23. The Processor Sharing Queue Models: processors, network links Insensitivity: whatever the service requirements: Egalitarian 23

24. PS versus FIFO PSFIFO 24

25. 4. A Case Study Impact of capacity increase ? Optimal Capacity ? 25

26. Methodology 26

27. 4.1. Deterministic Analysis 27

28. Deterministic Analysis 28

29. 4.2 Single Queue Analysis 29 Assume no feedback loop:

30. 4.3 Operational Analysis A refined model, with circulating users Apply Bottleneck Analysis ( = Operational Analysis ) 30 Z/(N-1) -Z 1/c waiting time

31. 31

32. 32

33. Conclusions Queuing is essential in communication and information systems M/M/1, M/GI/1, M/G/1/PS and variants have closed forms Bottleneck analysis and worst case analysis are usually very simple and often give good insights … it remains to see queuing networks 33