1. A packet flow is said to conform to a leaky bucket specification ( r, b ) with burst size b and average rate r if the number of packets that arrive to the leaky bucket is less than rt + b packets...

1. A packet flow is said to conform to a leaky bucket specification (r, b) with burst size
b
and average rate
r
if the number of packets that arrive to the leaky bucket is less than
rt
+
b
packets in every interval of time of length
t
for all
t. Will a packet flow that conforms to a leaky bucket specification (r, b) ever have to wait at a leaky bucket policer with parameters
r
and
b? Justify your answer.

2. Show that as long as
r
₁
Rw
₁/(
w_j

), then
d_max

is indeed the maximum delay that any packet in flow 1 will ever experience in the WFQ queue.