[zeromq-dev] ZMQ_ROUTER internals

Ian Barber ian.barber at gmail.com
Tue Sep 3 09:03:21 CEST 2013


It's a std:map with an optimised key type for comparisons. All be equal,
shorter should be slightly better, though I can't imagine there's a great
deal in it.


On Tue, Sep 3, 2013 at 2:41 AM, A. Mark <gougolith at gmail.com> wrote:

>
> I hope I'm not asking a redundant question and I haven't the time to look
> at the ZMQ source code at the moment. What is the underlying search method
> for routing messages internally within ZMQ_ROUTER? Assuming it's a perfect
> hash - or at least it's some kind of hashing algo based on identity, I
> assume using smaller length identity somewhat reduces the overhead of
> routing? Aside from that I'm wondering is there any other precaution to
> take if one wants to have a very tightly bound lowest latency router
> (broker) over inproc?
>
>
> Any input is appreciated.
>
>
> Mark
>
> _______________________________________________
> zeromq-dev mailing list
> zeromq-dev at lists.zeromq.org
> http://lists.zeromq.org/mailman/listinfo/zeromq-dev
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <https://lists.zeromq.org/pipermail/zeromq-dev/attachments/20130903/d99123e1/attachment.htm>


More information about the zeromq-dev mailing list