1. Deterministic Network Calculus

2. Background ● Queueing Theory gives probabilistic results ● Critical applications need hard bounds ● Queueing theory extends only partially to networks. ● Scheduling theory accounts only for CPU sharing and bounded blocking. ● Periodic studies do not account for bursty traffic.

3. Cirquit analysis

4. Concatenation of Network Elements

5. Converging Flows

6. Feedback

7. Definition and Range Spaces

9. The Playout Buffer

10. Arrival Curves

12. Spacing and Staircases

13. An Equivalence

14. The Leaky Bucket in Words

15. Leaky Bucket in Graphics

16. Nice to know about Leaky Buckets

17. Some DN-Calculus in Play Henrik should prove this on the blackboard

18. The Generic Cell Rate Algorithm

19. GCRA tat  Non conformantConformant T t t T

20. GCRA facts

21. Leaky Buckets and GCRAs

22. Subadditivity ● We assume  (0) = 0 ● Subadditive if  t+s) <=  (t) +  (s) ● Subadditive closure  of  The largest subadditive function less than or equal to 

23. Subadditivity

24. Sufficiency of Subadditive Arrivals