Question: 2. (30 points) Performance of Stop & Wait, Go-Back-N, and Selective Repeat. Suppose the bandwidth on a point-to-point link to moon is 2 Mbps and

2. (30 points) Performance of Stop & Wait, Go-Back-N, and Selective Repeat. Suppose the bandwidth on a point-to-point link to moon is 2 Mbps and the one-way propagation delay is 1 second. Assume that size of each packet is 125 bytes. Assume that window-size can be adjusted to achieve the maximum transmission rate. Answer the following for each ARQ scheme: stop-and- wait, go-back-n and selective-repeat? (a) (9 pt.) Assuming that the link is error-free, what is maximum rate of transmission achievable from earth to moon? (Assume zero queuing delay, and assume zero transmission time for ACK packets). (b) (3 pt.) Assuming that the link is error-free, to keep the pipe full for efficiency, what should be the window size that will allow go-back-n and selective repeat to achieve the maximum rate of transmission in part (a)? (c) (9 pt.) What is the minimum number of bits you need for the sequence number to achieve the above maximum transmission rate? Assume that the sender and receiver windows have the same size. (d) (9 pt.) Suppose that we are continuously transmitting packets from earth to moon and the 5th packet is lost and no other packets or ACKs are lost. How many and which packets get retransmitted? 2. (30 points) Performance of Stop & Wait, Go-Back-N, and Selective Repeat. Suppose the bandwidth on a point-to-point link to moon is 2 Mbps and the one-way propagation delay is 1 second. Assume that size of each packet is 125 bytes. Assume that window-size can be adjusted to achieve the maximum transmission rate. Answer the following for each ARQ scheme: stop-and- wait, go-back-n and selective-repeat? (a) (9 pt.) Assuming that the link is error-free, what is maximum rate of transmission achievable from earth to moon? (Assume zero queuing delay, and assume zero transmission time for ACK packets). (b) (3 pt.) Assuming that the link is error-free, to keep the pipe full for efficiency, what should be the window size that will allow go-back-n and selective repeat to achieve the maximum rate of transmission in part (a)? (c) (9 pt.) What is the minimum number of bits you need for the sequence number to achieve the above maximum transmission rate? Assume that the sender and receiver windows have the same size. (d) (9 pt.) Suppose that we are continuously transmitting packets from earth to moon and the 5th packet is lost and no other packets or ACKs are lost. How many and which packets get retransmitted
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
