Symbol t_base

The passage around this formula

Server-side deduplication only pays off if the retry that triggers it is well behaved, and naive retry timing defeats itself. If every failed client retries after exactly the same fixed delay, the retries arrive in synchronized waves and can overload a server that was only briefly struggling. AWS’s widely adopted answer is to randomise the delay rather than only grow it, and the simplest of the algorithms it documents, full jitter, is stated as $t_n = \mathrm{random}\!\left(0,\ \min\!\left(t_{\max},\ t_{\mathrm{base}} \cdot 2^{n}\right)\right)$. drawing the wait before attempt n uniformly between zero and a capped exponential ceiling, rather than sleeping for the ceiling itself [ 8 ] . The reasoning given is about contention, not just delay: without jitter, “N clients…

Read this part in the article →