This is great information, James - thank you for taking the time to share.
On Mon, Jun 25, 2018 at 10:02 AM James Harvey wrote:
> Yes that’s possible, you can also use/store the round trip time from
> subscribe to reply.
> That should give some idea of the network distance/congestion/load on
>
Yes that’s possible, you can also use/store the round trip time from subscribe
to reply.
That should give some idea of the network distance/congestion/load on each
publisher.
Basically your client can build up a map of all possible options about where is
the best place to get X from.
James
Ah! The simplicity of this approach makes sense.
I suppose it also allows clients to disconnect/remove a cacher from it's
sources if a SUB notification isn't received in 5 or 10 seconds as well
then?
Thanks again,
James
On Mon, Jun 25, 2018 at 9:38 AM James Harvey wrote:
>
> Hi James,
>
> The
Hi James,
The cachers in my setup, publish their discovery information every second to
the discovery proxies. I have maybe 100 catchers and the network overhead is
low compared with the ease of use and the fact you can use that info to confirm
the publisher is still in running.
I add meta
James - thank you for building on what Bill mentioned; that's actually
quite helpful. I think what you describe is very close to what I am needing
to do. I wouldn't have thought to use XPUB/XSUB for this, but as always
things seem intuitive _after_ the fact.
Perhaps a naive question, but how are
Thanks for the detailed response, Bill. You've raised many interesting
approaches/ideas in here for me to look into - I appreciate it.
On Sat, Jun 23, 2018 at 1:30 PM Bill Torpey wrote:
> Hi James:
>
> I’m doing something similar on the service discovery end, but it’s a work
> in progress, so
Hi James,
I am doing something almost identical to Bill with regards to discovery.
My system is a distributed cache, where I have X discovery proxies at fixed
location with a fixed port for upstream/downstream. They are just xpub/xsub
(with verbose/r on) zmq_proxy.
+ Cacher publishes (on a
