Re: [GROW] draft-raszuk-diverse-bgp-path-dist-01 working group document

Hi Greg,

Many thx for your comment and support.

Reg the Nth path selection algorithm I think this is pretty clear and 
published already in other draft (see below). I did not wanted to repeat 
it here, but if you think that such clarification is required it will be 
great comment to add.

Section 5:
http://tools.ietf.org/html/draft-pmohapat-idr-fast-conn-restore-00

Many thx,
R.

> Hi all,
>
> I support this document as it indeed may be an interesting tool to move our architectures towards multiple BGP paths announcements with add-paths support at the end.
>
> I however find it difficult to comment the document and make it progressing as we still don't have a clear view on a standard and shared "n-best paths calculation" (with n>1) algorithm.
>
> Regards,
>
> --
> Greg
>
>> -----Message d'origine-----
>> De : grow-bounces@ietf.org [mailto:grow-bounces@ietf.org] De
>> la part de Peter Schoenmaker
>> Envoyé : jeudi 25 mars 2010 22:32
>> À : grow@ietf.org
>> Objet : [GROW] draft-raszuk-diverse-bgp-path-dist-01 working
>> group document
>>
>> Hello,
>>
>> At the Stockholm IETF Robert Raszuk presented the draft on
>> distribution of diverse BGP paths.  The question was put at
>> the session on whether to adopt this document as working
>> group document.
>>
>> I would like to get the feedback of the list on if we should
>> adopt this document.
>>
>> Thanks
>>
>> Peter -- Chris
>>
>>
>>
>> _______________________________________________
>> GROW mailing list
>> GROW@ietf.org
>> https://www.ietf.org/mailman/listinfo/grow
>>
> _______________________________________________
> GROW mailing list
> GROW@ietf.org
> https://www.ietf.org/mailman/listinfo/grow
>