From: Bob Sinclair (bsinclair@netmasterclass.net)
Date: Wed Jul 07 2004 - 15:41:27 GMT-3
Pierre,
A good understanding of OSPF requires a feel for the Dijkstra algorithm.
Check out the java-based demos at the link below. I think the demos show
that the math is really very easy to understand. Amazing that this
algorithm from the 1950s is still useful today.
HTH,
Bob Sinclair
CCIE #10427, CISSP, MCSE
www.netmasterclass.net
----- Original Message -----
From: "Pierre-Alex Guanel" <pierreg@planetkc.com>
To: "Ccielab@Groupstudy.Com" <ccielab@groupstudy.com>
Sent: Wednesday, July 07, 2004 2:23 PM
Subject: Advanced: OSPF Algorithm
> How does OSPF add the cost of the links?
>
> >From what I have seen, it does not seem like the cost in the packet gets
> updated from hop to hope.
>
> The process of flooding just passes the original lsa along, unaltered.
>
> >From what I read, the OSPF algorithm knows how to find all the costs and
add
> them up from the LSA using the Djakstra algorithm.
>
> Yes I know its all explained in RFC 2178 ...section 16, but I am looking
at
> a simple explaination.
>
> thanks,
>
> Pierre
>
> _______________________________________________________________________
> Please help support GroupStudy by purchasing your study materials from:
> http://shop.groupstudy.com
>
> Subscription information may be found at:
> http://www.groupstudy.com/list/CCIELab.html
This archive was generated by hypermail 2.1.4 : Sun Aug 01 2004 - 10:11:48 GMT-3