HOMEWORK

1. The segments of data sent in a new connection have 100B, 200B, 300B, 200B and 100B. The acknowledgments received are 101, 101, 601, 601 and 901 without a retransmission timeout. What is the order in which the datagrams have been received?

2. The user application gives the following data to TCP with each data coming after 10ms gap: 10B, 20B, 50B, 100B, 250B. The RTT is 100ms. How many segments are sent out by TCP if MSS = 1460B? What about if RTT = 20ms?

3. If router R1 receives an advertisement from a router with ID N1.R2 at time 0 – ((N2, 1), (N3, 2)) in DV algorithm, what is the topology of the network? What are the new routing table entries after the above advertisement is received by R1? At 20s., R1 receives a new advertisement from N1.R2 with the following: (N2, 16). Which of the optimizations to deal with count-to-infinity problem are definitely enabled based on the two advertisements received?

4. An application which uses TCP sends data as follows: 10B, 20B, 512B, 1000B, 20B and 40B at 20ms intervals. You are given that RTT=50ms, RTO=100ms, and Path MTU=1500B. How many segments are sent by TCP, at what time and what is the size of each? What happens if the acknowledgment to the second segment is lost – how many segments are sent at what time and what are the sizes of the segments?