[OLPC Networking] Path discovery sanity

[Ricardo Carrano]

I just performed another test to demonstrate the relation of costs for each
PREQ and the occurrence of multihop paths.  More importantly, maybe, the
test also confirms that even with hop count as metrics, the multhop paths
will still form.

http://wiki.laptop.org/go/Path_Discovery_Mechanism:Sanity#Hop_count_will_indeed_reduce_it.2C_but_not_eliminate

More on this soon.

Looking forward to hear your comments!
Ricardo

On Mon, May 12, 2008 at 10:12 AM, Ricardo Carrano <carrano at laptop.org>
wrote:

> Those interested in the path discovery mechanism would probably want to
> take a look at:
> http://wiki.laptop.org/go/Path_Discovery_Mechanism:Sanity
>
> It is an investigation into the forming of "longer than expected" paths in
> a dense mesh (like a classroom).
>
> Please, let me know of the flaws and loose ends in the argument.
>
> Cheers!
> Ricardo Carrano
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.laptop.org/pipermail/networking/attachments/20080512/f5be3be0/attachment.htm