[rabbitmq-discuss] 2 nodes, 4k queues

[Alexis Richardson]

One more thing...

On Fri, Nov 20, 2009 at 10:24 PM, Alexis Richardson
<alexis.richardson at gmail.com> wrote:
>>
>> Is it O(n) relative to the number of bindings per exchange, or per server node, or per cluster? I'm researching the overhead of a lot of bindings as well... Does the lookup overhead increase in a cluster, or is the 'route table' replicated to all nodes so it's always an in-memory lookup?
>
> An exchange routing table is shared across nodes in a cluster.  This
> is achieved by replication across all nodes in the cluster.  Lookup is
> therefore in-memory and takes O(n) where n the number of bindings in
> that exchange.

To be clear, O(n) is for *topic* exchanges in the *current* implementation.





> alexis
>
>
>
>
>
>> -JD
>>
>>
>>
>> _______________________________________________
>> rabbitmq-discuss mailing list
>> rabbitmq-discuss at lists.rabbitmq.com
>> http://lists.rabbitmq.com/cgi-bin/mailman/listinfo/rabbitmq-discuss
>>
>