[zeromq-dev] Order by which PUB/SUB requests are sent/processed

[Michel Pelletier]

If you use a hash ring approach, you can hash the message to one
unique worker who does the pop, an the rest who fail to hash to the
message go off and do the fail logic.  That way there's good random
distribution and no delays.  Here's a blog on the approach:

http://www.lexemetech.com/2007/11/consistent-hashing.html

-Michel

On Tue, Jan 24, 2012 at 6:41 PM, Joegen Baclor <jbaclor at ezuce.com> wrote:
> Fair enough.  Indeed it can be done by a virtual random delay or
> back-off mechanism if a client exceeds a certain threshold.  Thanks for
> the input martin, that's all I need.
>
> On 01/25/2012 10:35 AM, Martin Sustrik wrote:
>> On 01/25/2012 11:30 AM, Michel Pelletier wrote:
>>> If I follow what you're asking, you want the numbers in your first
>>> email to have a more even distribution than what they have now, where
>>> no one subscriber gets the message "first", so to speak.  I'm not sure
>>> it makes sense for 0mq to try to make any guarantees on the time of
>>> arrival.
>> It cannot do that. Exact arrival time depends on your network, jitter in
>> the OS and similar.
>>
>>> Messages could be going out same or different transports and
>>> interfaces.  Maybe a better solution for you would be for your workers
>>> to "roll the dice" to see who will pop first.
>> Yes. You can implement that by introducing a random delay between
>> receiving the pub/sub message and popping the queue.
>>
>> Martin
>> _______________________________________________
>> zeromq-dev mailing list
>> zeromq-dev at lists.zeromq.org
>> http://lists.zeromq.org/mailman/listinfo/zeromq-dev
>>
>
> _______________________________________________
> zeromq-dev mailing list
> zeromq-dev at lists.zeromq.org
> http://lists.zeromq.org/mailman/listinfo/zeromq-dev