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.
Consider the data:
r=average rate
b=burse size
t= Time of intervals
So,the packet flow conforming to a leaky-bucket specification (r,b) will not have to wait at a leaky bucket policer.