<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Round-Robin on wid's blog</title><link>https://wid-blog.github.io/en/tags/round-robin/</link><description>Recent content in Round-Robin on wid's blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Sat, 13 Jun 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://wid-blog.github.io/en/tags/round-robin/index.xml" rel="self" type="application/rss+xml"/><item><title>Load Balancing Algorithms — From Round Robin to LOR</title><link>https://wid-blog.github.io/en/posts/tech/network/load-balancing-rr-to-lor/</link><pubDate>Sat, 13 Jun 2026 00:00:00 +0000</pubDate><guid>https://wid-blog.github.io/en/posts/tech/network/load-balancing-rr-to-lor/</guid><description>Round Robin and Least Connection were the standard load balancer choices for years. Yet the core algorithm that modern LBs like Envoy and AWS ALB ship as their headline option is Least Outstanding Requests, and its practical implementation is Power of Two Choices. This post traces the evolution path along which the unit of routing decisions moved from connection to request.</description></item></channel></rss>