As Howard might say "what problem are you trying to solve?"
If you are looking at this for certification purposes, I would say glide lightly over
areas of a granular nature such as the performance of an SPF algorithm. For these
purposes, Jeff or Radia's coverage (more so Jeff's in the case of
:Re: On RFC2328 - OSPF 2
First, from the certification perspective, you don't really need to
know the details of the link state route computation algorithm.
Second, Jeff Doyle and Radia Perlman wrote fairly generic
descriptions of what is happening, but not at a detail of precision
th
CTED] [mailto:[EMAIL PROTECTED]] On Behalf Of
Jaeheon Yoo
Sent: Sunday, December 24, 2000 11:38 PM
To: [EMAIL PROTECTED]
Subject:On RFC2328 - OSPF 2
Hi,
Merry Christmas and Happy New Year to All!
I'm reading RFC 2328, fortunately most part of it is understandable
for me. But "
First, from the certification perspective, you don't really need to
know the details of the link state route computation algorithm.
Second, Jeff Doyle and Radia Perlman wrote fairly generic
descriptions of what is happening, but not at a detail of precision
that is needed to implement the code
For me, I find Radia Pearlman one is easy to follow
"Jaeheon Yoo" <[EMAIL PROTECTED]> wrote in message
[EMAIL PROTECTED]">news:[EMAIL PROTECTED]...
> Hi,
> Merry Christmas and Happy New Year to All!
>
> I'm reading RFC 2328, fortunately most part of it is understandable
> for me. But "16. C
Hi,
Merry Christmas and Happy New Year to All!
I'm reading RFC 2328, fortunately most part of it is understandable
for me. But "16. Calculation of the routing table" part is extremely
hard to follow. Although Jeff Doyle's explanation of Dijkstra's
algorithm sounds easy and interesting, why is i
6 matches
Mail list logo
