Struct Gradient 

pub struct Gradient { /* private fields */ }

Delay-based congestion avoidance.

Additive-increase, multiplicative decrease based on change in average latency.

Considers the difference in average latency between a short time window and a longer window. Changes in these values is considered an indicator of a change in load on the system.

Wrap with a crate::limits::windowed::Windowed to control the short time window, otherwise the latest sample is used.

Inspired by TCP congestion control algorithms using delay gradients.

• Revisiting TCP Congestion Control Using Delay Gradients

Implementations

impl Gradient

pub fn new_with_initial_limit(initial_limit: usize) -> Self

pub fn new(initial_limit: usize, limit_range: RangeInclusive<usize>) -> Self

pub fn with_max_limit(self, max: usize) -> Self

Trait Implementations

impl Debug for Gradient

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl LimitAlgorithm for Gradient

fn limit(&self) -> usize

The current limit.

fn update<'life0, 'async_trait>( &'life0 self, sample: Sample, ) -> Pin<Box<dyn Future<Output = usize> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait,

Update the concurrency limit in response to a new job completion.