I-D Action:draft-ietf-6man-flow-update-05.txt

2011-05-02 Thread Internet-Drafts
A New Internet-Draft is available from the on-line Internet-Drafts directories. This draft is a work item of the IPv6 Maintenance Working Group of the IETF. Title : Rationale for update to the IPv6 flow label specification Author(s) : S. Amante, et al.

I-D Action:draft-ietf-6man-flow-3697bis-03.txt

2011-05-02 Thread Internet-Drafts
A New Internet-Draft is available from the on-line Internet-Drafts directories. This draft is a work item of the IPv6 Maintenance Working Group of the IETF. Title : IPv6 Flow Label Specification Author(s) : S. Amante, et al. Filename:

Flow label drafts updated

2011-05-02 Thread Brian E Carpenter
Hi, All three flow label drafts have now been updated. They can be found conveniently at https://datatracker.ietf.org/doc/search/?name=draft-ietf-6man-flowactiveDrafts=on I will shortly send messages explaining how we've dealt with the final set of WGLC comments. Regards Brian + co-authors

Re: 6MAN WG Last Call: draft-ietf-6man-flow-3697bis-02.txt

2011-05-02 Thread Brian E Carpenter
On 2011-04-06 05:40, Thomas Narten wrote: Here are my detailed comments on the document. I did chat with Brian directly in Prague about these points as well. Overall, I support this document. But I think the wording in places needs another round of revision. A flow is a sequence of

Re: 6MAN WG Last Call: draft-ietf-6man-flow-update-04.txt

2011-05-02 Thread Brian E Carpenter
On 2011-04-06 06:09, Thomas Narten wrote: Here are my comments on this document. My main issue is that it continues to assert that flow labels are required to be pseudo random. I am not convinced that is necessary and I think it makes things more complex than necessary. Emphasis changed to

Re: [Fwd: I-D Action:draft-ietf-6man-flow-ecmp-01.txt]

2011-05-02 Thread Brian E Carpenter
On 2011-04-06 05:45, Thomas Narten wrote: Looking at the revised document, here are some additional comments. One lightweight approach to ECMP or LAG is this: if there are N equally good paths to choose from, then form a modulo(N) hash [RFC2991] from a consistent set of fields in