How to improve your network performance by asking your provider for worse service

TCP's congestion control is deliberately "cautious", avoiding overloads by starting with a small initial window and then iteratively ramping up. As a result, it often takes flows several round-trip times to fully utilize the available bandwidth. In this paper we propose using several levels of lower priority service and a modified TCP behavior to achieve significantly improved flow completion times while preserving fairness.

[1]  Mark Allman,et al.  Comments on bufferbloat , 2013, CCRV.

[2]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[3]  Amit Agarwal,et al.  An argument for increasing TCP's initial congestion window , 2010, CCRV.

[4]  Sally Floyd,et al.  TCP Selective Acknowledgment Options , 1996, RFC.

[5]  Chase Cotton,et al.  Packet-level traffic measurements from the Sprint IP backbone , 2003, IEEE Netw..

[6]  Qian Zhang,et al.  A Compound TCP Approach for High-Speed and Long Distance Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[7]  Sergiu Nedevschi,et al.  Reducing Network Energy Consumption via Sleeping and Rate-Adaptation , 2008, NSDI.

[8]  Christophe Diot,et al.  An approach to alleviate link overload as observed on an IP backbone , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[10]  Injong Rhee,et al.  CUBIC: a new TCP-friendly high-speed TCP variant , 2008, OPSR.

[11]  Nick McKeown,et al.  Deconstructing datacenter packet transport , 2012, HotNets-XI.

[12]  Nick McKeown,et al.  Why flow-completion time is the right metric for congestion control , 2006, CCRV.

[13]  Lili Wang,et al.  A Conservative Selective Acknowledgment (SACK)-based Loss Recovery Algorithm for TCP , 2003, RFC.

[14]  Sally Floyd,et al.  Increasing TCP's Initial Window , 1998, RFC.