Scalable TCP: improving performance in highspeed wide area networks

By Tom Kelly. CCRV, 2003

1,094 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/b315429e86d661bf9d5bbfae2ffa541a178860c2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Mung Chiang
2. Steven H. Low
3. Yunhong Gu
4. Robert L. Grossman
5. John C. Doyle
6. Sanjay Shakkottai
7. Hari Balakrishnan
8. A. Robert Calderbank

In Electrical and Electronic Engineering

1. Mung Chiang
2. Steven H. Low
3. John C. Doyle
4. Yunhong Gu
5. Robert L. Grossman
6. A. Robert Calderbank
7. Sanjay Shakkottai
8. Hari Balakrishnan

Citations in the corpus

• The Globus Striped GridFTP Framework and Server (2005, methodology): “These solutions include improvements to TCP [21, 35, 39], new transport protocols such as XCP [38], XTP [54] and reliable layers on top of UDP [5, 15, 16, 29, 32, 35, 53].”
• CUBIC: a new TCP-friendly high-speed TCP variant (2008, background): “These networks are characterized by large bandwidth and delay product (BDP) which represents the total number of packets needed in flight while keeping the bandwidth fully utilized, in other words, the size of the congestion window.”
• Binary increase congestion control (BIC) for fast long-distance networks (2004, methodology): “The value of d for AIMD [18], HSTCP [1], and STCP [4] is 0.”
• Network Optimization and Control (2008, methodology): “The model for Scalable TCP was proposed by Vinnicombe [58] and implemented by Tom Kelly [59].”
• Host-to-Host Congestion Control for TCP (2010, methodology): “STCP [73] VI-B 2003 NewReno Multiplicative Increase Multiplicative Decrease congestion avoidance policy S Experimental >2.”
• Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures (2007, methodology): “Several new algorithms have been proposed in the last few years to address the problems of Reno, including TCP Westwood, HSTCP [42], FAST TCP [56], STCP [67],BIC TCP [156], HTCP [90], MaxNet [154], [155], XCP [62], and RCP [33], etc.”
• MPTCP Is Not Pareto-Optimal: Performance Issues and a Possible Solution (2013, background): “To completely avoid problems P1 and P2, it is necessary to depart from the compatibility with regular TCP by using congestion mechanisms that are less sensitive to round-trip times, such as CUBIC [26] or STCP [27].”
• FAST TCP: Motivation, Architecture, Algorithms, Performance (2006, methodology): “In contrast, the packet-level designs of HSTCP [15], STCP [32], and FAST TCP are explicitly guided by flow-level goals.”
• A Compound TCP Approach for High-Speed and Long Distance Networks (2006, background): “STCP [4] alters TCP’s AIMD congestion avoidance scheme to MIMD (multiplicative increase and multiplicative decrease).”
• UDT: UDP-based data transfer for high-speed wide area networks (2007, methodology): “Network researchers have proposed quite a few solutions to this problem, most of which are new TCP congestion control algorithms [8, 23, 25, 37, 40, 53, 55, 67] and application-level This paper is partly based upon five conference papers published on the proceedings of PFLDNet workshop 2003 and 2004”
• Design, Implementation and Evaluation of Congestion Control for Multipath TCP (2011, neutral): “As a compromise, we propose the following.”