Neohapsis is currently accepting applications for employment. For more information, please visit our website www.neohapsis.com or email firstname.lastname@example.org
From: Swati Rastogi (swatirstogiYAHOO.COM)
Date: Thu Aug 23 2001 - 09:03:33 CDT
I am quite new to this protocol and have the following doubt. Consider a
full mesh OSPF topology which has n routers. The flooding algorithm says
that whenver you recieve a new LSA you flood it out on every other interface
you have. So if something happens then one router sends it out in turn to
(n-1) routers. Each of these says "Oh! this is new ! I need to send it to
other (n-1) routers !" .. So we get n^2 copies of it.
This much is very clear to me.
What is confusing me is the fact that how can we get O(n^3) if a link fails
and how O(n^4) when a router fails ?
If a router fails since its adjacent to everybody all of the other routers
have to flood their router LSAs .. but how O(n^4) ??
Thanks in advance,
Do You Yahoo!?
Get your free yahoo.com address at http://mail.yahoo.com