public:wan_optimization
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revision | Last revisionBoth sides next revision | ||
public:wan_optimization [2020/05/04 12:00] – lstolp | public:wan_optimization [2020/05/04 12:36] – lstolp | ||
---|---|---|---|
Line 9: | Line 9: | ||
| | ||
- | RFC 2018 Selective ACK | + | {{public: |
- | RFC 2001/2851 TCP Reno (Slow Start, Cong. Avoidance, Fast Retransmit & Recovery) | + | TCP may experience poor performance when multiple packets are lost |
- | RFC 2414/3390 Increase initial window size | + | from one window of data. With the limited information available |
- | RFC 2873 Accept TOS/ | + | from cumulative acknowledgments, |
- | RFC 2988 RTO calculation | + | |
- | RFC 3042 Limited transmit | + | |
- | RFC 3465 ABC | + | may have already been successfully received. |
- | RFC 3517 SACK sender behavior | + | A Selective Acknowledgment (SACK) mechanism, combined with a |
- | RFC 3649 High Speed TCP | + | |
+ | | ||
+ | | ||
+ | then retransmit only the missing data segments. | ||
+ | |||
+ | {{public: | ||
+ | Modern implementations of TCP contain four intertwined algorithms | ||
+ | that have never been fully documented as Internet standards: | ||
+ | | ||
+ | and [3] provide some details on these algorithms, [4] provides | ||
+ | | ||
+ | code for the 4.4BSD implementation. | ||
+ | must implement slow start and congestion avoidance (Section 4.2.2.15 | ||
+ | of [1]), citing [2] as the reference, but fast retransmit and fast | ||
+ | | ||
+ | | ||
+ | |||
+ | {{public: | ||
+ | This document specifies an optional standard for TCP to increase the | ||
+ | | ||
+ | | ||
+ | | ||
+ | of experiments and simulations showing that the higher initial window | ||
+ | does not lead to congestion collapse. | ||
+ | | ||
+ | |||
+ | {{public: | ||
+ | This memo describes a conflict between TCP [RFC793] and DiffServ | ||
+ | | ||
+ | an IPv4 header [RFC791]. In a network that contains DiffServ-capable | ||
+ | | ||
+ | | ||
+ | | ||
+ | the conflict. | ||
+ | | ||
+ | | ||
+ | does not define precedence or security parameter bits, there is no | ||
+ | | ||
+ | | ||
+ | |||
+ | {{public: | ||
+ | This document defines the standard algorithm that Transmission | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | |||
+ | {{public: | ||
+ | This document proposes a new Transmission Control Protocol (TCP) | ||
+ | | ||
+ | when a connection’s congestion window is small, or when a large | ||
+ | | ||
+ | " | ||
+ | | ||
+ | | ||
+ | | ||
+ | fast retransmit algorithm, rather than using a costly retransmission | ||
+ | | ||
+ | in the absence of, the TCP selective acknowledgment (SACK) mechanism. | ||
+ | |||
+ | {{public: | ||
+ | This document proposes a small modification to the way TCP increases | ||
+ | its congestion window. | ||
+ | | ||
+ | | ||
+ | the number of previously unacknowledged bytes each ACK covers. | ||
+ | | ||
+ | hole TCP receivers can use to induce the sender into increasing the | ||
+ | | ||
+ | |||
+ | {{public: | ||
+ | This document presents a conservative loss recovery algorithm for TCP | ||
+ | that is based on the use of the selective acknowledgment (SACK) TCP | ||
+ | | ||
+ | | ||
+ | but allows TCP senders to recover more effectively when multiple | ||
+ | | ||
+ | |||
+ | {{public: | ||
+ | The proposals in this document are experimental. | ||
+ | | ||
+ | that this is the best method for high-speed congestion control. | ||
+ | | ||
+ | | ||
+ | | ||
+ | | ||
+ | This document proposes HighSpeed TCP, a modification to TCP’s | ||
+ | | ||
+ | | ||
+ | | ||
+ | by TCP in realistic environments. | ||
+ | | ||
+ | | ||
+ | | ||
+ | of at most one congestion event every 5, | ||
+ | | ||
+ | is widely acknowledged as an unrealistic constraint. | ||
+ | | ||
+ | | ||
public/wan_optimization.txt · Last modified: 2024/01/25 03:31 by 127.0.0.1