On 12/22/2010 02:33 AM, fokenrute wrote: > Hi, > As an exercice to familiarize myself with 0MQ, I try to code a > simple Memcached-like distributed in-memory > key-value store. The most staightforward architecture I could figure is > a OMQ device distributing requests > to backends, which are simple processes managing a data structure that > store key-value pairs. > The problem is that I want to use consistent hashing to balance the load > between the backends but > 0MQ XREQ sockets use round-robin to thid end. So, is there a simple way > to use consistent hashing > instead of round-robin with XREQ sockets ?
You can simply rewrite the algorithm in xreq.cpp. However, it's not clear how such a system would work in real-world deployment where worker nodes occur and disappear randomly. Martin _______________________________________________ zeromq-dev mailing list zeromq-dev@lists.zeromq.org http://lists.zeromq.org/mailman/listinfo/zeromq-dev
