A rate-limiting algorithm that counts requests in a moving time span (e.g. the last 60 seconds), avoiding the burst-at-the-boundary problem of fixed windows.
Continue to AI University →