Re: [Vrs-development] Mobile Agents

[morphius]

> I guess I don't fully understand the point....
> 
> 1: Assuming that all LDS nodes are on the internet, we already have a 
> flexible, redundant, extremely reliable routing mechanism, and all nodes 
> should be capable of making direct connections to all other nodes.

I think Chris meant a subset of the routing mechanism to identify all the LDS
nodes on the internet.
 
> 2: Why is it easier to build a node graph than to keep a table of nodes?  It 
> seems to me that in searching the node graph one is building a table of nodes 
> anyway.  Being able to build a graph means you can build a table...they're 
> equivalent...

The information is more dynamic. I agree a table of nodes is simplier to
maintain. This data has to be stored in the cluster image. Even if a single LDS
joins the VRS cluster, the table and the image will have to be modified. This
will force the entire image to sent across. This is increase the bandwidth. 

> 3: Now, that being said, there may be a point in having a node graph anyhow, 
> if you store bandwidth and ping time information.  For example, if node X has 
> to grab some data which is stored on both node Y and node Z, but the node 
> graph knows that the average bandwidth between X-Y is much higher than X-Z, 
> it would make sense to talk to node Y first.

I think this kind of a mechanism will be useful.


- Morphius