https://en.formulasearchengine.com/index.php?action=history&feed=atom&title=Multiple-conclusion_logicMultiple-conclusion logic - Revision history2026-04-18T12:28:48ZRevision history for this page on the wikiMediaWiki 1.43.0-wmf.28https://en.formulasearchengine.com/index.php?title=Multiple-conclusion_logic&diff=12516&oldid=preven>Westerdundrun: added Wiki link - Timothy Smiley2010-12-30T21:52:18Z<p>added Wiki link - Timothy Smiley</p>
<p><b>New page</b></p><div>The '''additive-increase/multiplicative-decrease''' ('''AIMD''') algorithm is a feedback control algorithm best known for its use in [[Transmission Control Protocol|TCP]] [[TCP congestion avoidance algorithm|Congestion Avoidance]]. AIMD combines linear growth of the congestion window with an exponential reduction when a congestion takes place. Multiple flows using AIMD congestion control will eventually converge to use equal amounts of a contended link.<ref name=chui1989>{{cite journal|last=Chiu|first=Dah-Ming|coauthors=Raj Jain|title=Analysis of increase and decrease algorithms for congestion avoidance in computer networks|journal=Computer Networks and ISDN systems|year=1989|volume=17|pages=1–14}}</ref> The related schemes of multiplicative-increase/multiplicative-decrease (MIMD) and additive-increase/additive-decrease (AIAD) do not converge.<br />
<br />
== Algorithm ==<br />
<br />
The approach taken is to increase the transmission rate (window size), probing for usable bandwidth, until loss occurs. The policy of additive increase may, for instance, increase the congestion window by a fixed amount every [[round trip time]]. When congestion is detected, the transmitter decreases the transmission rate by a multiplicative factor; for example, cut the congestion window in half after loss. The result is a saw-tooth behavior that represents the probe for bandwidth.<br />
<br />
AIMD requires a binary signal of congestion. Most frequently, packet loss serves as the signal; the multiplicative decrease is triggered when a timeout or acknowledgement message indicates a packet was lost. It is also possible for in-network mechanisms to mark congestion (without discarding packets) as in [[Explicit Congestion Notification]] (ECN).<br />
<br />
=== Mathematical Formula ===<br />
<br />
Let ''w''(''t'') be the sending rate (e.g. the [[congestion window]]) during time slot ''t'', ''a'' (<math>a > 0</math>) be the additive increase parameter, and ''b'' (<math>0 < b < 1</math>) be the multiplicative decrease factor.<br />
<br />
<math><br />
w(t + 1) = \begin{cases}<br />
w(t) + a & \text{ if congestion is not detected} \\<br />
w(t) \times b & \text{ if congestion is detected}<br />
\end{cases}<br />
</math><br />
<br />
In TCP, after [[slow start]], the additive increase parameter ''a'' is typically one MSS ([[maximum segment size]]) per [[round-trip time]], and the multiplicative decrease factor ''b'' is typically 1/2.<br />
<br />
== Protocols ==<br />
<br />
AIMD congestion avoidance is or was used in:<br />
* [[Transmission Control Protocol]] (TCP)<br />
* [[Stream Control Transmission Protocol]] (SCTP) <br />
* [[Transport_Layer#Comparison_of_OSI_transport_protocols|OSI Transport Class 4]]<ref name=chui1989/><br />
* [[DCCP]] (in some modes)<ref>{{cite web|last=Floyd|title=4341: RFC Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 2: TCP-like Congestion Control|url=https://tools.ietf.org/html/rfc4341}}</ref><br />
* [[DECnet]]<ref name=chui1989/><br />
<br />
== See also ==<br />
* [[TCP congestion avoidance algorithm]]<br />
* [[TCP Reno]]<br />
* [[congestion window]]<br />
<br />
== References ==<br />
<references/><br />
<br />
{{DEFAULTSORT:Additive increase multiplicative decrease}}<br />
[[Category:Transport layer protocols]]<br />
<br />
<br />
{{Compu-network-stub}}</div>en>Westerdundrun