Question

True or False for Computer networking 1) Suppose in Go-back-N, the sender cycles through sequence number...

True or False for Computer networking

1) Suppose in Go-back-N, the sender cycles through sequence number of 0, 1, 2, 3, 4. In addition, the sender chooses the window size N=5 packets (i.e., 5 packets can be in the flight from the sender to the receiver). In this case, reliable data transfer can be achieved from the sender to the receiver

2) At a TCP sender, triple duplicated ACKs are always handled by resending the missing segment.

3) In Go-Back-N, a sender sends a window of 5 segments. The first and third are lost, while the rest of the segments are received successfully by the receiver. Then the sender will only need to retransmit the first, second, and third segments.

4)

Assume a TCP sender always has data to send, and the TCP sending rate is controlled as follows:

LastByteSent - LastByteAcked <= min(cwnd, rwnd).

When rwnd becomes 0, i.e., the receive buffer is full, the TCP sender will stop sending data.

--------------------------------------------------------------------------

Upvote for the right answer !!

Thanks

--------------------------------------------------------------------------

Homework Answers

Answer #1

1.

True.

The transmission is reliable since if packet is lost, sender will resend all the lost frames and also sender makes sure all segment is received by receiver.

2.

False

In case of triple duplicate acknowledgement, sender simply reduces it's window size to half.

3.

False.

In Go Back N, if even one packet of a window is lost, all the entire segment of window size has to be sent.

4.

True.

If receiver window size is 0, sender will stop sending frames and receiver will reject frames if sent.

If you have any questions comment down. Please don't simply downvote and leave. If you are satisfied with answer, please? upvote thanks

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider the Go-back-N protocol with a sender window of size 4 and, for simplicity, assume infinite...
Consider the Go-back-N protocol with a sender window of size 4 and, for simplicity, assume infinite sequence numbers that never wrap. Suppose that at time T the next in-order packet that the receiver is expecting has a sequence number of K. Assume that the underlying channel may lose or corrupt packets but does not reorder them. (a)What are the possible sets of sequence numbers inside the sender’s window at time T? Justify your answer. (b) What are all possible values...
Can someone please explain this to me? Suppose that the Go-Back-N protocol with ? = 3...
Can someone please explain this to me? Suppose that the Go-Back-N protocol with ? = 3 and the sending window of size 7 is used to send packets. Let ?f = 31 modulo 2m, ?n = 35 modulo 2m, and ?n= 33 modulo 2m. What are the sequence numbers of data packets in transit? What are the acknowledgement numbers of ACK packets in transmit? If the sender’s process sends two more data packets to the sender’s transport layer and one...
Multiple choice questions: Circle the correct answer 7) Consider Go-Back-N protocol. Suppose that Host A sends...
Multiple choice questions: Circle the correct answer 7) Consider Go-Back-N protocol. Suppose that Host A sends 6 data segments to Host B, and the 4th segment is lost. In the end, all 6 data segments have been correctly received by Host B. Assume that the timeout values is sufficiently long such that 6 consecutive data segments and their corresponding ACKs can be received (if not lost in the channel) by Host B and Host A, respectively before the timer times...
Consider a scenario where two hosts use a sliding window protocol, either Go-Back-N or Selective Repeat,...
Consider a scenario where two hosts use a sliding window protocol, either Go-Back-N or Selective Repeat, to exchange data packets. Assume that the RTT is 30 milliseconds and the sending rate is R = 1Gbps, and the size of every packet is L = 2,000 bytes, including both header fields and data. (a). How big would the window size have to be for the channel utilization to be greater than 98%? (b). Assume that we use the window size calculated...
Please answer the following Case analysis questions 1-How is New Balance performing compared to its primary...
Please answer the following Case analysis questions 1-How is New Balance performing compared to its primary rivals? How will the acquisition of Reebok by Adidas impact the structure of the athletic shoe industry? Is this likely to be favorable or unfavorable for New Balance? 2- What issues does New Balance management need to address? 3-What recommendations would you make to New Balance Management? What does New Balance need to do to continue to be successful? Should management continue to invest...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT