Re: [Idr] Progressing draft-bhatia-bgp-multiple-next-hops-01.txt

[Paul Jakma <paul at clubi.ie>]

On Thu, 24 Aug 2006, Enke Chen wrote:

> Let us give a trivial algorithm:
>
> For a prefix, allocate the path identifiers for paths sequentially starting 
> from 0, do not reuse until it wraps (that will take many many years).

Now you receive a path update and must pass it on to this peer, how 
do you find out whether a previous path was advertised?

Bear in mind, you can't just compare against peer path was received 
from, because there can be multiple such paths.

regards,
--
Paul Jakma	paul at clubi.ie	paul at jakma.org	Key ID: 64A2FF6A
Fortune:
It is easier for a camel to pass through the eye of a needle if it is
lightly greased.
		-- Kehlog Albran, "The Profit"

_______________________________________________
Idr mailing list
Idr at ietf.org
https://www1.ietf.org/mailman/listinfo/idr