<?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>P2c on wid's blog</title><link>https://wid-blog.github.io/tags/p2c/</link><description>Recent content in P2c on wid's blog</description><generator>Hugo</generator><language>ko</language><lastBuildDate>Sat, 13 Jun 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://wid-blog.github.io/tags/p2c/index.xml" rel="self" type="application/rss+xml"/><item><title>로드밸런싱 알고리즘 — Round Robin에서 LOR까지</title><link>https://wid-blog.github.io/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/posts/tech/network/load-balancing-rr-to-lor/</guid><description>Round Robin과 Least Connection은 오래 로드밸런서의 기본이었다. 그런데 Envoy, AWS ALB 같은 최신 로드밸런서가 핵심 옵션으로 들고 온 알고리즘은 Least Outstanding Requests이고, 그 실용 구현은 Power of Two Choices다. 분배 결정의 단위가 connection에서 request로 세분화된 진화 경로를 정리한다.</description></item></channel></rss>