UNLIMITED FREE
ACCESS
TO THE WORLD'S BEST IDEAS

SUBMIT
Already a GlobalSpec user? Log in.

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

Customize Your GlobalSpec Experience

Finish!
Privacy Policy

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

IETF RFC 3517

A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP

active, Most Current
Buy Now
Organization: IETF
Publication Date: 1 April 2003
Status: active
Page Count: 13
scope:

This document presents a conservative loss recovery algorithm for TCP that is based on the use of the selective acknowledgment (SACK) TCP option. The algorithm presented in this document conforms to the spirit of the current congestion control specification (RFC 2581), but allows TCP senders to recover more effectively when multiple segments are lost from a single flight of data.

Document History

IETF RFC 3517
April 1, 2003
A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
This document presents a conservative loss recovery algorithm for TCP that is based on the use of the selective acknowledgment (SACK) TCP option. The algorithm presented in this document conforms to...

References

Advertisement