<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Token on Aaron&#39;s Worthless Words</title>
    <link>https://a996c8ee.aww-3cz.pages.dev/tags/token/</link>
    <description>Recent content in Token on Aaron&#39;s Worthless Words</description>
    <generator>Hugo</generator>
    <language>en</language>
    <lastBuildDate>Thu, 12 Jan 2023 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://a996c8ee.aww-3cz.pages.dev/tags/token/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Using Pynetbox to Create Netbox API Tokens</title>
      <link>https://a996c8ee.aww-3cz.pages.dev/posts/2023/01/using-pynetbox-to-create-netbox-api-tokens/</link>
      <pubDate>Thu, 12 Jan 2023 00:00:00 +0000</pubDate>
      <guid>https://a996c8ee.aww-3cz.pages.dev/posts/2023/01/using-pynetbox-to-create-netbox-api-tokens/</guid>
      <description>&lt;p&gt;As a warning to everyone, I am not a developer. I am a network engineer who is trying to do some automation stuff. Some of what I&amp;rsquo;m doing sounds logical to me, but I would not trust my own opinions for production work. I&amp;rsquo;m sure you can find a &lt;a href=&#34;https://netdev.chat/&#34;&gt;Slack channel&lt;/a&gt; or &lt;a href=&#34;https://infosec.exchange/explore&#34;&gt;Mastodon instance&lt;/a&gt; with people who can tell you how to do things properly.&lt;/p&gt;&#xA;&lt;p&gt;&lt;a href=&#34;https://aconaway.com/2022/12/11/querying-netbox-with-pynetbox/&#34;&gt;The last time&lt;/a&gt;, I talked about using &lt;a href=&#34;https://github.com/netbox-community/pynetbox&#34;&gt;pynetbox&lt;/a&gt; to make queries to &lt;a href=&#34;https://github.com/netbox-community/netbox&#34;&gt;Netbox&lt;/a&gt;. This was a very simple example, and one of the things that bugged me the most about it was the &lt;a href=&#34;https://docs.netbox.dev/en/stable/integrations/rest-api/#tokens&#34;&gt;API token&lt;/a&gt;. In that post, we used a statically-assigned API token where I went into the Netbox GUI and generated one for myself. I think I may have even noted that this was definitely not the best way to handle those things. A possibly-better way to do it is to use your username and password on Netbox to generate a token for yourself. This would a token that you then delete when you&amp;rsquo;re done.&lt;/p&gt;</description>
    </item>
    <item>
      <title>ONT Notes - Congestion Avoidance, Policing, Shaping, and Link Efficiency</title>
      <link>https://a996c8ee.aww-3cz.pages.dev/posts/2010/02/ont-notes-congestion-avoidance-policing-shaping-and-link-efficiency/</link>
      <pubDate>Wed, 03 Feb 2010 00:00:00 +0000</pubDate>
      <guid>https://a996c8ee.aww-3cz.pages.dev/posts/2010/02/ont-notes-congestion-avoidance-policing-shaping-and-link-efficiency/</guid>
      <description>&lt;ul&gt;&#xA;&lt;li&gt;Tail drop drawbacks&#xA;&lt;ul&gt;&#xA;&lt;li&gt;TCP synchronization - Dropping TCP packets from different flows can cause them all to window down and back up again at the same time in cycles.&lt;/li&gt;&#xA;&lt;li&gt;TCP starvation - Non-TCP or aggressive flows can starve everyone else out when TCP throttles back.&lt;/li&gt;&#xA;&lt;li&gt;No differentiated drop - Tail drop doesn&amp;rsquo;t care who you are, so you get dropped if the queue is full.&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;RED - Random Early Detection&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Avoids tail drop by randomly dropping packets from the queue before it gets full&lt;/li&gt;&#xA;&lt;li&gt;Only dropped TCP flows slow down instead of everyone who has sent a packet since the queue filled&lt;/li&gt;&#xA;&lt;li&gt;Queues are smaller.&lt;/li&gt;&#xA;&lt;li&gt;Link utilization is more efficient&lt;/li&gt;&#xA;&lt;li&gt;Configured with&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Minimum threshold - start dropping when the queue is this size&lt;/li&gt;&#xA;&lt;li&gt;Maximum threshold - if the queue is this big, start tail dropping&lt;/li&gt;&#xA;&lt;li&gt;Mark probability denominator (MPD) - 1/MPD is the ratio of packets to drop when between the thresholds&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;WRED - Weighted RED&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Based on IP precedence or DSCP values&lt;/li&gt;&#xA;&lt;li&gt;Less-important packets are dropped more aggressively than important packets&lt;/li&gt;&#xA;&lt;li&gt;Applied to an interface, VC or a class within a policy map&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;CBWRED - Class based WRED&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Configured with CBWFQ&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Policing&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Limits subrate bandwidth (give you 100kbps on a T1)&lt;/li&gt;&#xA;&lt;li&gt;Limits traffic of certain applications&lt;/li&gt;&#xA;&lt;li&gt;Any traffic that exceeds police is dropped or re-classified; it&amp;rsquo;s a hard limit&lt;/li&gt;&#xA;&lt;li&gt;Inbound or outbound&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Shaping&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Sets a limit but buffers any in excess&lt;/li&gt;&#xA;&lt;li&gt;Requires memory to store the buffer&lt;/li&gt;&#xA;&lt;li&gt;Buffers = delay and/or jitter&lt;/li&gt;&#xA;&lt;li&gt;Outbound only&lt;/li&gt;&#xA;&lt;li&gt;Can respond to network signals like BECNs and FECNs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Token and bucket&#xA;&lt;ul&gt;&#xA;&lt;li&gt;The queue is a bucket; if a byte of data needs to be sent, it needs a token.&lt;/li&gt;&#xA;&lt;li&gt;If there are enough tokens, the traffic is considered conforming.&lt;/li&gt;&#xA;&lt;li&gt;If there aren&amp;rsquo;t enough tokens, the traffic is considered exceeding, which triggers the drop (policing), re-classify (policing), or buffer (shaping).&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Frame relay traffic shaping (FRTS)&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Only controls frame relay traffic&lt;/li&gt;&#xA;&lt;li&gt;Applied on subif or DLCI&lt;/li&gt;&#xA;&lt;li&gt;Support fragmentation and interleaving&lt;/li&gt;&#xA;&lt;li&gt;Reacts to FECNs and BECNs&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Compression&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Removed redundancy and patterns in data&lt;/li&gt;&#xA;&lt;li&gt;Less data = less latency&lt;/li&gt;&#xA;&lt;li&gt;Hardware compression or hardware-assisted compression does not involve the main CPU&lt;/li&gt;&#xA;&lt;li&gt;Software compression does&lt;/li&gt;&#xA;&lt;li&gt;Payload compression&lt;/li&gt;&#xA;&lt;li&gt;Header compression&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;li&gt;Link fragmentation and interleaving&#xA;&lt;ul&gt;&#xA;&lt;li&gt;Small data might be waiting for larger data pieces to finish sending&lt;/li&gt;&#xA;&lt;li&gt;Chunks data into smaller fragments so they don&amp;rsquo;t have to wait&lt;/li&gt;&#xA;&lt;li&gt;Interleaving shuffles flows in the Tx queue&lt;/li&gt;&#xA;&lt;/ul&gt;&#xA;&lt;/li&gt;&#xA;&lt;/ul&gt;</description>
    </item>
  </channel>
</rss>
