Re: [Gnugle-developers] simulating environment

[Marco L. <ma...@ma...>]

Florian Bremer wrote:

>>What kind of simulation do you have in mind exactly? Is it only the 
>>network topography or do you want to simulate information propagation 
>>and indexing issues, too? I like the idea of having a tool for network 
>>topography because the project is very interesting from the research 
>>point of view. In addition, this tool would not only be limited to 
>>Gnugle but could be of greater use.
> 
> 
> I thought about simulating network topography and some aspects of
> information propagation.  
> 
> Crawling and indexing functionality should be (almost) ignored and
> replaced with a very simple dummy technique:
> 
> Instead of websites, a node crawls a number N (member of a set NS). If
> the simulation environment intercepts a crawl-request, it delivers the
> result res(N) and a random amount of new numbers (each member of NS),
> which represent links found in the indexed "site". Res(N) can be a
> hash-function or something like this.  

The idea is good. Every indexed keyword is represented by a number. 
Links are simulated by random numbers.

> Althoug this is a quick'n'dirty hardcore simplification, i believe, that
> it will help to answer the following questions :
> 
> -What's the probability P, that a search request is answered
> successfully?
> -How does P depend on redundancy-level of the information stored among
> the different node?
> -How does P depend on the amount of connected nodes, the cardinality of
> NS (in the figurative sense this means the total amount of websites) and
> other parameters?
> 
> Other aspects we adumbrated in the wiki like "Network information
> propagation" / "Adding nodes to the network" could simulated in am more
> detailed manner. 
> 
> _VERY_ short implementation idea (too tired to keep on
> writing/thinking):
> 
> -main program is provides an infinite loop
> 
> -new nodes are added to the network with a specified probablitiy; the
> node, it has to connect to, is chosen randomly among the connected nodes
> -in each cycle, each node (represented as a object) executes a method
> (idle, connect, disconnect, crawl, do search query, ...) with a
> specified probability
> -transmitting a query/answer between two nodes (without using a third
> node as interstation) takes one cycle

A good idea, I will keep that in mind, when my mind is clear again,

Greetings,
              Marco