Vlad Krasnov
Vlad Krasnov
Currently the only way to modify a peer is to remove it, and then add again with new config.
Need a way to work on the 32bit part, as 521 is kinda awkward in this regard, because number of limbs in 32 bit mode is not double that of...
This change makes it easier to reuse the P384 code which is quite generic already. No algorithmic changes are made, only some code is shuffled around. This prepares the ground...
In my test setup using zero copy send with a buffer pool improves send performance by over 5%.
This change adds a basic dynamic table support for QPACK decoder. It only implements the table without the blocking. Still in many cases it allows for much better compression than...
A BufFactory can override the generic buffer generation method with a custom method, eg. getting a buffer from a pool buffer.
This is a significant change that replaces most of the congestion and recovery control implementation with an implementation that mostly ports the one from google/quiche. IMHO The change nicely breaks...
Currently to find the correct bucket the code has to iterate over the buckets in order under a RWLock. This however takes some time and creates lock contention in heavily...
For example if I want to flamegraph the last 30seconds of a program, but I don’t know how long it ran exactly. Perhaps can provide negative values to from and...
This change replaces the CC and pacing algorithms using the C++ google/quiche implementations rewritten in Rust. In addition it improves on the general recovery as well. This is essentially the...