![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|
Hi Alia and Mike, For a multi-homed prefix, I suggest we can also point
out, if the logical topological transformation is not desirable, consider it as
a single-homed prefix. In this case, we should also point out the destination
router D used to compute the alternate next hop for this prefix should be the
one preferred in the normal route calculation process. Besides, the dependency between link-protecting LFA
and node-protecting LFA condition seems not so clear, can we point out if a
candidate neighbor meets the node-protecting inequality, it will always meet
the link-protecting inequality? I read the following words in section 3.6.
Selection Procedure, which seems implying such a dependency exactly. “Loop-Free Node-Protecting Alternate - This
next-hop satisfies Inequality 1 and
Inequality 3. The path avoids S, S's primary neighbor E, and the
link from S to E.” zhangkui From:
Alia Atlas [mailto:akatlas at gmail.com] It does look
like the costs are not correct to have A provide a node-protecting
alternate. As Mike suggests, I'll change the cost of SA to be 8 instead
of 4. On Thu, Feb 14, 2008 at 7:17 AM, mike shand <mshand at cisco.com> wrote: Kui Zhang wrote: Hi all, I have a doubt about multi-homed prefix LFA
computation described in draft-ietf-rtgwg-ipfrr-spec-base-10: "If the alternate
next-hop for the prefix p is simply inherited from
the router advertising it on the shortest path to p, then the prefix p's
alternate next-hop would be the link to C. This would provide link
protection, but not the node protection that is possible via A.
5 +---+ 4 +---+ 5 +---+
------| S |------| A |-----| B |
| +---+ +---+
+---+
|
|
|
| 5 |
5 |
| |
|
+---+ 5 +---+ 5 7
+---+
| C |---| E |------ p -------| F | +---+
+---+
+---+
Figure 6: Multi-homed prefix" It seems router A is not a valid node-protecting
LFA, which will cause a forwarding loop. And the following words seem incorrect since we have
to take the cost from the advertising router to the advertised prefixes into
consideration. "If there exist multiple multi-homed
prefixes that share the same connectivity and the difference in
metrics to those routers, then a single node can be used to represent
the set." For example, in figure 6, if the cost for prefix p
to F decreases to 4, then router A will be a valid node-protecting LFA. Do I miss something here? Thanks for helping me in
advance. There does seem to be something wrong here as you
point out. Actually even decreasing F-p to 4 doesn't completely fix it because
then A would have an ECMP path to p (both cost 14). The cost would need to
reduce to 3 to fix this. Regards, Zhangkui
_______________________________________________rtgwg mailing listrtgwg at ietf.orghttp://www.ietf.org/mailman/listinfo/rtgwg
|
_______________________________________________ rtgwg mailing list rtgwg at ietf.org http://www.ietf.org/mailman/listinfo/rtgwg