lists.openwall.net   lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  linux-cve-announce  PHC 
Open Source and information security mailing list archives
 
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <387b6b6e-3813-60b1-51f2-33ce45aeaf47@gmail.com>
Date:   Wed, 2 Feb 2022 20:47:34 -0700
From:   David Ahern <dsahern@...il.com>
To:     Justin Iurman <justin.iurman@...ege.be>, netdev@...r.kernel.org
Cc:     davem@...emloft.net, kuba@...nel.org, yoshfuji@...ux-ipv6.org,
        dsahern@...nel.org
Subject: Re: [PATCH net-next v2 0/2] Support for the IOAM insertion frequency

On 2/2/22 7:25 AM, Justin Iurman wrote:
> v2:
>  - signed -> unsigned (for "k" and "n")
>  - keep binary compatibility by moving "k" and "n" at the end of uapi
> 
> The insertion frequency is represented as "k/n", meaning IOAM will be
> added to {k} packets over {n} packets, with 0 < k <= n and 1 <= {k,n} <=
> 1000000. Therefore, it provides the following percentages of insertion
> frequency: [0.0001% (min) ... 100% (max)].
> 
> Not only this solution allows an operator to apply dynamic frequencies
> based on the current traffic load, but it also provides some
> flexibility, i.e., by distinguishing similar cases (e.g., "1/2" and
> "2/4").
> 
> "1/2" = Y N Y N Y N Y N ...
> "2/4" = Y Y N N Y Y N N ...
> 

what's the thought process behind this kind of sampling? K consecutive
packets in a row with the trace; N-K consecutive packets without it.

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ