<?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 Vinh Pham</title><link>https://vinhdata.com/tags/networking/</link><description>Recent content in Networking on Vinh Pham</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>Vinh Pham</copyright><lastBuildDate>Tue, 13 Oct 2026 10:08:00 +0700</lastBuildDate><atom:link href="https://vinhdata.com/tags/networking/index.xml" rel="self" type="application/rss+xml"/><item><title>Securing the path: keys, certificates, TLS, IPsec and firewalls</title><link>https://vinhdata.com/writing/2026/networking-foundations-8-securing-the-path/</link><pubDate>Tue, 13 Oct 2026 10:08:00 +0700</pubDate><guid>https://vinhdata.com/writing/2026/networking-foundations-8-securing-the-path/</guid><description>Every router on the path can read, change or replay a packet. TLS seals one connection after a certificate proves the server&amp;rsquo;s name, IPsec seals everything between two networks, and a firewall decides who may start a connection. Part 8.</description></item><item><title>One link at a time: frames, ARP, switches and the data center</title><link>https://vinhdata.com/writing/2026/networking-foundations-6-the-link-and-the-data-center/</link><pubDate>Tue, 13 Oct 2026 10:06:00 +0700</pubDate><guid>https://vinhdata.com/writing/2026/networking-foundations-6-the-link-and-the-data-center/</guid><description>IP picks the next router; the link carries the packet there in a frame addressed to a MAC. ARP finds that address, a switch learns where it lives, and a data center connects many equal paths. Part 6.</description></item><item><title>Routes between networks: BGP, route selection and ICMP</title><link>https://vinhdata.com/writing/2026/networking-foundations-5-routes-between-networks/</link><pubDate>Tue, 13 Oct 2026 10:05:00 +0700</pubDate><guid>https://vinhdata.com/writing/2026/networking-foundations-5-routes-between-networks/</guid><description>Nobody types the route from one network to another. Routers announce prefixes with the path they took, pick by policy before path length, and use ICMP to say what went wrong. Part 5.</description></item><item><title>Addresses, routes and NAT: what a router does to a packet</title><link>https://vinhdata.com/writing/2026/networking-foundations-4-addresses-routes-and-nat/</link><pubDate>Tue, 13 Oct 2026 10:04:00 +0700</pubDate><guid>https://vinhdata.com/writing/2026/networking-foundations-4-addresses-routes-and-nat/</guid><description>A router reads one address, takes the longest matching row of its table, lowers the TTL and sends the packet on. Subnets, DHCP and NAT decide which addresses it carries. Part 4.</description></item><item><title>TCP, the connection: handshake, numbers, losses and windows</title><link>https://vinhdata.com/writing/2026/networking-foundations-3-tcp-the-connection/</link><pubDate>Tue, 13 Oct 2026 10:03:00 +0700</pubDate><guid>https://vinhdata.com/writing/2026/networking-foundations-3-tcp-the-connection/</guid><description>TCP numbers every byte and resends what is not acknowledged, so a network that loses packets still carries one ordered stream. How fast that stream runs over a long path is at most the smaller of two windows divided by the round-trip time. Part 3.</description></item><item><title>Names, ports and requests: DNS and HTTP before the first byte</title><link>https://vinhdata.com/writing/2026/networking-foundations-2-names-ports-and-requests/</link><pubDate>Tue, 13 Oct 2026 10:02:00 +0700</pubDate><guid>https://vinhdata.com/writing/2026/networking-foundations-2-names-ports-and-requests/</guid><description>Before an API call returns its first byte, a resolver turns the name into an address, a socket opens on a port, and HTTP sends a request. Every new connection costs round trips that a kept connection and a cache save. Part 2.</description></item><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>