Restore Submenu
Minimize Submenu Research

Related TCP Research

The following table lists a number of relevant approaches to tackle the aforementioned issues of TCP. Of coure, this list is not exhaustive.

IssueTackled by
Loss Ambiguity
  • RFC3517: A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
  • RFC3782: The NewReno Modification to TCP's Fast Recovery Algorithm
  • EddOstAll2004a: New techniques for making transport protocols robust to corruption-based loss
Start-up behavior
  • RFC3390: Increasing TCP's Initial Window
  • RFC3742: Limited Slow-Start for TCP with Large Congestion Windows
  • RFC4782: Quick-Start for TCP and IP
  • LiuAllJin200702a: Congestion Control Without a Startup Phase
  • XCP
  • OneBit
RTT unfairness
Reordering
  • RFC4653: Improving the Robustness of TCP to Non-Congestion Events
  • MarPalPau200509a: TCP Libra: Exploring RTT-Fairness for TCP
  • BenParShe1999a Packet Reordering is Not Pathological Network Behavior
  • BlaAll2002a: On making TCP more robust to packet reordering
Delay spikes
  • RFC3042: Enhancing TCP's Loss Recovery Using Limited Transmit
  • RFC3517: A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP
  • RFC3522: The Eifel Detection Algorithm for TCP
  • RFC3708: Using TCP Duplicate Selective Acknowledgement (DSACKs) and Stream Control Transmission Protocol (SCTP) Duplicate Transmission Sequence Numbers (TSNs) to Detect Spurious Retransmissions
  • RFC4015: The Eifel Response Algorithm for TCP
  • RFC4138: Forward RTO-Recovery (F-RTO): An Algorithm for Detecting Spurious Retransmission Timeouts with TCP and the Stream Control Transmission Protocol (SCTP)
  • SarKojRaa2003a: F-RTO: an enhanced recovery algorithm for TCP retransmission timeouts
  • LudKat2000a: The Eifel algorithm: making TCP robust against spurious retransmissions
  • F-ACK
Scalability
  • RFC3649: HighSpeed TCP for Large Congestion Windows
  • RFC3742: Limited Slow-Start for TCP with Large Congestion Windows
  • MarPalPau200509a: TCP Libra: Exploring RTT-Fairness for TCP
  • XuHarRhe2004a: Binary increase congestion control (BIC) for fast long-distance networks
  • RheXu200502a: CUBIC: A New TCP-Friendly High-Speed TCP Variant
  • TanSonZha2005a: Compound TCP: A Scalable and TCP-Friendly Congestion Control for High-speed Networks
No Holistic View
  • RFC2309: Recommendations on Queue Management and Congestion Avoidance in the Internet
Good Faith
  • RFC3465: TCP Congestion Control with Appropriate Byte Counting (ABC)
  • RFC3540: Robust Explicit Congestion Notification (ECN) Signaling with Nonces
  • SYN cookies
  • Random noncing
  • Initial sequence number generation
Designed To Congest
  • RFC3168: The Addition of Explicit Congestion Notification (ECN) to IP
  • RFC3540: Robust Explicit Congestion Notification (ECN) Signaling with Nonces
  • Flo199410a: TCP and Explicit Congestion Notification
  • draft-falk-xcp-spec-00: Specification for the Explicit Control Protocol (XCP)
  • MarPalPau200509a: TCP Libra: Exploring RTT-Fairness for TCP
  • Wel2002a: CADPC: Congestion Avoidance with Distributed Proportional Control
  • "One Bite Is Enough"
Symmetry Assumption
  • RFC3449: TCP Performance Implications of Network Path Asymmetry