Manual Pages  — CC_VEGAS

cc_vegas – Vegas Congestion Control Algorithm

DESCRIPTION IMPLEMENTATION NOTES MIB Variables SEE ALSO ACKNOWLEDGEMENTS HISTORY AUTHORS

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.

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.

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

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