On Mon, Nov 12, 2018 at 5:18 PM Dave Taht wrote:
>
> On Mon, Nov 12, 2018 at 5:06 PM Juliusz Chroboczek wrote:
> >
> > >> Yeah, we should just include an implementation of SHA-256 in the code.
> >
> > > There's also the option...
> >
> > Given that the main selling point of HMAC vs. DTLS is that
On Mon, Nov 12, 2018 at 5:06 PM Juliusz Chroboczek wrote:
>
> >> Yeah, we should just include an implementation of SHA-256 in the code.
>
> > There's also the option...
>
> Given that the main selling point of HMAC vs. DTLS is that it has no
> dependencies, it wouldn't be particularly wise to
>> Yeah, we should just include an implementation of SHA-256 in the code.
> There's also the option...
Given that the main selling point of HMAC vs. DTLS is that it has no
dependencies, it wouldn't be particularly wise to make the reference
implementation depend on a Linux-specific library.
Of
Antonin Décimo writes:
>>> I do have one objection to the codebase, in that it pulls in
>>> libgcrypt, ssl, and pthreads... about 5MB? of libs... for two hash
>>> functions.
>>
>> Yeah, we should just include an implementation of SHA-256 in the code.
>
> There's also the option of using the
On Mon, Nov 12, 2018 at 12:49 PM Dave Taht wrote:
>
> Juliusz Chroboczek writes:
>
> +rc = setsockopt(s, SOL_SOCKET, SO_MAX_PACING_RATE, ,
> sizeof(rate));
> >
> >>> It's only effective on TCP sockets, and only when using the FQ scheduler.
> >
> >> I am under the impression that
On Mon, Nov 12, 2018 at 8:18 AM Juliusz Chroboczek wrote:
>
> >> do loop-free routing.
>
> > Hah. :)
>
> > I note that babel doesn't actually do that, any more.
>
> Pick a pair (p, id), where p is a prefix and id is a router id. Consider
> the graph defined by all route table entries indexed by
I'm willing (since I have that whole merge in my head still) - to try
to merge up hmac-challenge if that will help move things along. ?
Well, my take on it was that the hmac codebase was very difficult to
move forward
in its current state and needed a rebase on head for it to move forward. I'm
>> do loop-free routing.
> Hah. :)
> I note that babel doesn't actually do that, any more.
Pick a pair (p, id), where p is a prefix and id is a router id. Consider
the graph defined by all route table entries indexed by (p, id). Then
Babel guarantees that at any time this graph is acyclic.
> +rc = setsockopt(s, SOL_SOCKET, SO_MAX_PACING_RATE, , sizeof(rate));
It's only effective on TCP sockets, and only when using the FQ scheduler.
-- Juliusz
___
Babel-users mailing list
Babel-users@alioth-lists.debian.net
> In looking over the bird patch, it looks like I merged the wrong
> thing.
Yes, it looks like it. hmac-challenge is the right code.
Weronika, perhaps you could rename the branch hmac to something less
exciting?
Dave, please be aware that the HMAC code is not quite finished yet. Once
we got a
Sigh. In looking over the bird patch, it looks like I merged the wrong
thing. Unless challenge is the wrong thing?
https://bird.network.cz/pipermail/bird-users/2018-July/012537.html
Assuming I merged the wrong thing, tell me the right thing, and so
long as I have all teh things I had to do to
So I got around to testing this merge on two boxes this morning. It's
rather noisy when run on a mixed network, but the two boxes I got
running seem to be exchanging routes on
key id key1 type sha1 value deadbeefdeadbeefdeadbeefdeadbeefdeadbeef
default enable-timestamps true hmac key1
I would
Le 12 nov. 2018 06:26, Dave Taht a écrit :
Antonin Décimo writes:
> function types on their own line.
So far, I haven't found a way to make clang-format do
13 matches
Mail list logo
