Re:Pastry: A distributed hash table in Go
by JulianMorrison on Saturday October 20, 2012 @04:35AM
(#4676650)
How are you planning to implement pub-sub on top of it?
[ Parent
| on HN ]
Re:Pastry: A distributed hash table in Go
by paddyforan on Saturday October 20, 2012 @04:52AM
(#4676670)
I'll be using the Scribe algorithm, as defined by the authors of the Pastry algorithm: http://en.wikipedia.org/wiki/Pastry_(DHT)#SCRIBE
The basic gist of it is similar to a phone tree. You route a message subscribing to a topic, basing the message ID on the topic name. As the message routes through the network, each Node stores the information about who is subscribed. When an event happens, that information is passed back through to the subscribed nodes.
I may have to tweak it a little, as I did Pastry, but I'm pretty sure the same basic concept will work for my needs.