<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Traffic-Control on Pi Stack</title>
    <link>https://www.pistack.xyz/tags/traffic-control/</link>
    <description>Recent content in Traffic-Control on Pi Stack</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Mon, 01 Jun 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://www.pistack.xyz/tags/traffic-control/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Linux Traffic Control Filter Classifiers: tc-u32 vs tc-flower vs tc-bpf</title>
      <link>https://www.pistack.xyz/posts/2026-06-01-linux-tc-filter-classifiers-u32-flower-bpf-guide/</link>
      <pubDate>Mon, 01 Jun 2026 00:00:00 +0000</pubDate>
      <guid>https://www.pistack.xyz/posts/2026-06-01-linux-tc-filter-classifiers-u32-flower-bpf-guide/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;&#xA;&lt;p&gt;Linux traffic control (&lt;code&gt;tc&lt;/code&gt;) is the kernel&amp;rsquo;s Swiss Army knife for packet scheduling, shaping, and classification. At its core, &lt;code&gt;tc&lt;/code&gt; uses classifiers (filters) attached to queuing disciplines (qdiscs) to match packets and direct them to the correct queue. Choosing the right classifier determines both the accuracy of your traffic shaping and the CPU cost per packet.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
