HW#2 Due date: Sunday, October 11, 2020

Problem#1:
1. What is meant by the statement: Congestion control is essentially “feedback-control”?
2. When senders get acknowledgment of receipt of packets, senders infer that:
a. They send at rate higher than the line capacity,
b. Senders are sending at rate lower than the line capacity,
c. The packets have been dropped,
d. The packets are not dropped, i.e., delivered,
e. (b) and (e),
f. None of the above.
3. Can we use the dropping of packets as a “signal of congestion”?
4. (True / False) Switches decrement the TTL field in the IP header.
5. What is the minimum value for the timeout of a reliable transmission protocol? Why?
6. What is the difference between congestion control and flow control?
7. Explain the difference between traffic shaping and traffic policing.

Problem#2: The token bucket algorithm replenishes tokens at the kens at the rate of 1 rate of
1 token/ms. The maximum token count is 3. It replenishes tokens before transmission.
A. Given the following packet arrival schedule, fill in the system state: token count,
scheduled departures, and queued packets, at each packet arrival time (if a packet
arrives and is not immediately sent then Queued Packets increments by 1). The
algorithm is fast enough such that you may assume packets are sent instantaneously, if
possible. Initially the Leaky Bucket was full.

[Note: You are using a queue of length 4]