Question: A later version of TCP, called ______ TCP, made an extra optimization on the _______ TCP.
Answer:
- A later version of TCP, called New Reno TCP, made an extra optimization on the Reno TCP.
- In particular, New Reno TCP improves the performance of Reno TCP by allowing it to recover more quickly from multiple packet losses in a single congestion window. In Reno TCP, if multiple packets are lost in a single congestion window, the sender can only recover one lost packet per round-trip time (RTT) due to the fast retransmit and fast recovery algorithms. However, in New Reno TCP, the sender can recover multiple lost packets per RTT. This is achieved by adding a new algorithm called "limited transmit" to the congestion control mechanism, which allows the sender to transmit up to three additional packets immediately after detecting multiple packet losses. This helps to keep the congestion window size from dropping too low and allows for faster recovery from congestion events.
MCQ: A later version of TCP, called ______ TCP, made an extra optimization on the _______ TCP.
Correct Answer:
A. New Reno; Reno
Explanation:
- A later version of TCP, called New Reno TCP, made an extra optimization on the Reno TCP.
- In particular, New Reno TCP improves the performance of Reno TCP by allowing it to recover more quickly from multiple packet losses in a single congestion window. In Reno TCP, if multiple packets are lost in a single congestion window, the sender can only recover one lost packet per round-trip time (RTT) due to the fast retransmit and fast recovery algorithms. However, in New Reno TCP, the sender can recover multiple lost packets per RTT. This is achieved by adding a new algorithm called "limited transmit" to the congestion control mechanism, which allows the sender to transmit up to three additional packets immediately after detecting multiple packet losses. This helps to keep the congestion window size from dropping too low and allows for faster recovery from congestion events.
Discuss a Question
Related Questions
- 1. In the slow start algorithm, the size of the congestion window grows ______________ until ___________________.
- 2. In the congestion avoidance algorithm, the size of the congestion window grows ______________ congestion is detected.
- 3. The congestion window size, after it passes the initial slow start state, follows a saw tooth pattern called _________________________________.
- 4. The __________________ technique is one of the open-loop congestion policy
- 5. The __________________ technique is one of the close-loop congestion policy
- 6. IP is a _________ protocol.
- 7. An HLEN value of decimal 10 means _______.
- 8. If the fragment offset has a value of 100, it means that _______.
- 9. What is needed to determine the number of the last byte of a fragment?
- 10. The IP header size is _______ bytes long.
You may be interested in:
Computer Networking MCQsRecently Added Articles
5 Best Amazon Advertising Agencies for Growing Brands
Last updated on: November 6, 2026Posted by: ExamRadar
How Image to Text Conversion Make Printed Study Materials Easier to Use?
Last updated on: October 23, 2026Posted by: ExamRadar
7 Best Online Exam Makers for Teachers, Schools, and Businesses
Last updated on: October 21, 2026Posted by: ExamRadar
How to pick a Bintan resort when you’ve only got 48 hours
Last updated on: September 23, 2026Posted by: ExamRadar
Features to Look for While Choosing the Best Automation Tool
Last updated on: July 15, 2026Posted by: ExamRadar
How Do Java Development Teams Use Docker and Kubernetes to Deploy Applications?
Last updated on: April 24, 2026Posted by: ExamRadar
AI vs Machine Learning: Key Differences Every Professional Should Know
Last updated on: February 13, 2026Posted by: ExamRadar