#backoff #adaptive #rate-limiting #throttle

adaptive_backoff

library for intelligently backing off rate limited or fallible resources

3 unstable releases

0.2.1 Feb 23, 2021
0.2.0 Dec 21, 2020
0.1.0 Dec 19, 2020

#3 in #ratelimit

Download history 470/week @ 2024-03-13 1140/week @ 2024-03-20 1158/week @ 2024-03-27 1680/week @ 2024-04-03 950/week @ 2024-04-10 1936/week @ 2024-04-17 1496/week @ 2024-04-24 1466/week @ 2024-05-01 1096/week @ 2024-05-08 485/week @ 2024-05-15 1557/week @ 2024-05-22 1743/week @ 2024-05-29 722/week @ 2024-06-05 1352/week @ 2024-06-12 1184/week @ 2024-06-19 832/week @ 2024-06-26

4,454 downloads per month

MIT license

17KB
276 lines

Adaptive Backoff

Adaptive backoff provides a mechanism to intelligently back off use of rate limited or failure operations through sources simples structs, Backoffs. Backoffs take input on success and failure, then return a duration to wait.

For an adaptive backoff, as the failure and success calls increase the returned duration eventually converges on a value to avoid rate limiting of requests.

Usage

Include within your Cargo.toml:

adaptive_backoff = "0.2"

And follow an example below:

Adaptive ExponentialBackoff

Below is an example of an adapative ExponentialBackoff which works from a queue and converges on a minimal delay duration between calls. It grows by a factor of 2.0 to a maximum of 300 seconds.

use std::time::Duration;
use adaptive_backoff::prelude::*;

let mut backoff = ExponentialBackoffBuilder::default()
    .factor(2.0)
    .max(Duration::from_secs(300))
    .adaptive()
    .build()
    .unwrap();

while let Some(item) = queue.pop() {
    loop {
        match worker_iter(&conn, &item).await {
            Ok(_) => {
                delay_for(backoff.success()).await;
                break;
            }
            Err(_) => delay_for(backoff.fail()).await,
        }
    }
}

Simple ExponentialBackoff

If adaptive is omitted from the example above, a simple backoff is returned. Its API lacks success() and fail(), instead it can only return increasing delays with wait() until reset() is called to return it.

use std::time::Duration;
use adaptive_backoff::prelude::*;

let mut backoff = ExponentialBackoffBuilder::default()
    .factor(2.0)
    .max(Duration::from_secs(30))
    .build()
    .unwrap();

while let Some(item) = queue.pop() {
    loop {
        match worker_iter(&conn, &item).await {
            Ok(_) => {
                delay_for(backoff.wait()).await;
                break;
            }
            Err(_) => delay_for(backoff.wait()).await,
        }
    }

    backoff.reset();
}

Additional Examples

There are tests for backoff implementations which contain example use of the external API with expected output. See both the simple exponential example and the adaptive exponential backoff example.

Dependencies

~0.4–1MB
~20K SLoC