Struct Faults 

pub struct Faults {
    pub loss: f64,
    pub duplicate: f64,
    pub latency: Duration,
    pub jitter: Duration,
}

What the link does to the traffic crossing it.

All zero by default: a link with no faults is a wire, and a test that wants one should not have to say so.

Fields

loss: f64

Probability in 0.0..=1.0 that a datagram is dropped outright.

duplicate: f64

Probability that a datagram is delivered twice.

Worth having as its own knob rather than folding into loss: a duplicate is what makes a receiver’s idempotence testable, and RFC 3261 §17 is largely about absorbing them.

latency: Duration

The base one-way delay.

jitter: Duration

How much the delay varies, uniformly, either side of latency.

This is also where reordering comes from, and deliberately so: packets do not overtake each other because a network chose to reorder them, they overtake because one took longer than another. A separate “reorder” probability would model the symptom instead of the cause, and would let a test see an ordering no real path could produce.

Implementations

impl Faults

pub fn losing(loss: f64) -> Self

A link that loses this fraction of datagrams and nothing else.

pub fn delayed(latency: Duration) -> Self

A link that drops nothing but takes this long.

Trait Implementations

impl Clone for Faults

fn clone(&self) -> Faults

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Faults

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

Formats the value using the given formatter.

impl Default for Faults

fn default() -> Faults

Returns the “default value” for a type.

impl Copy for Faults