Fanout exchange (broadcast) in RabbitMQ - Time & Space Complexity

Time Complexity: Fanout exchange (broadcast)

O(n)

Understanding Time Complexity

We want to understand how the work done by a fanout exchange changes as the number of messages or queues grows.

Specifically, how does broadcasting messages affect processing time when more queues are involved?

Scenario Under Consideration

Analyze the time complexity of the following RabbitMQ fanout exchange code snippet.

channel.exchangeDeclare("logs", "fanout");
channel.queueDeclare("queue1", false, false, false, null);
channel.queueDeclare("queue2", false, false, false, null);
channel.queueBind("queue1", "logs", "");
channel.queueBind("queue2", "logs", "");
channel.basicPublish("logs", "", null, message.getBytes());

This code declares a fanout exchange named "logs", binds two queues to it, and publishes a message that is broadcast to all bound queues.

Identify Repeating Operations

Look for repeated actions that affect performance.

• Primary operation: Delivering the message to each bound queue.
• How many times: Once per queue bound to the fanout exchange.

How Execution Grows With Input

As the number of queues increases, the message is sent to each queue separately.

Input Size (number of queues)	Approx. Operations (message deliveries)
10	10
100	100
1000	1000

Pattern observation: The work grows directly with the number of queues. More queues mean more message deliveries.

Final Time Complexity

Time Complexity: O(n)

This means the time to broadcast a message grows linearly with the number of queues bound to the fanout exchange.

Common Mistake

[X] Wrong: "Broadcasting a message takes the same time no matter how many queues are bound."

[OK] Correct: Each queue must receive its own copy, so more queues mean more work and more time.

Interview Connect

Understanding how message broadcasting scales helps you design systems that handle load well and avoid bottlenecks.

Self-Check

"What if we changed the fanout exchange to a direct exchange with routing keys? How would the time complexity change when publishing messages?"