<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>消息队列 on  zengchengjie</title>
    <link>https://blog.zengchengjie.site/tags/%E6%B6%88%E6%81%AF%E9%98%9F%E5%88%97/</link>
    <description>Recent content in 消息队列 on  zengchengjie</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 26 Feb 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://blog.zengchengjie.site/tags/%E6%B6%88%E6%81%AF%E9%98%9F%E5%88%97/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>消息队列：RabbitMQ</title>
      <link>https://blog.zengchengjie.site/post/%E5%AD%98%E5%82%A8/%E6%B6%88%E6%81%AF%E9%98%9F%E5%88%97rabbitmq/</link>
      <pubDate>Sat, 26 Feb 2022 00:00:00 +0000</pubDate>
      
      <guid>https://blog.zengchengjie.site/post/%E5%AD%98%E5%82%A8/%E6%B6%88%E6%81%AF%E9%98%9F%E5%88%97rabbitmq/</guid>
      <description>消息队列：RabbitMQ 前言 在现代分布式系统中，消息队列（Message Queue）已经成为不可或缺的基础组件。它像是一个可靠的“邮局”，</description>
    </item>
    
    <item>
      <title>消息队列：RocketMQ</title>
      <link>https://blog.zengchengjie.site/post/%E5%AD%98%E5%82%A8/%E6%B6%88%E6%81%AF%E9%98%9F%E5%88%97rocketmq/</link>
      <pubDate>Fri, 25 Feb 2022 00:00:00 +0000</pubDate>
      
      <guid>https://blog.zengchengjie.site/post/%E5%AD%98%E5%82%A8/%E6%B6%88%E6%81%AF%E9%98%9F%E5%88%97rocketmq/</guid>
      <description>消息队列深度实践：RocketMQ 原理剖析、生产部署与避坑指南 1. 为什么是RocketMQ？ 在分布式系统日益复杂的今天，消息队列（MQ）已经不</description>
    </item>
    
    <item>
      <title>消息队列：Kafka</title>
      <link>https://blog.zengchengjie.site/post/%E5%AD%98%E5%82%A8/kafka%E4%BD%BF%E7%94%A8%E8%AE%B0%E5%BD%95/</link>
      <pubDate>Wed, 24 Feb 2021 00:00:00 +0000</pubDate>
      
      <guid>https://blog.zengchengjie.site/post/%E5%AD%98%E5%82%A8/kafka%E4%BD%BF%E7%94%A8%E8%AE%B0%E5%BD%95/</guid>
      <description>消息队列：Kafka 完全指南 引言 你是否曾在系统流量高峰时感到焦虑？当用户请求如潮水般涌来，后端服务不堪重负，你是否想过有一种方式可以让系统从</description>
    </item>
    
  </channel>
</rss>
