Eddy et al. , 2004

Wesley M. Eddy and Shawn Ostermann and Mark Allman (2004):
New techniques for making transport protocols robust to corruption-based loss.
In: ACM SIGCOMM Computer Communication Review, 34;(5): 75--88.

Floyd, 1994

Sally Floyd (1994):
TCP and Explicit Congestion Notification.
In: ACM SIGCOMM Computer Communication Review, 24;(5): 8--23.

Balakrishnan et al. , 1999

Hari Balakrishnan and Randy H. Katz and Venkata N. Padmanbhan (1999):
The effects of asymmetry on TCP performance.
In: Mobile Networks and Applications, 4;(3): 219--241.

Rhee and Xu, 2005

Injong Rhee and Lisong Xu (2005):
CUBIC: A New TCP-Friendly High-Speed TCP Variant.
In: Proceedings of the International Workshop on Protocols for Fast Long-Distance Networks (PFLDnet '05).

Tan et al. , 2005

Kun Tan and Jingmin Song and Qian Zhang and Murari Sridharan (2005):
Compound TCP: A Scalable and TCP-Friendly Congestion Control for High-speed Networks.
Technical Report. Microsoft Research Asia.

Xu et al. , 2004

Lisong Xu and Khaled Harfoush and Injong Rhee (2004):
Binary increase congestion control (BIC) for fast long-distance networks.
In: Proceedings of the Annual Joint Conference of the IEEE Computer and Communications (INFOCOM '04). Volume 4. pp. 2514--2524.

Akyildiz et al. , 2005

Ian F. Akyildiz and Xudong Wang and Weilin Wang (2005):
Wireless mesh networks: a survey.
In: The International Journal of Computer and Telecommunications Networking, 47;(4): 445--487.

Liu et al. , 2007

Dan Liu and Mark Allman and Shudong Jin and Limin Wang (2007):
Congestion Control Without a Startup Phase.
In: Proceedings of the International Workshop on Protocols for Fast Long-Distance Networks (PFLDnet '07).

Welzl, 2002

Michael Welzl (2002):
CADPC: Congestion Avoidance with Distributed Proportional Control.
PhD thesis, University of Linz.

Braden et al. , 1998

B. Braden and D. Clark and J. Crowcroft and B. Davie and S. Deering and D. Estrin and S. Floyd and V. Jacobson and G. Minshall and C. Partridge and L. Peterson and K. Ramakrishnan and S. Shenker and J. Wroclawski and L. Zhang (1998):
Recommendations on Queue Management and Congestion Avoidance in the Internet.
RFC 2309 (Informational).

Braden, 1989

R. Braden (1989):
Requirements for Internet Hosts - Communication Layers.
RFC 1122 (Standard). Updated by RFCs 1349, 4379.

Falk and Katabi, 2005

Aaron Falk and Dina Katabi (2005):
Specification for the Explicit Control Protocol (XCP).
Internet Draft.

Mogul and Deering, 1990

J. C. Mogul and S. E. Deering (1990):
Path MTU discovery.
RFC 1191 (Draft Standard).

Allman, 2003

M. Allman (2003):
TCP Congestion Control with Appropriate Byte Counting (ABC).
RFC 3465 (Experimental).

Allman et al. , 2001

M. Allman and H. Balakrishnan and S. Floyd (2001):
Enhancing TCP's Loss Recovery Using Limited Transmit.
RFC 3042 (Proposed Standard).

Allman et al. , 2002

M. Allman and S. Floyd and C. Partridge (2002):
Increasing TCP's Initial Window.
RFC 3390 (Proposed Standard).

Allman et al. , 1999

M. Allman and V. Paxson and W. Stevens (1999):
TCP Congestion Control.
RFC 2581 (Proposed Standard). Updated by RFC 3390.

Balakrishnan et al. , 2002

H. Balakrishnan and V. Padmanabhan and G. Fairhurst and M. Sooriyabandara (2002):
TCP Performance Implications of Network Path Asymmetry.
RFC 3449 (Best Current Practice).

Blanton et al. , 2003

E. Blanton and M. Allman and K. Fall and L. Wang (2003):
A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP.
RFC 3517 (Proposed Standard).

Blanton and Allman, 2004

E. Blanton and M. Allman (2004):
Using TCP Duplicate Selective Acknowledgement (DSACKs) and Stream Control Transmission Protocol (SCTP) Duplicate Transmission Sequence Numbers (TSNs) to Detect Spurious Retransmissions.
RFC 3708 (Experimental).

Clark, 1982

D. D. Clark (1982):
Window and Acknowledgement Strategy in TCP.
RFC 813.

Floyd et al. , 2007

Sally Floyd and Mark Allman and Amit Jain and Pasi Sarolahti (2007):
Quick-Start for TCP and IP.
RFC 4782.

Floyd et al. , 2000

S. Floyd and J. Mahdavi and M. Mathis and M. Podolsky (2000):
An Extension to the Selective Acknowledgement (SACK) Option for TCP.
RFC 2883 (Proposed Standard).

Floyd, 2003

S. Floyd (2003):
HighSpeed TCP for Large Congestion Windows.
RFC 3649 (Experimental).

Floyd, 2004

S. Floyd (2004):
Limited Slow-Start for TCP with Large Congestion Windows.
RFC 3742 (Experimental).

Floyd et al. , 2004

S. Floyd and T. Henderson and A. Gurtov (2004):
The NewReno Modification to TCP's Fast Recovery Algorithm.
RFC 3782 (Proposed Standard).

Handley et al. , 2000

M. Handley and J. Padhye and S. Floyd (2000):
TCP Congestion Window Validation.
RFC 2861 (Experimental).

Jacobson et al. , 1992

V. Jacobson and R. Braden and D. Borman (1992):
TCP Extensions for High Performance.
RFC 1323 (Proposed Standard).

Ludwig and Meyer, 2003

R. Ludwig and M. Meyer (2003):
The Eifel Detection Algorithm for TCP.
RFC 3522 (Experimental).

Ludwig and Gurtov, 2005

R. Ludwig and A. Gurtov (2005):
The Eifel Response Algorithm for TCP.
RFC 4015 (Proposed Standard).

Mathis et al. , 1996

M. Mathis and J. Mahdavi and S. Floyd and A. Romanow (1996):
TCP Selective Acknowledgment Options.
RFC 2018 (Proposed Standard).

Postel, 1981

Jon Postel (1981):
Transmission Control Protocol.
RFC 793.

Ramakrishnan et al. , 2001

K. Ramakrishnan and S. Floyd and D. Black (2001):
The Addition of Explicit Congestion Notification (ECN) to IP.
RFC 3168 (Proposed Standard).

Sarolahti and Kojo, 2005

P. Sarolahti and M. Kojo (2005):
Forward RTO-Recovery (F-RTO): An Algorithm for Detecting Spurious Retransmission Timeouts with TCP and the Stream Control Transmission Protocol (SCTP).
RFC 4138 (Experimental).

Spring et al. , 2003

N. Spring and D. Wetherall and D. Ely (2003):
Robust Explicit Congestion Notification (ECN) Signaling with Nonces.
RFC 3540 (Experimental).

Touch, 1979

J. Touch (1979):
TCP Control Block Interdependence.
RFC 2140 (Informational).

Bhandarkar et al. , 2006

S. Bhandarkar and A. L. N. Reddy and M. Allman and E. Blanton (2006):
Improving the Robustness of TCP to Non-Congestion Events.
RFC 4653 (Experimental).

Marfia et al. , 2005

G. Marfia and C. Palazzi and G. Pau and M. Gerla and M. Sanadidi and M. Roccetti (2005):
TCP Libra: Exploring RTT-Fairness for TCP.
Technical Report Nr. UCLA-CSD TR-050037. UCLA Computer Science Department.

Bhandarkar et al. , 2006

S. Bhandarkar and A. L. N. Reddy and M. Allman and E. Blanton (2006):
Improving the Robustness of TCP to Non-Congestion Events.
RFC 4653 (Experimental).

Bennett et al. , 1999

Jon C. R. Bennett and Craig Partridge and Nicholas Shectman (1999):
Packet reordering is not pathological network behavior.
In: IEEE/ACM Transactions on Networking, 7;(6): 789--798.

Blanton and Allman, 2002

Ethan Blanton and Mark Allman (2002):
On making TCP more robust to packet reordering.
In: ACM SIGCOMM Computer Communication Review, 32;(1): 20--30.

Floyd and Jacobson, 1991

Sally Floyd and Van Jacobson (1991):
Traffic phase effects in packet-switched gateways.
In: ACM SIGCOMM Computer Communication Review, 21;(2): 26--42.

Savage et al. , 1999

Stefan Savage and Neal Cardwell and David Wetherall and Tom Anderson (1999):
TCP congestion control with a misbehaving receiver.
In: ACM SIGCOMM Computer Communication Review, 29;(5): 71--78.

Sherwood et al. , 2005

Rob Sherwood and Bobby Bhattacharjee and Ryan Braud (2005):
Misbehaving TCP receivers can cause internet-wide congestion collapse.
In: Proceedings of the ACM Conference on Computer and Communications Security (CCS '05). pp. 383--392. Published by ACM Press.

Ludwig and Katz, 2000

Reiner Ludwig and Randy H. Katz (2000):
The Eifel algorithm: making TCP robust against spurious retransmissions.
In: ACM SIGCOMM Computer Communication Review, 30;(1): 30--36.

Sarolahti et al. , 2003

Pasi Sarolahti and Markku Kojo and Kimmo Raatikainen (2003):
F-RTO: an enhanced recovery algorithm for TCP retransmission timeouts.
In: ACM SIGCOMM Computer Communication Review, 33;(2): 51--63.