Re: [Gnugle-developers] simulating environment

[<Flo...@rw...>]

On Wed, Jan 28, 2004 at 08:03:17PM +0100, Marco Lange wrote:

> What kind of simulation do you have in mind exactly? Is it only the=
=20
> network topography or do you want to simulate information propagati=
on=20
> and indexing issues, too? I like the idea of having a tool for netw=
ork=20
> topography because the project is very interesting from the researc=
h=20
> point of view. In addition, this tool would not only be limited to=
=20
> Gnugle but could be of greater use.

I thought about simulating network topography and some aspects of
information propagation. =20

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). I=
f
the simulation environment intercepts a crawl-request, it delivers th=
e
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. =20

Althoug this is a quick'n'dirty hardcore simplification, i believe, t=
hat
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 amon=
g
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 mo=
re
detailed manner.=20

_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 no=
des
-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

> I hope I will be able to do a bit more the next days, but the last =
three=20
> days, I was "disabled" by a nerving cold and sniffles.

Fortunately, i've already left my yearly cold behind me ;o)

Gru=DF
Florian

=3D=3D=3D
"Irgendwie hab ich das schon mal erlebt. - Ach ja!
Gestern, vorgestern und eigentlich jeden Tag.
Das ist deprimierend." (Bernd das Brot)

GnuPG: 0x7E3055F3