CMPSCI 677: Homework 2
Due: noon, Tuesday, March 4 2003
Off-campus students: one week from when you view Lecture 8
Web posted: Tue Feb 25, 10:03 AM
- Problems 6, 7, 10, 15, 17, 22 from Chapter 2 (pages 132-133).
- Problems 1, 2, 5 from Chapter 3 (page 180).
- Consider a leaky bucket policer discussed in class. The leaky bucket
constrains the average rate and burst size of a packet flow. We now want
to police the peak rate p as well. Show how you can employ a sequence
of two leaky bucket policers to police the average rate r, burst size b and
the peak rate p. Be sure to give the bucket size and token generation rate for
each policer.
- 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 at the leaky bucket is less that rt+b in every interval of length t
for all t. Will a packet flow that conforms to a leaky bucket specification (r,b)
ever wait at a leaky bucket policer with parameters r and b? Justify
your answer.
Prashant Shenoy
Last modified: Tue Feb 25 10:22:46 EST 2003