Question

03) Consider sending a file size of O bits over a path of 2 links. Suppose the first link can transmit at R1 bit/sec (bps) and the second link can transmit R2 bits/sec (bps) (R1+ R2), both links have a propagation delay of tp, network lightly loaded (no queuing delays), and each link's maximum frame size, S bits, is same (S < O and number of segments is integer and headers are negligible.). (a) How long does it take to send the file in circuit switched network? (b How long does the receiver wait for completion of transfer of entire file (latency) if Stop-N-Wait reliable data transfer protocol is employed by the source and destina- tion? (c What will be the utilization of the link for Stop-N-Wait protocol in Part (B)? (d) In order to increase the utilization, Stop-N-Wait is replaced with Go- Back-N with window size (N) 4. Suppose node in the middle have large enough buffer to hold entire packet. What would be the delay in Go-Back-N? (e) What will be the utilization of the link for Go-Back-N, in Part (D)?

Answer 1

sec frome Size S eifs R? Tota faes Transfer time 1 From 1 TP tie, ntes, complete, 4?P R 22 Time to oe Ri "",""error"":null,""modified"":1551084811,""source"":""automated""}"