0 views collected around this technical thread.
This article revisits RocketMQ's Name Server, detailing its core components, how it registers brokers, maintains routing information, handles client queries, and uses heartbeat mechanisms to ensure high availability and dynamic scaling in distributed messaging systems.
This tutorial explains RocketMQ's delayed message feature, covering its core concepts, implementation using a time‑wheel algorithm, step‑by‑step usage instructions, practical code examples, and important considerations for reliable scheduling in distributed backend systems.
This article explains how RocketMQ implements long‑polling for message consumption, detailing the pull‑based model, the broker and consumer timeout settings, the internal suspension of pull requests, and the processing loop that resumes suspended requests to improve efficiency.
This article examines the three major reliability challenges of message queues—loss, duplicate consumption, and backlog—and provides detailed RocketMQ‑specific strategies, including producer acknowledgment, broker replication, idempotent consumer design, monitoring, scaling, and parameter tuning to ensure high‑availability distributed systems.
This article explains RocketMQ's transactional message mechanism, covering half‑message storage, three transaction states, status‑check procedures, key APIs, storage reliability, and the two‑phase commit process that guarantees eventual consistency in distributed systems.
The article explains how RocketMQ ensures strict message ordering through global FIFO queues and partitioned ordering, covering use cases, key implementation techniques on the producer, broker, and consumer sides, as well as lock mechanisms, retry strategies, and fault‑tolerance design.
This article explains how to generate a unique traceId for each request, propagate it through Rest, RocketMQ, and Dubbo RPC modules, and configure Log4j2 (including custom Message, MessageFactory, and PatternConverter) to output the traceId so that logs across services can be correlated and read sequentially.
This article explains how RocketMQ achieves high availability and data reliability through its master‑slave broker design, covering synchronous and asynchronous replication, flush strategies, transaction messaging, automatic failover with Dledger, and read‑write separation for load balancing in distributed systems.
The article explains how RocketMQ implements distributed transaction messages using a two‑phase commit model to ensure data consistency across micro‑service subsystems, detailing the workflow from half‑message production, broker handling, local transaction execution, commit/rollback decisions, and periodic status checks.
The article explains how to guarantee that messages are processed only once in high‑concurrency environments by combining production‑side idempotent publishing, broker‑level deduplication with unique IDs, and consumption‑side business idempotency such as database constraints or distributed locks, while also recommending monitoring, metrics, and reconciliation as safety nets.
This article explains common causes of duplicate message consumption in high‑traffic systems and presents a three‑layer defense—producer idempotence, broker de‑duplication, and consumer idempotent design—plus monitoring and reconciliation strategies to achieve reliable exactly‑once processing.
This article explains how RocketMQ, a Chinese‑origin message queue, simplifies Kafka’s architecture while adding powerful features such as tag‑based filtering, transactional messaging, delayed and dead‑letter queues, and a unified commit‑log storage model, making delayed processing and high‑throughput scenarios easier to implement.
The article explains RocketMQ NameServer's lightweight, stateless design, its core routing and metadata management functions, AP‑oriented architecture, fault‑tolerant mechanisms, scalability features, and practical optimization techniques for high availability and low operational cost.
RocketMQ’s message tracing feature records each message’s full lifecycle—including producer, broker, and consumer details such as timestamps, latency, and success flags—by enabling traceTopicEnable, creating an internal RMQ_SYS_TRACE_TOPIC, and allowing custom trace topics for fast diagnostics, end‑to‑end tracking, monitoring, and audit compliance.
This article explores eight common scenarios for using message queues in backend development, covering asynchronous processing, service decoupling, traffic shaping, delayed tasks, log aggregation, distributed transactions, remote calls, and broadcast notifications, each illustrated with Java, RocketMQ, and Kafka code examples.
This article explains RocketMQ's message tracing feature, covering its definition, key data attributes, core benefits, configuration steps for both normal and IO‑isolated modes, the underlying implementation mechanism, supported trace topics, and provides complete Java code examples for custom TraceTopic usage and verification.
This article explains how RocketMQ tackles synchronous registration bottlenecks, tight coupling, and traffic‑burst risks by introducing an intermediate queue layer, designing a durable high‑availability broker, leveraging page cache and mmap for zero‑copy I/O, and using a nameserver for automatic routing, ultimately delivering a high‑throughput, low‑latency messaging system.
This guide explains Apache RocketMQ’s ordinary message concept, its full lifecycle, how to create topics, Java code for sending and receiving messages, key configuration tips, and real‑world scenarios such as asynchronous decoupling and traffic‑shaping for micro‑service architectures.
In RocketMQ, adding consumers speeds consumption only when they are fewer than MessageQueues, while pull delays arise from ProcessQueue thresholds or ordered‑lock timeouts; slow processing often stems from heavy business logic or external calls, and load can be balanced using average, round‑robin, custom, machine‑room, nearby‑room, or consistent‑hash allocation strategies.
This article explains how increasing consumers affects RocketMQ message backlog, details conditions where adding consumers helps or not, describes ProcessQueue flow control, outlines six load‑balancing strategies—including average, round‑robin, custom, machine‑room, nearby, and consistent‑hash—and provides corresponding Java code examples.