cc_dctcp(4) [freebsd man page]

CC_DCTCP(4)						   BSD Kernel Interfaces Manual 					       CC_DCTCP(4)

NAME

     cc_dctcp -- DCTCP Congestion Control Algorithm

DESCRIPTION

     The DCTCP (data center TCP) congestion control algorithm aims to maximise throughput and minimise latency in data center networks by utilis-
     ing the proportion of Explicit Congestion Notification (ECN) marks received from capable hardware as a congestion signal.

     DCTCP uses fraction of ECN marked packets to update congestion window.  The window reduction ratio is always <= 1/2.  Only when all of the
     packets are marked, congestion window is halved.

     In order to keep the accuracy of the ECN marked fraction, a DCTCP receiver mirrors back incoming (or missing) CE marks by setting (or clear-
     ing) ECE marks.  This feedback methodology is also adopted when the receiver uses delayed ACK.

     The FreeBSD DCTCP implementation includes two minor modifications for the one-sided deployment.  Considering the situation that DCTCP is used
     as sender and classic ECN is used as receiver, DCTCP sets the CWR flag as the reaction to the ECE flag.  In addition, when classic ECN is
     used as sender and DCTCP is used as receiver, DCTCP avoids to mirror back ACKs only when the CWR flag is set in the incoming packet.

     The other specifications are based on the paper and Internet Draft referenced in the SEE ALSO section below.

MIB Variables
     The algorithm exposes the following tunable variables in the net.inet.tcp.cc.dctcp branch of the sysctl(3) MIB:

     alpha  An initial estimator of the congestion on the link.  Default is 0.

     dctcp_shift_g
	    An estimation gain in the alpha calculation.  Default is 16.

     slowstart
	    A trigger to halve congestion window after slow start.  Default does nothing to halve window.

SEE ALSO

     cc_chd(4), cc_cubic(4), cc_hd(4), cc_htcp(4), cc_newreno(4), cc_vegas(4), mod_cc(4), tcp(4), mod_cc(9)

     Mohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari
     Sridharan, "Data Center TCP (DCTCP)", ACM SIGCOMM 2010, http://research.microsoft.com/pubs/121386/dctcp-public.pdf, 63-74, July 2010.

     Stephen Bensley, Lars Eggert, and Dave Thaler, Microsoft's Datacenter TCP (DCTCP): TCP Congestion Control for Datacenters,
     http://tools.ietf.org/html/draft-bensley-tcpm-dctcp-01.

HISTORY

     The cc_dctcp congestion control module first appeared in FreeBSD 11.0.

     The module was first released in 2014 by Midori Kato studying at Keio University, Japan.

AUTHORS

     The cc_dctcp congestion control module and this manual page were written by Midori Kato katoon@sfc.wide.ad.jp and Lars Eggert lars@netapp.com
     with help and modifications from Hiren Panchasara hiren@FreeBSD.org

BSD
								 January 12, 2015							       BSD

CC_VEGAS(4)						   BSD Kernel Interfaces Manual 					       CC_VEGAS(4)

NAME

     cc_vegas -- Vegas Congestion Control Algorithm

DESCRIPTION

     The Vegas congestion control algorithm uses what the authors term the actual and expected transmission rates to determine whether there is
     congestion along the network path i.e.

	   actual rate = (total data sent in a RTT) / RTT

	   expected rate = cwnd / RTTmin

	   diff = expected - actual

     where RTT is the measured instantaneous round trip time and RTTmin is the smallest round trip time observed during the connection.

     The algorithm aims to keep diff between two parameters alpha and beta, such that:

	   alpha < diff < beta

     If diff > beta, congestion is inferred and cwnd is decremented by one packet (or the maximum TCP segment size).  If diff < alpha, then cwnd
     is incremented by one packet.  Alpha and beta govern the amount of buffering along the path.

     The implementation was done in a clean-room fashion, and is based on the paper referenced in the SEE ALSO section below.

IMPLEMENTATION NOTES

     The time from the transmission of a marked packet until the receipt of an acknowledgement for that packet is measured once per RTT.  This
     implementation does not implement Brakmo's and Peterson's original duplicate ACK policy since clock ticks in today's machines are not as
     coarse as they were (i.e. 500ms) when Vegas was originally designed.  Note that modern TCP recovery processes such as fast retransmit and
     SACK are enabled by default in the TCP stack.

MIB Variables
     The algorithm exposes the following tunable variables in the net.inet.tcp.cc.vegas branch of the sysctl(3) MIB:

     alpha  Query or set the Vegas alpha parameter as a number of buffers on the path.	When setting alpha, the value must satisfy: 0 < alpha <
	    beta.  Default is 1.

     beta   Query or set the Vegas beta parameter as a number of buffers on the path.  When setting beta, the value must satisfy: 0 < alpha <
	    beta.  Default is 3.

SEE ALSO

     cc_chd(4), cc_cubic(4), cc_hd(4), cc_htcp(4), cc_newreno(4), h_ertt(4), mod_cc(4), tcp(4), khelp(9), mod_cc(9)

     L. S. Brakmo and L. L. Peterson, "TCP Vegas: end to end congestion avoidance on a global internet", IEEE J. Sel. Areas Commun., 8, 13,
     1465-1480, October 1995.

ACKNOWLEDGEMENTS

     Development and testing of this software were made possible in part by grants from the FreeBSD Foundation and Cisco University Research Pro-
     gram Fund at Community Foundation Silicon Valley.

HISTORY

     The cc_vegas congestion control module first appeared in FreeBSD 9.0.

     The module was first released in 2010 by David Hayes whilst working on the NewTCP research project at Swinburne University of Technology's
     Centre for Advanced Internet Architectures, Melbourne, Australia.	More details are available at:

     http://caia.swin.edu.au/urp/newtcp/

AUTHORS

     The cc_vegas congestion control module and this manual page were written by David Hayes <david.hayes@ieee.org>.

BSD
								September 15, 2011							       BSD