<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Latency on Vinh Pham</title><link>https://vinhdata.com/tags/latency/</link><description>Recent content in Latency on Vinh Pham</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>Vinh Pham</copyright><lastBuildDate>Tue, 13 Oct 2026 10:01:00 +0700</lastBuildDate><atom:link href="https://vinhdata.com/tags/latency/index.xml" rel="self" type="application/rss+xml"/><item><title>Where slow comes from: four delays, the queue and the narrowest link</title><link>https://vinhdata.com/writing/2026/networking-foundations-1-where-slow-comes-from/</link><pubDate>Tue, 13 Oct 2026 10:01:00 +0700</pubDate><guid>https://vinhdata.com/writing/2026/networking-foundations-1-where-slow-comes-from/</guid><description>Every hop charges four delays, and distance sets a floor that no faster link lowers. A queue grows sharply near full load, a copy runs at its narrowest link, and a traceroute shows which of these you pay. Part 1.</description></item></channel></rss>