News for hackers. Stuff that matters.
Re:Pastry: A distributed hash table in Go by brian_cloutier on Saturday October 20, 2012 @04:42AM (#4676655)
What does it have?
Re:Pastry: A distributed hash table in Go by JulianMorrison on Saturday October 20, 2012 @04:53AM (#4676671)
Peer-to-peer connections analogous to TCP. In the case of pub/sub all subscribers connect to the publisher. http://zguide2.zeromq.org/page:all
Re:Pastry: A distributed hash table in Go by paddyforan on Saturday October 20, 2012 @05:03AM (#4676678)
I guess I was wrong about hard-coding the IPs. Maybe?

It doesn't have many-to-many baked in, though. That I can see, at least.

It looks like I may have been able to make this work, but the setup would be a little complex.

... because a distributed hash table is not complex at all. -_-

Re:Pastry: A distributed hash table in Go by JulianMorrison on Saturday October 20, 2012 @05:26AM (#4676705)
It doesn't have many-to-many but in my experience most things aren't true many-to-many. More like, there are a handful of publishers in the system and each has a handful of subscribers.

Suppose your architecture is API -> Web sockets and you want to make it highly scalable, then what I'd do is:

1. Many API -> few relays (use doozerd to keep up to date as to where the relays are and select one randomly, use ZMQ_ROUTER socket type to enqueue API->relay messages).

2. Few Relay -> many web socket (again using doozerd for the web socket nodes to find the relay, and using ZMQ_PUB on the relay and ZMQ_SUB on the web socket nodes).

Re:Pastry: A distributed hash table in Go by paddyforan on Saturday October 20, 2012 @06:03AM (#4676742)
Sounds like it would work, and have great availability and scalability. It just, conceptually, doesn't mesh with how I think about the system. An absolutely aesthetic distinction, I know.