Question: Consider a Go-Back-N sliding window algorithm (1 packet is 250 bytes long) running over a 100km point-to-point fiber link with bandwidth of 100 Mbps. a.
Consider a Go-Back-N sliding window algorithm (1 packet is 250 bytes long) running over a 100km point-to-point fiber link with bandwidth of 100 Mbps.
a. Compute the one-way propagation delay for this link, assuming that the speed of light is 2 x 108 m/s in the fiber. b. Suggest a suitable timeout value for the algorithm to use. List factors you need to consider. c. Suggest N to achieve 100% utilization in this link.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
