This is why my head was smoking after writing this.... The best case is 4 Reservations. But those were simply a lucky guess, and i guessed all four segments correctly on the first try at each. The *odds* of doing that is 1:256. The worst case is 13 Reservations. But this is the result of a breadth first search in which the path is guarranteed to be found. i.e 1:1 odds. j Sent from my iPad3g On Dec 21, 2011, at 9:36 AM, Jeroen van der Ham <vdham@uva.nl> wrote:
Hi,
How do you go from a best-case scenario where you have a 1 in 256 chance of guessing it right to a worst-case scenario with 13 messages?
Jeroen.
On 21 Dec 2011, at 06:26, Jerry Sobieski wrote:
Hi all-
Attached is rather detailed discussion of the performance of Path Finding on the SC topology. I hope you find it useful.
BTW- it is 4 pages, 12 pt font. So sue me. If you do not want to read it because exceeds the arbitrary 3 page limit, then just reduce the font to 10 or 8 and it will be fine. :-)
I will post a separate short document describing how our current topology model allows NSI to deal with multi-layer pathfinding. Give me a day or two to let my brain cool off from the previous exercise....:-) (And I will keep this short as well:-)
If you have any questions about the use-case, skype me or we can touch them on the call.
thanks! Jerry <NSI over AutoGOLE Use Case JS2.docx>_______________________________________________ nsi-wg mailing list nsi-wg@ogf.org https://www.ogf.org/mailman/listinfo/nsi-wg