Source rate encoding mechanisms for binary congestion control

Explicit congestion control based on 1-bit probabilistic marking

“…The proposed algorithm was originally devised for explicit-rate congestion control, where routers send multi-byte feedback messages to sources. However, we have also presented alternative signaling mechanisms, based on binary feedback, that can be used in an efficient way, while exhibiting a close performance to that obtained with explicit-rate sources [37,38]. In particular, the results obtained with these binary schemes show that the oscillations of source rates are very small, when compared to other binary schemes, and sources are able to sense the network variations with accuracy.…”

“…stateless algorithms) and, in our case, it is necessary because the marking probability depends also on the current value of source rates. For an IP-based implementation, we suggest the forward rate encoding of [37], which is a scheme that keeps encoded flow rates inside the regular IP headers, at cost of a small encoding error. In any case, the objective is to transmit to sources the values of p(k) using a stream of binary indications (instead of multi-byte feedback messages).…”

“…Also, the approach in [37,38] is deterministic (both in the marking procedure at the routers and the source adaptation functions), while the mechanism proposed here is based on a new strategy that involves probabilistic marking and leads to a less complex source algorithm.…”