Homework #1
(to be discussed in the recitation on September 23, 2005)
In case there are multiple paths between the sender and the receiver and subsequent packets are numbered with 0 or 1, show step-by-step an example scenario where receiver B cannot distinguish between an original packet and its duplicates.
Each sender has a window of 5 packets. If at any time a sender reaches the limit of 5 packets outstanding, it stops sending and waits for an acknowledgement. Since there is no packet loss (as stated below), the timeout timer value is irrelevant. This is similar to a Go-Back-N protocol, with the following difference.
The hosts do not send the acknowledgements immediately upon
a successful packet reception. Rather, the acknowledgements are sent
periodically, as follows. At the end of an 81 msec period, the host
examines whether any packets were successfully received during that
period. If one or more packets were received, a single acknowledgement
packet is sent to acknowledge all of those received packets. Otherwise,
no acknowledgement packet is sent.
Consider the two scenarios depicted in the figures (a) and (b) below. The router in (b) is 150 m away from either host, i.e., it is located in the middle. If the hosts in each configuration start sending packets at the same time, which configuration will complete the exchange sooner? Show the process.
Note 2: Please bring your own printed copy of the homework assignment, so the TA doesn't need to write the problem statement on the board.