<?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>消息 on Plbear | 后端架构 · AI工程 · 云原生技术博客</title><link>https://www.plbear.com/tags/%E6%B6%88%E6%81%AF/</link><description>Recent content in 消息 on Plbear | 后端架构 · AI工程 · 云原生技术博客</description><generator>Hugo</generator><language>zh-cn</language><lastBuildDate>Wed, 24 Jan 2024 09:00:00 +0800</lastBuildDate><atom:link href="https://www.plbear.com/tags/%E6%B6%88%E6%81%AF/index.xml" rel="self" type="application/rss+xml"/><item><title>消息幂等与顺序：MQ 场景的两道必考题</title><link>https://www.plbear.com/posts/2024-01-24-mq-idempotency-order/</link><pubDate>Wed, 24 Jan 2024 09:00:00 +0800</pubDate><guid>https://www.plbear.com/posts/2024-01-24-mq-idempotency-order/</guid><description>MQ 的 at-least-once 投递意味着重复是常态。幂等三方案 + 顺序三场景，把消息系统的两个经典难题一次讲透，附生产代码。</description></item></channel></rss>