<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>networking on david@connol.ly</title>
    <link>/blog/networking/</link>
    <description>Recent content in networking on david@connol.ly</description>
    <generator>Hugo</generator>
    <language>en-IE</language>
    <copyright>Copyright © 2026, David Connolly.</copyright>
    <lastBuildDate>Fri, 01 May 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="/blog/networking/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>UDPspeeder, optimised</title>
      <link>/2026/05/udpspeeder.html</link>
      <pubDate>Fri, 01 May 2026 00:00:00 +0000</pubDate>
      <guid>/2026/05/udpspeeder.html</guid>
      <description>&lt;p&gt;A fork of UDPspeeder, an FEC tunnel that masks loss on lossy, high-latency links by sending redundant packets so the receiver can rebuild what gets dropped. The exercise here is to push the per-packet cost towards the theoretical floor: the unavoidable data movement plus the irreducible Reed-Solomon arithmetic, with as little else in between as possible. The hot paths are rewritten with SIMD (x86_64 AVX2/SSE4.2, ARM64 NEON, MIPS, PowerPC e500v2, RISC-V), selected at runtime, with a scalar fallback. On Linux it uses io_uring on receive and GSO batching on send.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
