On Fri, Apr 23, 2010 at 10:50:38AM +0200, Joakim Tjernlund wrote:
Yes, i got the idea. Our algorithm (for PTP) is to search for a ptp iface with a full neighbor with given Router ID and choose the cheapest one. This would lead to the same results as your idea, but a slightly less efficient, but probably not important unless you have a hundreds of PTP ifaces on a router.
I got a lot of PtP I/Fs(some 20-30) :)
But this won't fix multiple ptp I/Fs between the same two routes and I don't think it will work if one end is unnumbered and the other one is not.
Our algorithm (in the git tree) works well for multiple ptp ifaces between the same two routers (because both the SPF and the calc_next_hop() chooses the same (cheapest) ptp link. Our algorithm works regardless of whether it is unnumbered or numbered, as we don't use the information from the 'Link Data' field of router-LSA for ptp networks. -- Elen sila lumenn' omentielvo Ondrej 'SanTiago' Zajicek (email: santiago@crfreenet.org) OpenPGP encrypted e-mails preferred (KeyID 0x11DEADC3, wwwkeys.pgp.net) "To err is human -- to blame it on a computer is even more so."