1. Problem 17: “Greedy Shapers” T3 T4 CPU2 T1 T2 CPU1 S Stream S1: P = 100 J = 1000 D = 1 Stream S2: P = 10 J = 10 D = 1 Stream S3: P = 10 J = 0 D = 0 Stream S2 after output shaping: P = 10 J = 10 D = 1 WCED = 5 Priority = high WCED = 1 Priority = low WCED = 5 Priority = high WCED = 2 Priority = low Greedy Shaper

2. Analysis Questions: End-to-end Delay of S2 End-to-end Delay of S3 Buffer requirement on CPU1 (T1, T2 and S use shared buffer) Buffer requirement on CPU2 (T3 and T4 use shared buffer)

3. Greedy Shapers A greedy shaper ensures that the stream on its output is bounded by a predefined stream specification. To achieve this shaping, a greedy shaper delays events of an input event stream as long as needed, but as short as soon a possible.