<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Epidemic on Mi&amp;Bee Blog</title><link>https://blog.mickeyzzc.tech/en/tags/epidemic/</link><description>Recent content in Epidemic on Mi&amp;Bee Blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><managingEditor>蓝宝石的傻话</managingEditor><lastBuildDate>Tue, 07 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://blog.mickeyzzc.tech/en/tags/epidemic/rss.xml" rel="self" type="application/rss+xml"/><item><title>Gossip Protocol Core Principles</title><link>https://blog.mickeyzzc.tech/en/posts/network/gossip-protocol-theory/</link><pubDate>Tue, 07 Jul 2026 00:00:00 +0000</pubDate><guid>https://blog.mickeyzzc.tech/en/posts/network/gossip-protocol-theory/</guid><description>&lt;p&gt;In P2P networks, every node needs to learn the global cluster state—which peers are online, where data is stored, and whether new nodes have joined or old ones left—without relying on any central server. The essence of this problem is: &lt;strong&gt;how can information be disseminated efficiently and reliably across an unpredictable, dynamic network?&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;Gossip protocol (also called Epidemic protocol) offers an elegant answer: mimic the spread pattern of infectious diseases. Each node randomly selects several neighbors and exchanges the information it knows. The message spreads like a virus, eventually reaching all nodes with high probability. It requires no centralized coordinator and has natural tolerance for network partitions and node failures.&lt;/p&gt;</description></item></channel></rss>