COMPUTER NETWORKS
CONE Lab - Transport - Numerical exercises
Problem
20 (Ch. 3 of Computer Networking by J.F. Kurose and K.W.
Ross)
Consider
transferring an enormous file of L bytes from host A to host B. Assumme
an MSS of 1460 bytes.
a) What is the maximum length of L such that TCP sequence numbers are
not exhausted? Recall that the TCP number field has four bytes.
b) For the L you obtain in (a), find how long it takes to transmit the
file. Assme that a total of 66 bytes of transport, network and data-link
header are added to each segment before the resulting packet is sent out
over a 10 Mbps link. Ignore flow control and congestion control, so A
can pump out the segments back-to-back and continuously.
Problem
26 (Ch. 3 of Computer Networking by J.F. Kurose and K.W.
Ross)
