Consider sending a file of 2Mbits from Host A to Host B. There are three links and two store-and-forward routers (or switches) between A and B. Assume that no link is congested (that is, no queueing delays), and the one-way propagation delay of each link is 10ms. Host A divides this file into packets of S bits each and adds 100 bits of header to each packet, forming packets of L = 100 + S bits overall. Each link has a transmission rate of R =1Mbps. Find the value of S (in bits) that minimizes the delay of moving this file from Host A to Host B (end-to-end delay).

Question

Consider  sending  a file of 2Mbits  from Host  A to Host  B. There  are three  links and  two  store-and-forward  routers  (or switches)  between  A and  B. Assume that no link is congested (that is, no queueing delays), and the one-way propagation delay of each link is 10ms.  Host A divides this file into packets of S bits each and adds 100 bits of header to each packet,  forming packets  of L = 100 + S bits  overall.  Each  link has a transmission rate of R =1Mbps.  Find the value of S (in bits) that minimizes the delay of moving this file from Host A to Host B (end-to-end delay).