aboutsummaryrefslogtreecommitdiffstats
Commit message (Expand)AuthorAgeFilesLines
* Lead pure-serve's usage with pure:// between nodes, and count refusalseunhhu2026-09-292-8/+12
* Serve documents when a module keeps a collection, not by its inputs' nameseunhhu2026-09-292-2/+35
* Tick a stateless app's timers, and wait for them on the monotonic clockeunhhu2026-09-294-13/+74
* Refuse a module whose output names its fields otherwise while sends waiteunhhu2026-09-293-21/+86
* Hold an app uncertain whatever its save changed, not only a listeunhhu2026-09-292-6/+42
* Keep a walk's range only when its body moves no state its bound readseunhhu2026-09-294-4/+188
* Let ngtcp2's handshake through a path that reorderseunhhu2026-09-291-1/+8
* Put ngtcp2 beside quinn in M6, as it is in M5eunhhu2026-09-292-66/+210
* Remember the epoch of each of a peer's runs that send, not oneeunhhu2026-09-294-55/+158
* Specify the link (012) and make it the default between nodes (011)eunhhu2026-09-295-6/+354
* Link a node to a receiver written from the spec aloneeunhhu2026-09-291-0/+224
* Say why a stream is refused (REFUSED), and try it again seldomeunhhu2026-09-296-25/+289
* Give each of a peer's runs a place, however many send at onceeunhhu2026-09-292-12/+122
* Take no send larger than a receiver holds: 16 MiB, not 64eunhhu2026-09-293-5/+69
* Say how the four limits left went: three solved, one measured away (101)eunhhu2026-09-293-1/+153
* Put ngtcp2 beside quinn in M5, as the design plannedeunhhu2026-09-294-0/+505
* Put records that come in order straight onto the line, a frame at onceeunhhu2026-09-291-1/+13
* Say LOST when a run's epoch is not known, and let its sender begin again at onceeunhhu2026-09-294-34/+154
* See a path that stops carrying larger datagrams, and go back to the first sizeeunhhu2026-09-293-16/+54
* Say what a small record costs a link now, beside quinn in the same rounds (09...eunhhu2026-09-292-2/+10
* Cut what a small record costs a link: no division a record, no walk a deliveryeunhhu2026-09-292-20/+36
* Say that a receiver moved to another machine is followed, and how (100)eunhhu2026-09-293-0/+134
* Move M2's node to another machine under load (M3's harness)eunhhu2026-09-292-11/+88
* Look for a link's receiver at once when the system says it cannot get thereeunhhu2026-09-291-3/+16
* Look for a link's receiver again when its probes go unansweredeunhhu2026-09-294-26/+205
* Answer a link's packet from the address it came toeunhhu2026-09-292-17/+62
* Keep a sender's congestion state as one, so an episode undoes it wholeeunhhu2026-09-292-56/+53
* Hold each epoch of a run as one thing: its number, secret and keyseunhhu2026-09-291-127/+112
* Begin an epoch only from the answer to this offer, not an earlier oneeunhhu2026-09-293-20/+52
* Say what epochs cost a link, and what the search for it found (099)eunhhu2026-09-297-3/+313
* Move a link to a new epoch now and then, so keys that leak later open nothing...eunhhu2026-09-295-71/+568
* Give M2's devices a timer each, and say when the slow records were madeeunhhu2026-09-291-7/+34
* Send no packet only to probe the path or say a challenge backeunhhu2026-09-292-14/+24
* Let links make an X25519 pair for once, and agree with iteunhhu2026-09-294-2/+48
* Say what an attacker on the path could do to a link, and what now stops it (098)eunhhu2026-09-293-3/+119
* Close what an attacker on the path could do to a link, each checkedeunhhu2026-09-293-49/+412
* Never let a zero RTT make a link's pace infiniteeunhhu2026-09-291-2/+6
* Measure a link on paths of loss, reordering and a bottleneck, against quinn (...eunhhu2026-09-294-1/+344
* Let M6's path waver by 1 ms when flows share it, and count from 20 s of 60eunhhu2026-09-291-6/+9
* Keep Reno's pace at 0.53 datagrams an RTT, as deployed CUBIC doeseunhhu2026-09-291-6/+8
* Pace a link's packets, and keep Reno's pace by time as well as by acknowledgm...eunhhu2026-09-291-0/+30
* Record one round of M6 with the path's MTU found, before pacing (020)eunhhu2026-09-291-0/+42
* Let the M6 simulator queue records at a rate and time each oneeunhhu2026-09-291-5/+33
* Start M6's flows together, each a process, and count their shares from 10 seunhhu2026-09-291-26/+63
* Find how large a packet the path carries: 1,452 bytes once a probe is acknowl...eunhhu2026-09-296-44/+118
* Record M6 with records in parts and no path MTU yet (020)eunhhu2026-09-291-0/+126
* Queue only the way to the receivers behind M6's bottleneckeunhhu2026-09-292-18/+30
* Send a record in parts cut where a packet is full, not 1000-byte pieceseunhhu2026-09-292-129/+246
* Apply a link's records in transport.c as a host doeseunhhu2026-09-291-11/+20
* Measure a link on a path of loss, reordering and a bottleneck (M6 harness)eunhhu2026-09-295-33/+382
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 14:28:44 +0000