You are viewing a plain text version of this content. The canonical link for it is here.
Posted to users@qpid.apache.org by Maxim Smyatkin <sm...@gmail.com> on 2012/07/01 11:10:42 UTC

Receiving messages from unknown nodes

Hello!

In my application which should be very scalable I have a networking
subsystem. The subsystem will be based on some kind of DHT and it means
every concrete node will know only about minority (logN * Replicas) of all
system nodes.
Furthermore, every new node, probably, will be unknown for another nodes
for the first time. But as It is described in API reference's section
'Receiving messages from multiple sources' I have to create receiver with
concrete address for every node.
So, How can I solve this problem? May be there is the way to create
receiver for any incoming message? Or may be any another solution exists?
May be I just missed something.

-- 
Thank you!
Smyatkin Maxim.

Re: Receiving messages from unknown nodes

Posted by Maxim Smyatkin <sm...@gmail.com>.
Sorry. Looks like I missed basic ideas of QPID, such as queues and topics.
So, if receivers and senders work with queues and topics rather than with
node's addresses I will always know set of existing "addresses".
Consequently, my problem does not exist :)

On Sun, Jul 1, 2012 at 1:10 PM, Maxim Smyatkin <sm...@gmail.com>wrote:

> Hello!
>
> In my application which should be very scalable I have a networking
> subsystem. The subsystem will be based on some kind of DHT and it means
> every concrete node will know only about minority (logN * Replicas) of all
> system nodes.
> Furthermore, every new node, probably, will be unknown for another nodes
> for the first time. But as It is described in API reference's section
> 'Receiving messages from multiple sources' I have to create receiver with
> concrete address for every node.
> So, How can I solve this problem? May be there is the way to create
> receiver for any incoming message? Or may be any another solution exists?
> May be I just missed something.
>
> --
> Thank you!
> Smyatkin Maxim.
>
>


-- 
Thank you!
Smyatkin Maxim.