<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Retries on Nalar</title>
    <link>https://nalar.dev/tags/retries/</link>
    <description>Recent content in Retries on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 01 Sep 2026 00:00:00 +0700</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/retries/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Exponential Backoff with Jitter in Go</title>
      <link>https://nalar.dev/exponential-backoff-jitter-go/</link>
      <pubDate>Tue, 01 Sep 2026 00:00:00 +0700</pubDate>
      <guid>https://nalar.dev/exponential-backoff-jitter-go/</guid>
      <description>&lt;p&gt;Retries can make distributed systems more resilient, but immediate retries can also make an outage worse. If thousands of clients retry at the same moment, a recovering dependency receives another synchronized burst of traffic before it has time to stabilize.&lt;/p&gt;&#xA;&lt;p&gt;A common solution is exponential backoff with jitter: increase the maximum delay after each failure, then randomize the actual wait. This article builds that pattern with Go&amp;rsquo;s standard library and shows where retry logic belongs—and where it does not.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
