Benchmarks - NormB/sipnab GitHub Wiki

How fast sipnab is, measured honestly โ€” and what that speed is for. The number is not a race against the local capture tools. It is the headroom that decides how much of an estate one binary can take at once, and therefore whether you stand up a collector tier at all. Every table on this page names the session that measured it. The multi-core and carrier-scale tables come from one session on 2026-09-09. The version A/B further down is 2026-08-10, and its continuation 2026-08-17, each carrying a control of its own.

Every number here is reproducible, and has been a checked claim rather than an asserted one since 0.5.47 โ€” the release that put the corpus generator and the timing harness in bench/, so you can regenerate the corpus and re-run every table below. 0.5.47 dates the recipe, not this run.

Measured against 0.5.160, on 2026-09-09. The multi-core and carrier-scale tables below are that measurement. No number here stands in for a release it did not measure, and none carries forward from a run nobody repeated.

bench/baseline.json commits every figure in those two tables โ€” all three replicates per core count, the peak resident set of each, and the whole carrier-scale sweep. The published figure is the LOWEST replicate rather than the median, so a reader who re-runs the harness meets or beats it instead of falling short of it, and the throughput gate's floor cannot sit above a number this host actually produces.

A raise here and a raise in that file are one event, and a test now says so. They came apart three times while the rule lived in a comment that asked a reader to remember it. The last separation published 3.23M for 0.5.122 while the committed baseline held 3.25M with replicates 3.25/3.29/3.29M โ€” a figure the recorded run never produced, 0.6% adrift, inside this page's own noise floor, which is exactly why no reader caught it. benchmarks_pages_headline_matches_the_committed_baseline binds the baseline to both hand-maintained copies of this page and to the homepage tile.

0.5.118 through 0.5.121 ran materially slower than 0.5.117, and 0.5.122 repaired it. The cause was is_merged, the probe that decides whether a capture is a merged pcapng. It read the ENTIRE file into memory and then rejected it on the first four bytes, so every offline run over an ordinary pcap loaded the whole capture, threw it away, and only then started work. Three call sites run it before the reader touches a packet.

bench/regression-gate.sh exists to catch exactly that and did not, because its baseline still recorded 0.5.104's figure โ€” the drop read as 105% of a baseline four releases stale, so the gate passed while the tool lost a quarter of its throughput. That is the failure its own baseline file warns about in writing: a stale baseline "silently widens the band it advertises". This page's numbers and that file's are now re-measured together or not at all.

The generator reproduces the documented corpus composition exactly: 535,000 packets, 35,000 SIP messages, 500,000 RTP, 93.5% RTP, 100 Call-IDs, 200 streams.

Measured on a local release build of 0.5.160 (4641f323), 2026-09-09, on an idle host โ€” vmstat idle at 98% with no toolchain build running, the gate bench/baseline.json records as its condition for a measurement to count. A local build rather than a published artifact, deliberately: the throughput gate has to catch a regression the day it lands, not once it has shipped, so the number this page publishes is the number that gate measures. Nothing here is comparable to the pre-0.5.47 figures, which came from an unpublished corpus nobody can rebuild.

What the throughput is for

Reach, not a benchmark win. sipnab sits between a local capture tool and a capture platform: many nodes, no infrastructure behind it (the position). Kamailio, OpenSIPS and Asterisk already speak HEP, so they mirror their signaling to one sipnab listener and that single process answers for the whole estate โ€” nothing goes on the production hosts. Throughput is what keeps that arrangement honest. A listener that falls behind the fan-in sends you back to capture agents feeding a collector, which is the deployment project sipnab exists to skip.

Put the figures next to the load. A proxy running 100 calls per second at roughly ten SIP messages per call emits about 1,000 signaling packets per second. The tables below measure 1.05M packets per second on one core and 3.56M on four, on a corpus that is 93.5% RTP โ€” media a signaling-only HEP feed never carries at all. Three orders of magnitude separate that proxy from a single core's budget.

Two limits on the arithmetic, stated here rather than left for a reader to discover:

  • These tables measure offline pcap reconstruction, not the HEP receive path. Read the ratio as a budget with room in it, not as a measured fan-in ceiling.
  • Reconstruction is not the first ceiling a fan-in meets anyway. --hep-rate-limit caps what a listener accepts, and its default sits far below these tables, so size a deployment against that knob rather than against this page.

Test host & method

  • Host: NVIDIA Jetson Thor devboard (aarch64), 14 cores, PREEMPT_RT kernel, idle. (A 4-vCPU VM is not used for throughput numbers.)
  • Corpus: bench/carrier.py โ€” N concurrent calls, each INVITE โ†’ 100 โ†’ 180 โ†’ 200 โ†’ ACK โ†’ [bidirectional RTP] โ†’ BYE โ†’ 200, G.711 PCMU at 20 ms, 93.5% RTP by packet count.
  • Method: offline pcap reconstruction (-I file), median-of-5 after one discarded warmup. pkts/s = packets รท wall-clock seconds, startup included.
  • Version: sipnab 0.5.160, local release build 4641f323. Date: 2026-09-09.
  • Published figure: the LOWEST of three replicates, per core count. bench/baseline.json commits every replicate, so each cell below resolves to a recorded run rather than to a remembered one.

Multi-core offline reconstruction

--cores N shards by host-pair across worker threads. On the 535k-packet fixed-state corpus (100 Call-IDs, 200 streams):

Each row is median-of-5 after a discarded warmup, three replicates, on one idle host. The published column is the lowest replicate. The spread column carries all three, so a reader sees the noise rather than taking the word for it.

cores pkts/s replicates peak RSS
1 1.05M 1.07 / 1.06 / 1.05M 168.2 MiB
2 2.63M 2.63 / 2.64 / 2.64M 100.5 MiB
4 3.56M 3.62 / 3.61 / 3.56M 97.5 MiB
8 3.13M 3.14 / 3.13 / 3.15M 101.2 MiB

Four cores is the peak, and eight is slower โ€” in every replicate, not in one bad run. The single-core row is the outlier in memory as well as in speed: --cores 1 and a run with no --cores use the single-threaded reader, which goes through libpcap and holds more of the capture at once. Only --cores 2 and above reach the mapped reader.

The 4-core cell is the figure bench/baseline.json commits and bench/regression-gate.sh measures against nightly. It is the same number in both places because a test refuses any commit where it is not.

0.5.108 raised the multi-core ceiling by removing a read. The --cores path is one serial thread reading, copying and host-pair-peeking every packet while N workers wait, and reading through libpcap charged that thread a read into libpcap's buffer and a copy out of it. 0.5.108 maps the capture file instead, so it parses records in place out of page cache and copies only the frame.

That moves where the curve stops, and the mechanism is why one and two cores do not move with it: --cores 1 and a run with no --cores use the single-threaded reader, which still goes through libpcap. Only --cores 2 and above reach the mapped reader, and nothing needs unblocking until enough workers pile up behind it.

The A/B that measured this is not on this page, and this page drops the sentences that used to quote its spread and its per-core gaps rather than carrying them forward. They described a 2026-08-17 session whose table was never published here, so a reader had no way to check them โ€” which is the same defect as a stale number, wearing the shape of a measurement it cannot produce. What survives is the mechanism, which the code and docs/internals/zero-copy-payloads.md record, and the table above, which measures where the curve actually stops on the current release: four cores is the peak and eight is slower.

The obvious version of that change is a regression, which is worth stating on a page about honest measurement: handing each frame out as a refcounted slice of the mapping, copying nothing at all, measures 1.88M at four cores โ€” well under libpcap. One mapping is one atomic refcount, and 535k frames cloned by the reader and dropped by the workers drive ~1M atomic updates through a single cache line. docs/internals/zero-copy-payloads.md records the failed hypotheses in full.

Is the packet path still what it was at 0.5.47?

No โ€” it is faster. Throughput fell 40% in 0.5.84 and held that loss for four releases. 0.5.89 recovered part of it, and 0.5.91 went past where it started.

Both artifacts checksum-verified, identical corpus, same idle host, same session, interleaved replicates so drift in the host cannot masquerade as a difference between versions:

cores 0.5.47 0.5.88 0.5.89 0.5.91 0.5.91 vs 0.5.47
1 1.06M 0.91M 0.96M 1.07M +1%
2 2.27M 1.39M 1.69M 2.21M โˆ’3%
4 2.02M 1.33M 1.90M 2.32M +15%
8 1.91M 1.29M 1.73M 2.13M +12%

Within-version spread is ~2% and the 0.5.47 โ†’ 0.5.88 gap is ~39%, so that gap is roughly eighteen times the noise floor. In the same runs an unrelated third-party binary measured identically in both arms โ€” a different program, same corpus, same afternoon, that did not move. That is what rules out the host.

What it was. 0.5.84 added a frame-provenance stamp that fixed a real bug: the parallel reader was silently dropping frame pointers on exactly the large captures where provenance matters most. But it computed the digest on the serial reader, the one stage the whole --cores design waits on โ€” a single thread reads, copies and host-pair-peeks every packet while N workers sit idle. This page had already named that stage as the plateau past two cores. Hashing there charged it ~240 bytes of dependent FNV multiplies per packet, which over this corpus is arithmetic rather than a measurement: 535,000 packets ร— ~240 bytes โ‰ˆ 128 MB hashed one byte at a time.

What 0.5.89 did. The workers compute the digest. The reader still assigns the ordinal, the one fact only it can know. Same input, same FNV-1a, same value โ€” a pointer from a --cores run resolves identically to one from a single-threaded run, and pointers already written down still resolve. Because the work now scales with worker count, the recovery does too: ~81% of the loss at four cores, ~34% at two. Four cores is within 6% of 0.5.47.

What 0.5.91 did, and why it overshot. Two more changes, both from the same profile. parse_packet stopped building a FrameRef per packet โ€” a FrameRef owns an Arc<str>, so each one cost an atomic pair for a pointer ~93% of frames never keep. The reader also stopped allocating each frame separately: it now cuts them from a shared 64 KiB block, so the allocator's cross-thread free path runs once per ~270 frames instead of once per frame.

Together those put four-core throughput above where it was before the regression โ€” 2.32M against 0.5.47's 2.02M. The second change even beat its own predicted ceiling, because frames sharing a block are also sequential in memory, which a diagnostic that scattered them into an arena could not show.

What the tables above still carried, and what closed after them. Every build these tables measure hashes every frame, when only a retained pointer needs a digest โ€” a dialog's first_frame, a stream's first_frame, a finding's frame_ref โ€” about 35,000 of 535,000 frames on this corpus. PERF1 in docs/design/backlog.md closed that on 2026-08-28, and records the measurement it closed on: two release builds off one tree differing only in this change, same harness and corpus, 2.70M at two cores against 2.10M and 3.56M at four against 3.21M. The multi-core table at the top of this page now reflects it, and independently reproduces its four-core figure to the digit: 3.56M, measured twelve days later on 0.5.160 on the same host and corpus.

What stays open. A diagnostic build with the digest removed entirely measures 2.05M at two cores against 0.5.83's 2.33M, so roughly 12% of the original regression was never the digest at all and remains unidentified. The same PERF1 entry carries that residue, together with the two obvious fixes and the tests that already reject each.

Scope. The table above spans 0.5.47 โ†’ 0.5.91, measured on 2026-08-10, and its columns say nothing about anything released after. The continuation below is a separate session and is not directly comparable to those columns โ€” the host had drifted ~4% between the two dates, which is exactly why each session carries its own control.

Continued, 2026-08-17: 0.5.103 โ†’ 0.5.104. Both released artifacts, checksum-verified, same idle host, same session:

cores 0.5.103 0.5.104 change
1 1.01M 1.28M +27%
2 2.21M 2.17M โˆ’2%
4 2.29M 2.31M +1%
8 2.13M 2.16M +1%

The single-core gain is 0.5.104's batched file read (the channel hand-off paid per packet on the default path โ€” see the multi-core section above). The 0.5.103 single-core figure also records honestly what happened between 0.5.91 and 0.5.103: a ~4%-of-figure erosion, diffuse across two hundred commits of added analysis, that a profiler could not pin to any single function โ€” found, bounded, and then overtaken by the batching change rather than chased line by line.

CI measures throughput nightly, rather than per push. The Throughput workflow runs bench/regression-gate.sh at 03:29 UTC daily against the figure committed in bench/baseline.json, and fails below a stated floor.

It is nightly on purpose: the reference host is one self-hosted runner that also serves CI, so two jobs on it measure their own contention rather than the tool, and a per-push wall-clock gate would be flaky in the direction that gets a gate muted. It does not catch slow erosion โ€” a drift inside the floor passes. That is a deliberate trade, argued in bench/baseline.json.

The same A/B settles what the pre-0.5.47 tables mean: they measure an unpublished corpus nobody can rebuild, so nothing below them compares to them and this page does not restate them. This paragraph used to carry a single-core figure for 0.5.18 against a figure "this page once published", and neither resolved to a committed record โ€” the older of the two to a corpus that no longer exists, the newer to a session with no table. The claim they supported still holds and is the useful part: the gap between the old tables and these is the corpus, not a regression.

What the throughput includes

A packets-per-second number only means something next to the work behind it, so this is what sipnab is doing while it posts the figures above, on the same 535k-packet corpus:

  • every SIP message parsed into dialogs, with state, timing and PDD
  • all 500,000 RTP packets associated into 200 media streams, each with its codec, jitter, loss and MOS
  • frame pointers minted for anything a report can cite later, so you can resolve a finding back to the captured bytes

That is full reconstruction, not line matching. A tool that only greps SIP text does a fraction of this work, and posts a larger raw number for that reason.

Throughput and memory at carrier scale

The table above is one operating point at fixed dialog state. This sweep grows the state: unique Call-IDs and unique RTP endpoints per call (--call-ids 0 --stream-pairs 0), so dialog and stream tables scale with call volume. Measured at --cores 4:

calls pkts dialogs streams pkts/s peak RSS
500 53.5k 500 1,000 2.19M 29.5 MiB
2,000 214k 2,000 4,000 2.80M 69.2 MiB
8,000 856k 8,000 16,000 3.28M 226.7 MiB
20,000 2.14M 20,000 40,000 3.26M 495.0 MiB

bench/baseline.json commits every row under carrier_scale_sweep, from the same 2026-09-09 session and the same host as the table above.

Honest read: throughput is flat from 8k calls up โ€” reconstruction cost is per-packet, not per-dialog, and 40k concurrent streams do not degrade it. The smaller corpora post lower figures because startup is inside the clock and a 53.5k-packet read is over in ~24 ms. Memory grows close to linearly with tracked state, about 25 KiB per call (dialog + two RTP streams + jitter/loss accounting), reaching 495 MiB at 20k calls. That linearity is the useful property: it is predictable, so capacity planning is arithmetic rather than guesswork.

The mapping does not stay resident: the read hands pages back to the kernel as it passes them, so a capture larger than RAM costs the same working set as a small one. This paragraph used to compare each row against the same sweep on 0.5.104 โ€” a table that has never appeared on this page, so no reader could resolve the comparison, and this page drops it rather than repeating it.

Reproduce

Full instructions, including artifact download and checksum verification, are in bench/README.md. In short โ€” the generator runs first, because both harnesses read the corpus it writes:

# Run all of these, in order.
python3 bench/carrier.py --calls 5000 --out corpus.pcap
bench/scaling.sh "$BIN" corpus.pcap 535000 --cores 1,2,4,8 --runs 5

A single timed run at four cores, with the per-message stream suppressed so only the end-of-run report prints:

sipnab -N -I corpus.pcap --cores 4 --report --no-cli-print
โš ๏ธ **GitHub.com Fallback** โš ๏ธ