[quagga-dev 9631] Re: [PATCH RFC] OSPF vertices memory exhaustion

Joakim Tjernlund joakim.tjernlund at transmode.se
Sat Aug 4 10:14:05 BST 2012

Paul Jakma <paul at jakma.org> wrote on 2012/08/03 22:43:41:

> From: Paul Jakma <paul at jakma.org>
> To: Joakim Tjernlund <joakim.tjernlund at transmode.se>,
> Cc: David Lamparter <equinox at opensourcerouting.org>, quagga-dev at lists.quagga.net
> Date: 2012/08/03 22:43
> Subject: Re: [quagga-dev 9440] Re: [PATCH RFC] OSPF vertices memory exhaustion
> On Fri, 3 Aug 2012, Joakim Tjernlund wrote:
> > No, now I understand what you were trying to do and why. This was not
> > at all clear from reading bug 330 and later your blog so it looked like
> > a bug and from your replies I didn't think you understood what I meant.
> Yeah, there were regressions in the bug #330 changes.
> All of those commits are *years* old though. ;)

There is text too, just before 16.1.1
        The specification does not require that the above two stage
        method be used to calculate the shortest path tree.  However, if
        another algorithm is used, an identical tree must be produced.
        For this reason, it is important to note that links between
        transit vertices must be bidirectional in order to be included
        in the above tree.  It should also be mentioned that more
        efficient algorithms exist for calculating the tree; for
        example, the incremental SPF algorithm described in [Ref1].

Any concerns that the generated tree will be different?


More information about the Quagga-dev mailing list