From nobody Wed Aug  2 04:09:45 2023
Return-Path: <acee.ietf@gmail.com>
X-Original-To: bess@ietfa.amsl.com
Delivered-To: bess@ietfa.amsl.com
Received: from localhost (localhost [127.0.0.1])
 by ietfa.amsl.com (Postfix) with ESMTP id A67FAC14CE4F;
 Wed,  2 Aug 2023 04:09:42 -0700 (PDT)
X-Virus-Scanned: amavisd-new at amsl.com
X-Spam-Flag: NO
X-Spam-Score: -2.104
X-Spam-Level: 
X-Spam-Status: No, score=-2.104 tagged_above=-999 required=5
 tests=[BAYES_00=-1.9, DKIM_SIGNED=0.1, DKIM_VALID=-0.1,
 DKIM_VALID_AU=-0.1, DKIM_VALID_EF=-0.1, FREEMAIL_FROM=0.001,
 HTML_MESSAGE=0.001, RCVD_IN_ZEN_BLOCKED_OPENDNS=0.001,
 SPF_HELO_NONE=0.001, SPF_PASS=-0.001, T_SCC_BODY_TEXT_LINE=-0.01,
 URIBL_BLOCKED=0.001, URIBL_DBL_BLOCKED_OPENDNS=0.001,
 URIBL_ZEN_BLOCKED_OPENDNS=0.001] autolearn=ham autolearn_force=no
Authentication-Results: ietfa.amsl.com (amavisd-new); dkim=pass (2048-bit key)
 header.d=gmail.com
Received: from mail.ietf.org ([50.223.129.194])
 by localhost (ietfa.amsl.com [127.0.0.1]) (amavisd-new, port 10024)
 with ESMTP id 6sDk_E_jNghG; Wed,  2 Aug 2023 04:09:40 -0700 (PDT)
Received: from mail-vs1-xe2e.google.com (mail-vs1-xe2e.google.com
 [IPv6:2607:f8b0:4864:20::e2e])
 (using TLSv1.3 with cipher TLS_AES_128_GCM_SHA256 (128/128 bits)
 key-exchange X25519 server-signature RSA-PSS (2048 bits) server-digest SHA256)
 (No client certificate requested)
 by ietfa.amsl.com (Postfix) with ESMTPS id 2E970C15106D;
 Wed,  2 Aug 2023 04:09:35 -0700 (PDT)
Received: by mail-vs1-xe2e.google.com with SMTP id
 ada2fe7eead31-4476a2a5bc9so2171059137.2; 
 Wed, 02 Aug 2023 04:09:35 -0700 (PDT)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;
 d=gmail.com; s=20221208; t=1690974574; x=1691579374;
 h=references:to:cc:in-reply-to:date:subject:mime-version:message-id
 :from:from:to:cc:subject:date:message-id:reply-to;
 bh=kQf0+fAlOjh3rlBjFkjBQRNa4DBb/nio4tQkkcPxqvs=;
 b=EpCTjDgg31/WyUGnY/7Eo3jIN0JjXt0AaOxU2jLf/bJThXWOVVBaNnybTqn2EYjmiM
 dXtK2MX4R/vSX9FTqwTBmqw/F+cUL4XJdMP7yjs/bUPfejxy2lkjTOGdQA/LPbQHi7Dt
 h1XG9DKtZNy+/CbwuuMTfmsmNQ0/Wa0gpE8tydtRiVCUqPPGNcBM6mHkSGTpv9h+S/mX
 1cEDNUlBdsayf5Gc+7VOZdO5qxhrMhlVGxgGt9hpTJvhMNTCGCIudfvDf5UuQx3lmmYo
 CtwTZG8boWYh7fw6aFXrkuu59IueH7GKM752uQ56MlKb5B0Mwa0MboxSguXqWiFR/Bfa
 i4AQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;
 d=1e100.net; s=20221208; t=1690974574; x=1691579374;
 h=references:to:cc:in-reply-to:date:subject:mime-version:message-id
 :from:x-gm-message-state:from:to:cc:subject:date:message-id:reply-to;
 bh=kQf0+fAlOjh3rlBjFkjBQRNa4DBb/nio4tQkkcPxqvs=;
 b=PZNQgH68mwloqdpuIPKjJ5zfwXLBUZlGX4KrdpU9utV7rqriyCdgppOUAvQjKcXIvM
 exPvkTI5PwFdP7cQgiWn79JUBTgTtNVAs5j5AGvisgvzkOA0WUhi5LK7RkKuDo+N/mft
 NVAotks6Cm3Kg8lrTx8ZKRi31j3GpYWp4TBtQsyzCv6ltIPFRNIZNWyc8I4b6NPRnOsM
 mF5VcVG0CsznIZAeFzSQSf7p32Ji4UKdp/XyOGy4BYN8vWG9zhEPdg8kVqCRRbwYud86
 IH2qrsFl+Zr5JDKJRsYsHN2JOoqwRIBucXalnLQdq/6AX+J0Rudw3NQbuKnKZyj5upuN
 ubYQ==
X-Gm-Message-State: ABy/qLaGZ0ptYpbZb22HulISgrZ2SJFFql5+n0qdDpjyrj0jNiDNBM83
 uUR+HNnGeKdp6/cAxVCb66tbAFW86Hg=
X-Google-Smtp-Source: APBJJlF4OYC64EhZIZ+9uv/2WNVI2xuLaqcF1qRa2/pZgNTXxxwdDajhAMEpW23wnQvQTg9mqkbGiQ==
X-Received: by 2002:a05:6102:3a57:b0:443:7935:6eb5 with SMTP id
 c23-20020a0561023a5700b0044379356eb5mr4430979vsu.15.1690974573537; 
 Wed, 02 Aug 2023 04:09:33 -0700 (PDT)
Received: from smtpclient.apple ([2605:a601:91bc:d800:49d3:4f2e:cb65:fd48])
 by smtp.gmail.com with ESMTPSA id
 p4-20020a0c8c84000000b0063cfb3fbb7esm5408552qvb.16.2023.08.02.04.09.32
 (version=TLS1_2 cipher=ECDHE-ECDSA-AES128-GCM-SHA256 bits=128/128);
 Wed, 02 Aug 2023 04:09:33 -0700 (PDT)
From: Acee Lindem <acee.ietf@gmail.com>
Message-Id: <A67AD12D-17F9-4302-BABD-C597979B35FD@gmail.com>
Content-Type: multipart/alternative;
 boundary="Apple-Mail=_79F6C49D-1B93-4858-8972-44816CC04C04"
Mime-Version: 1.0 (Mac OS X Mail 16.0 \(3731.600.7\))
Date: Wed, 2 Aug 2023 07:09:22 -0400
In-Reply-To: <BYAPR11MB272536A67421F4DF126EBFE3DF0AA@BYAPR11MB2725.namprd11.prod.outlook.com>
Cc: Routing ADs <rtg-ads@ietf.org>,
 "draft-ietf-bess-evpn-per-mcast-flow-df-election@ietf.org"
 <draft-ietf-bess-evpn-per-mcast-flow-df-election@ietf.org>, 
 "bess@ietf.org" <bess@ietf.org>, Routing Directorate <rtg-dir@ietf.org>
To: "Mankamana Mishra (mankamis)" <mankamis@cisco.com>
References: <9C5FDE48-9B4B-4ADF-A67D-43E60EAB734E@gmail.com>
 <BYAPR11MB272536A67421F4DF126EBFE3DF0AA@BYAPR11MB2725.namprd11.prod.outlook.com>
X-Mailer: Apple Mail (2.3731.600.7)
Archived-At: <https://mailarchive.ietf.org/arch/msg/bess/HcbLbZKf412dJmwfD6skXdK7c4M>
Subject: Re: [bess] Routing Directorate early review for
 draft-ietf-bess-evpn-per-mcast-flow-df-election-09
X-BeenThere: bess@ietf.org
X-Mailman-Version: 2.1.39
Precedence: list
List-Id: BGP-Enabled ServiceS working group discussion list <bess.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/bess>,
 <mailto:bess-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/bess/>
List-Post: <mailto:bess@ietf.org>
List-Help: <mailto:bess-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/bess>,
 <mailto:bess-request@ietf.org?subject=subscribe>
X-List-Received-Date: Wed, 02 Aug 2023 11:09:42 -0000


--Apple-Mail=_79F6C49D-1B93-4858-8972-44816CC04C04
Content-Transfer-Encoding: quoted-printable
Content-Type: text/plain;
	charset=utf-8

Hi Mankamana,=20

> On Aug 1, 2023, at 17:44, Mankamana Mishra (mankamis) =
<mankamis@cisco.com> wrote:
>=20
> Hi Acee,=20
> Thanks for reviewing and comment.  While I make changes to existing =
draft based on your comments,  I had question on some of the comments
> =20
>   1. Precisely explain the hashing algorithm in section 4.1 and 4.2. =
As
>      written, they subject to multiple interpretations. Provide a =
reference
>      to CRC_32() and expand acronyms on first use (e.g., MSB).
>=20
>   2. In addition to explaining the hashing algorithm, the document =
should
>      provide a discussion on why this hashing algorithm provides a =
good
>      distribiution of flows.
> =20
> https://datatracker.ietf.org/doc/html/rfc8584#section-3 defines most =
of the base HRW draft and its benefit . Do you expect it to be repeated =
in this draft too ? This draft does not change the base HRW algorithm =
but adds flow information as also an input parameter to calculate the =
weight ?

You shouldn=E2=80=99t include a formula in a document where the elements =
are not explained, acronyms are not expanded, and references are not =
provided.=20

You could reference the RFC 8584 discussion of why the algorithm =
provides a good distribution of traffic this reference should be =
accompanied with text explaining how these benefits extend to individual =
multicast flows.

Thanks,
Acee




> =20
> Please let me know if you want only reference to be given or content =
to be copied here ?
> =20
> Mankamana=20
> =20
> From: Acee Lindem <acee.ietf@gmail.com>
> Date: Friday, July 21, 2023 at 2:43 PM
> To: Routing ADs <rtg-ads@ietf.org>, =
draft-ietf-bess-evpn-per-mcast-flow-df-election@ietf.org =
<draft-ietf-bess-evpn-per-mcast-flow-df-election@ietf.org>
> Cc: bess@ietf.org <bess@ietf.org>, Routing Directorate =
<rtg-dir@ietf.org>
> Subject: Routing Directorate early review for =
draft-ietf-bess-evpn-per-mcast-flow-df-election-09
>=20
> Hello,
>=20
> I have been selected as the Routing Directorate reviewer for this =
draft.
> The Routing Directorate seeks to review all routing or routing-related
> drafts as they pass through IETF last call and IESG review, and
> sometimes on special request. The purpose of the review is to provide
> assistance to the Routing ADs. For more information about the Routing
> Directorate, please see:
>=20
>   http://trac.tools.ietf.org/area/rtg/trac/wiki/RtgDir
>=20
> Although these comments are primarily for the use of the Routing ADs,
> it would be helpful if you could consider them along with any other
> IETF Early Review/Last Call  comments that you receive, and strive to
> resolve them through discussion or by updating the draft.
>=20
> Document: draft-ietf-bess-evpn-per-mcast-flow-df-election-09
> Reviewer: Acee Lindem
> Review Date: 07/20/2023
> IETF LC End Date: N/A
> Intended Status: Standards Track
>=20
> Summary:
> This document describes a per-multicast-flow DF election mechanism
> which support per multicast flow load-balancing of the EVPN ES
> forwarding amongst PEs in a redundancy group. While the document =
describes
> a fairly straightforward function, it really needs some editing and =
never
> should have been adopted as a WG document in this condition. =
Consequently,
> I have entered a =E2=80=9CNot Ready=E2=80=9D disposition for the =
review.=20
>=20
>=20
> Major Issues:
>   1. Precisely explain the hashing algorithm in section 4.1 and 4.2. =
As
>      written, they subject to multiple interpretations. Provide a =
reference
>      to CRC_32() and expand acronyms on first use (e.g., MSB).
>=20
>   2. In addition to explaining the hashing algorithm, the document =
should
>      provide a discussion on why this hashing algorithm provides a =
good
>      distribiution of flows.
>=20
>  3. While this is a minor comment, it also pertains to the hashing
>     algorithm. To better distribute the flows, why not exclude the =
current
>     BUM DF from the list of PEs from which to choose a per-flow DF??
>=20
>=20
> Minor Issues:
>=20
>   1. Acronyms from RFC 7432 and RFC 8584 used without first expansion.
>      For example, none of the acronyms in the figures are defined. I'd
>      suggest adding a glossary with terms from other documents.
>   2. The acronym "Es" is used for Ethernet Segment when ES is used in
>      other EVPN documents.
>   3. Missing articles make the text unwieldy to read.
>   4. Multiple problems with agreement of subject and verb.
>   5. Define what is referred to by DFn. Presumably, this is the =
selected
>      PE in the redundancy group.
>   5. Number 5 in section 5 doesn't make sense as written. I was trying =
to
>      fix it but it needs attention from the author.
>   6. The abstract cannot include RFC references from the draft. =
However,
>      the RFCs may be referenced without the braces.
>   7. The security considerations for RFC 8584 are also applicable. =
Additionally,
>      you that you are going to be asked for a discussion of how the =
existing
>      security mechanisms apply to per-flow DF selection, so you might =
as well
>      provide it now.
>=20
>=20
> Nits: See diff below.
>=20
> Thanks,
> Acee
>=20
>=20
> *** draft-ietf-bess-evpn-per-mcast-flow-df-election-09.txt.orig Wed =
Jul 19 11:43:37 2023
> --- draft-ietf-bess-evpn-per-mcast-flow-df-election-09.txt      Wed =
Jul 19 12:21:57 2023
> ***************
> *** 18,33 ****
>=20
>   Abstract
>=20
> !    [RFC7432] describes mechanism to elect designated forwarder (DF) =
at
>      the granularity of (ESI, EVI) which is per VLAN (or per group of
>      VLANs in case of VLAN bundle or VLAN-aware bundle service).  =
However,
>      the current level of granularity of per-VLAN is not adequate for =
some
> !    applications.[RFC8584] improves base line DF election by =
introducing
> !    HRW DF election.  [RFC9251] introduces applicability of EVPN to
> !    Multicast flows, routes to sync them and a default DF election.  =
This
> !    document is an extension to HRW base draft [RFC8584] and further
>      enhances HRW algorithm for the Multicast flows to do DF election =
at
> !    the granularity of (ESI, VLAN, Mcast flow).
>=20
>   Status of This Memo
>=20
> --- 18,33 ----
>=20
>   Abstract
>=20
> !    RFC7432 describes mechanism to elect a designated forwarder (DF) =
at
>      the granularity of (ESI, EVI) which is per VLAN (or per group of
>      VLANs in case of VLAN bundle or VLAN-aware bundle service).  =
However,
>      the current level of granularity of per-VLAN is not adequate for =
some
> !    applications. RFC8584 improves the base DF election by =
introducing
> !    Highest Random Weigth (HRW) DF election.  RFC9251 introduces =
applicability of EVPN to
> !    Multicast flows, routes to sync them, and a default DF election.  =
This
> !    document is an extension to HRW base draft and further
>      enhances HRW algorithm for the Multicast flows to do DF election =
at
> !    the granularity of (ESI, VLAN, Multicast flow).
>=20
>   Status of This Memo
>=20
> ***************
> *** 91,104 ****
>      deployments as well as service provider access/aggregation =
networks.
>      [RFC7432] defines the role of a designated forwarder as the node =
in
>      the redundancy group that is responsible to forward Broadcast,
> !    Unknown unicast, Multicast (BUM) traffic on that Ethernet Segment =
(CE
> !    device or network) in All-Active multi-homing.
>=20
>      The default DF election mechanism allows selecting a DF at the
>      granularity of (ES, VLAN) or (ES, VLAN bundle) for BUM traffic.
> !    While [RFC8584] improve on the default DF election procedure, =
some
>      service provider residential applications require a finer
> !    granularity, where whole multicast flows are delivered on a =
single
>      VLAN.
>=20
>=20
> --- 91,104 ----
>      deployments as well as service provider access/aggregation =
networks.
>      [RFC7432] defines the role of a designated forwarder as the node =
in
>      the redundancy group that is responsible to forward Broadcast,
> !    Unknown unicast, Multicast (BUM) traffic on that Ethernet Segment
> !    (Customer Edge (CE) device or network) in All-Active =
multi-homing.
>=20
>      The default DF election mechanism allows selecting a DF at the
>      granularity of (ES, VLAN) or (ES, VLAN bundle) for BUM traffic.
> !    While [RFC8584] improves on the default DF election procedure, =
some
>      service provider residential applications require a finer
> !    granularity, where specific multicast flows are delivered on a =
single
>      VLAN.
>=20
>=20
> ***************
> *** 154,161 ****
>=20
>      Consider the above topology, which shows a typical residential
>      deployment scenario, where multiple receivers are behind an all-
> !    active multihoming segments.  All of the multicast traffic is
> !    provisioned on EVI-1.  Assume PE-2 get elected as DF.  According =
to
>      [RFC7432], PE-2 will be responsible for forwarding multicast =
traffic
>      to that Ethernet segment.
>=20
> --- 154,161 ----
>=20
>      Consider the above topology, which shows a typical residential
>      deployment scenario, where multiple receivers are behind an all-
> !    active multihoming segment.  All of the multicast traffic is
> !    provisioned on EVI-1.  Assume PE-2 gets elected as DF.  According =
to
>      [RFC7432], PE-2 will be responsible for forwarding multicast =
traffic
>      to that Ethernet segment.
>=20
> ***************
> *** 172,194 ****
>=20
>      *  Forcing sole data plane forwarding responsibility on PE-2 is a
>         limitation in the current DF election mechanism.  The topology =
at
> !       Figure 1 would always have only one of the PE to be elected as =
DF
> !       irrespective of which current DF election mechanism is in use
> !       defined in [RFC7432] or [RFC8584].
>=20
>      *  The problem may also manifest itself in a different way.  For
>         example, AC1 happens to use 80% of its available bandwidth to
>         forward unicast data.  And now there is need to serve =
multicast
> !       receivers where it would require more than 20% of AC1 =
bandwidth.
>         In this case, AC1 becomes oversubscribed and multicast traffic
>         drop would be observed even though there is already another =
link
> !       (AC2) present in network which can be used more efficiently =
load
>         balance the multicast traffic.
>=20
> !    In this document, we propose an extension to the HRW base draft =
to
>      allow DF election at the granularity of (ESI, VLAN, Mcast flow) =
which
> !    would allow multicast flows to be better distributed among =
redundancy
> !    group PEs to share the load.
>=20
>   2.  Terminology
>=20
> --- 172,194 ----
>=20
>      *  Forcing sole data plane forwarding responsibility on PE-2 is a
>         limitation in the current DF election mechanism.  The topology =
at
> !       Figure 1 would always have only one of the PEs elected as DF
> !       irrespective of which DF election mechanism (defined in =
[RFC7432]
> !       or [RFC8584]) is in use.
>=20
>      *  The problem may also manifest itself in a different way.  For
>         example, AC1 happens to use 80% of its available bandwidth to
>         forward unicast data.  And now there is need to serve =
multicast
> !       receivers where it would require more than 20% of AC1's =
bandwidth.
>         In this case, AC1 becomes oversubscribed and multicast traffic
>         drop would be observed even though there is already another =
link
> !       (AC2) present in network which can be used more efficiently to =
load
>         balance the multicast traffic.
>=20
> !    In this document, we define an extension to the HRW base =
[RFC8584] to
>      allow DF election at the granularity of (ESI, VLAN, Mcast flow) =
which
> !    would allow multicast flows to be better distributed among PEs in =
a
> !    redundancy group to share the load.
>=20
>   2.  Terminology
>=20
> ***************
> *** 201,212 ****
>=20
>   3.  The DF Election Extended Community
>=20
> !    [RFC8584] defines an extended community, which would be used for =
PEs
>      in redundancy group to reach a consensus as to which DF election
>      procedure is desired.  A PE can notify other participating PEs in
> !    redundancy group about its willingness to support Per multicast =
flow
>      base DF election capability by signaling a DF election extended
> !    community along with Ethernet-Segment Route (Type-4).  The =
current
>      proposal extends the existing extended community defined in
>      [RFC8584].  This draft defines new a DF type.
>=20
> --- 201,212 ----
>=20
>   3.  The DF Election Extended Community
>=20
> !    [RFC8584] defines an extended community, which is used by PEs
>      in redundancy group to reach a consensus as to which DF election
>      procedure is desired.  A PE can notify other participating PEs in
> !    the redundancy group as to its willingness to support =
per-multicast-flow
>      base DF election capability by signaling a DF election extended
> !    community along with an Ethernet-Segment Route (Type-4).  The =
current
>      proposal extends the existing extended community defined in
>      [RFC8584].  This draft defines new a DF type.
>=20
> ***************
> *** 229,254 ****
>         -  Type 5: HRW base per (*,G) multicast flow DF election
>            (explained in this document)
>=20
> !    *  The [RFC8584] describes encoding of capabilities associated to =
the
> !       DF election algorithm using Bitmap field.  When these =
capabilities
>         bits are set along with the DF type-4 and type-5, they need to =
be
> !       interpreted in context of this new DF type-4 and type-5.  For
>         example, consider a scenario where all PEs in the same =
redundancy
> !       group (same ES) can support both AC-DF, DF type-4 and DF =
type-5
>         and receive such indications from the other PEs in the ES.  In
>         this scenario, if a VLAN is not active in a PE, then the DF
>         election procedure on all PEs in the ES should factor that in =
and
> !       exclude that PE in the DF election per multicast flow.
>=20
> !    *  A PE SHOULD attach the DF election Extended Community to ES =
route
> !       and Extended Community MUST be sent if the ES is locally
> !       configured for DF type Per Multicast flow DF election.  Only =
one
> !       DF Election Extended community can be sent along with an ES =
route.
>=20
>      *  When a PE receives the ES Routes from all the other PEs for =
the
>         ES, it checks if all of other PEs have advertised their desire =
to
> !       proceed by Per multicast flow DF election.  If all peering PEs
> !       have done so, it performs DF election based on Per multicast =
flow
>         procedure.  But if:
>=20
>         -  There is at least one PE which advertised route-4 ( AD per =
ES
> --- 229,254 ----
>         -  Type 5: HRW base per (*,G) multicast flow DF election
>            (explained in this document)
>=20
> !    *  [RFC8584] describes encoding of capabilities associated to the
> !       DF election algorithm using a Bitmap field.  When these =
capabilities
>         bits are set along with the DF type-4 and type-5, they need to =
be
> !       interpreted in context of the DF type-4 and type-5.  For
>         example, consider a scenario where all PEs in the same =
redundancy
> !       group (same ES) can support both AC-DF, DF type-4, and DF =
type-5
>         and receive such indications from the other PEs in the ES.  In
>         this scenario, if a VLAN is not active in a PE, then the DF
>         election procedure on all PEs in the ES should factor that in =
and
> !       exclude that PE in the per-multicast-flow DF election.
>=20
> !    *  A PE SHOULD attach the DF election Extended Community to an ES =
route
> !       and the Extended Community MUST be sent if the ES is locally
> !       configured for DF type Per-Multicast-flow DF election.  Only =
one
> !       DF Election Extended community can be sent with an ES route.
>=20
>      *  When a PE receives the ES Routes from all the other PEs for =
the
>         ES, it checks if all of other PEs have advertised their desire =
to
> !       proceed with Per-multicast-flow DF election.  If all peering =
PEs
> !       have done so, it performs DF election based on the =
Per-multicast-flow
>         procedure.  But if:
>=20
>         -  There is at least one PE which advertised route-4 ( AD per =
ES
> ***************
> *** 258,264 ****
>         -  There is at least one PE signaling single active in the AD =
per
>            ES route
>=20
> !       it MUST be considered as an indication to support of only =
Default
>         DF election [RFC7432] and DF election procedure in [RFC7432] =
MUST
>         be used.
>=20
> --- 258,264 ----
>         -  There is at least one PE signaling single active in the AD =
per
>            ES route
>=20
> !       it MUST be considered as an indication to support of only the =
Default
>         DF election [RFC7432] and DF election procedure in [RFC7432] =
MUST
>         be used.
>=20
> ***************
> *** 268,276 ****
>      repeat the description of HRW algorithm itself.
>=20
>      EVPN PE does the discovery of redundancy groups based on =
[RFC7432].
> !    If redundancy group consists of N peering EVPN PE nodes, after =
the
> !    discovery all PEs build an unordered list of IP address of all =
the
> !    nodes in the redundancy group.  The procedure defined in this =
draft
>      does not require the list of PEs to be ordered.  Address [i] =
denotes
>      the IP address of the [i]th EVPN PE in redundancy group where (0 =
< i
>      <=3D N ).
> --- 268,276 ----
>      repeat the description of HRW algorithm itself.
>=20
>      EVPN PE does the discovery of redundancy groups based on =
[RFC7432].
> !    If a redundancy group consists of N peering EVPN PE nodes, after =
the
> !    discovery all PEs, build an unordered list of IP address of all =
the
> !    nodes in the redundancy group.  The procedure defined in this =
document
>      does not require the list of PEs to be ordered.  Address [i] =
denotes
>      the IP address of the [i]th EVPN PE in redundancy group where (0 =
< i
>      <=3D N ).
> ***************
> *** 284,290 ****
>=20
>   4.1.  DF election for IGMP (S,G) membership request
>=20
> !    The DF is the PE who has maximum weight for (S, G, V, Es) where
>=20
>      *  S - Multicast Source
>=20
> --- 284,290 ----
>=20
>   4.1.  DF election for IGMP (S,G) membership request
>=20
> !    The DF is the PE who has maximum weight for (S, G, V, ES) where
>=20
>      *  S - Multicast Source
>=20
> ***************
> *** 292,309 ****
>=20
>      *  V - VLAN ID.
>=20
> !    *  Es - Ethernet Segment Identifier
>=20
>      Address[i] is address of the ith PE.  The PEs IP address length =
does
>      not matter as only the lower-order 31 bits are modulo =
significant.
>=20
>      1.  Weight
>=20
> !        *  The weight of PE(i) to (S,G,VLAN ID, Es) is calculated by
> !           function, weight (S,G,V, Es, Address(i)), where (0 < i <=3D =
N),
>             PE(i) is the PE at ordinal i.
>=20
> !        *  Weight (S,G,V, Es, Address(i)) =3D (1103515245.
>             ((1103515245.Address(i) + 12345) XOR D(S,G,V,ESI))+12345) =
(mod
>             2^31)
>=20
> --- 292,309 ----
>=20
>      *  V - VLAN ID.
>=20
> !    *  ES - Ethernet Segment Identifier
>=20
>      Address[i] is address of the ith PE.  The PEs IP address length =
does
>      not matter as only the lower-order 31 bits are modulo =
significant.
>=20
>      1.  Weight
>=20
> !        *  The weight of PE(i) to (S,G,VLAN ID, ES) is calculated by
> !           function, weight (S,G,V, ES, Address(i)), where (0 < i <=3D =
N),
>             PE(i) is the PE at ordinal i.
>=20
> !        *  Weight (S,G,V, ES, Address(i)) =3D (1103515245.
>             ((1103515245.Address(i) + 12345) XOR D(S,G,V,ESI))+12345) =
(mod
>             2^31)
>=20
> ***************
> *** 312,333 ****
>=20
>      2.  Digest
>=20
> !        *  D(S,G,V, Es) =3D CRC_32(S,G,V, Es)
>=20
> !        *  Here D(S,G,V,Es) is the 31-bit digest (CRC_32 and =
discarding
> !           the MSB) of the Source IP, Group IP, Vlan ID and Es.  The =
CRC
>             MUST proceed as if the architecture is in network byte =
order
>             (big-endian).
>=20
>   4.2.  DF election for IGMP (*,G) membership request
>=20
> !    The DF is the PE who has maximum weight for (G, V, Es) where
>=20
>      *  G - Multicast Group
>=20
>      *  V - VLAN ID.
>=20
> !    *  Es - Ethernet Segment Identifier
>=20
>=20
>=20
> --- 312,333 ----
>=20
>      2.  Digest
>=20
> !        *  D(S,G,V, ES) =3D CRC_32(S,G,V, ES)
>=20
> !        *  Here D(S,G,V,ES) is the 31-bit digest (CRC_32 and =
discarding
> !           the MSB) of the Source IP, Group IP, Vlan ID and ES.  The =
CRC
>             MUST proceed as if the architecture is in network byte =
order
>             (big-endian).
>=20
>   4.2.  DF election for IGMP (*,G) membership request
>=20
> !    The DF is the PE who has maximum weight for (G, V, ES) where
>=20
>      *  G - Multicast Group
>=20
>      *  V - VLAN ID.
>=20
> !    *  ES - Ethernet Segment Identifier
>=20
>=20
>=20
> ***************
> *** 343,353 ****
>=20
>      1.  Weight
>=20
> !        *  The weight of PE(i) to (G,VLAN ID, Es) is calculated by
> !           function, weight (G,V, Es, Address(i)), where (0 < i <=3D =
N),
>             PE(i) is the PE at ordinal i.
>=20
> !        *  Weight (G,V, Es, Address(i)) =3D (1103515245.
>             ((1103515245.Address(i) + 12345) XOR D(G,V,ESI))+12345) =
(mod
>             2^31)
>=20
> --- 343,353 ----
>=20
>      1.  Weight
>=20
> !        *  The weight of PE(i) to (G,VLAN ID, ES) is calculated by
> !           function, weight (G,V, ES, Address(i)), where (0 < i <=3D =
N),
>             PE(i) is the PE at ordinal i.
>=20
> !        *  Weight (G,V, ES, Address(i)) =3D (1103515245.
>             ((1103515245.Address(i) + 12345) XOR D(G,V,ESI))+12345) =
(mod
>             2^31)
>=20
> ***************
> *** 356,376 ****
>=20
>      2.  Digest
>=20
> !        *  D(G,V, Es) =3D CRC_32(G,V, Es)
>=20
> !        *  Here D(G,V,Es) is the 31-bit digest (CRC_32 and discarding =
the
> !           MSB) of the Group IP, Vlan ID and Es.  The CRC MUST =
proceed as
>             if the architecture is in network byte order (big-endian).
>=20
>   4.3.  Default DF election procedure
>=20
> !    Per multicast DF election procedure would be applicable only when
> !    host behind Attachment Circuit (of the Es) start sending IGMP
> !    membership requests.  Membership requests are synced using =
procedure
> !    defined in [RFC9251], and each of the PE in redundancy group can =
use
> !    per flow DF election and create DF state per multicast flow.  The =
HRW
>      DF election "Type 1" procedure defined in [RFC8584] MUST be used =
for
> !    the Es DF election and SHOULD be performed on Es even before =
learning
>      multicast membership request state.  This default election =
procedure
>      MUST be used at port level but will be overwritten by Per flow DF
>      election as and when new membership request state are learnt.
> --- 356,376 ----
>=20
>      2.  Digest
>=20
> !        *  D(G,V, ES) =3D CRC_32(G,V, Es)
>=20
> !        *  Here D(G,V,ES) is the 31-bit digest (CRC_32 and discarding =
the
> !           MSB) of the Group IP, Vlan ID and ES.  The CRC MUST =
proceed as
>             if the architecture is in network byte order (big-endian).
>=20
>   4.3.  Default DF election procedure
>=20
> !    Per-multicast-flow DF election procedure would be applicable only =
when
> !    host behind the Attachment Circuit (of the ES) starts sending =
IGMP
> !    membership requests.  Membership requests are synced using the =
procedure
> !    defined in [RFC9251], and each of the PEs in a redundancy group =
can use
> !    per-multicast-flow DF election and create DF state per multicast =
flow.  The HRW
>      DF election "Type 1" procedure defined in [RFC8584] MUST be used =
for
> !    the ES DF election and SHOULD be performed on ES even before =
learning
>      multicast membership request state.  This default election =
procedure
>      MUST be used at port level but will be overwritten by Per flow DF
>      election as and when new membership request state are learnt.
> ***************
> *** 394,400 ****
>   Internet-Draft   Per multicast flow Designated Forwarder       July =
2023
>=20
>=20
> !                                      Multicast  Source
>                                                |
>                                                |
>                                                |
> --- 394,400 ----
>   Internet-Draft   Per multicast flow Designated Forwarder       July =
2023
>=20
>=20
> !                                      Multicast Source
>                                                |
>                                                |
>                                                |
> ***************
> *** 436,446 ****
>          Route.  This draft does not change any of this procedure, it
>          still uses the procedure defined in [RFC7432].
>=20
> !    2.  Each of the PEs in redundancy group advertise Ethernet =
segment
> !        route with extended community indicating their ability to
> !        participate in per multicast flow DF election procedure.  =
Since
> !        Per multicast flow would not be applicable unless PE learns =
about
> !        membership request from receiver, there is a need to have the
>          default DF election among PEs in redundancy group for BUM
>=20
>=20
> --- 436,446 ----
>          Route.  This draft does not change any of this procedure, it
>          still uses the procedure defined in [RFC7432].
>=20
> !    2.  Each of the PEs in the redundancy group advertise an Ethernet =
segment
> !        route with an extended community indicating their ability to
> !        participate in per-multicast-flow DF election procedure.  =
Since
> !        Per multicast flow would not be applicable unless the PE =
learns about
> !        muilticast membership from a receiver, there is a need to =
have the
>          default DF election among PEs in redundancy group for BUM
>=20
>=20
> ***************
> *** 450,484 ****
>   Internet-Draft   Per multicast flow Designated Forwarder       July =
2023
>=20
>=20
> !        traffic.  Until multicast membership state are learnt, we use =
the
> !        the DF election procedure in Section 4.3, namely HRW per =
(v,Es)
>          as defined in [RFC8584] .
>=20
>      3.  When a receiver starts sending membership requests for =
(s1,g1),
> !        where s1 is multicast source address and g1 is multicast =
group
>          address, CE-1 could hash membership request (IGMP join) to =
any of
>          the PEs in redundancy group.  Let's consider it is hashed to =
PE-
>          2.  [RFC9251] defines a procedure to sync IGMP join state =
among
> !        redundancy group of PEs.  Now each of the PE would have
> !        information about membership request (s1,g1) and each of them =
run
> !        DF election procedure Section 4.1 to elect DF among =
participating
> !        PEs in redundancy group.  Consider PE-2 gets elected as DF =
for
> !        multicast flow (s1,g1).
>=20
>          1.  PE-1 forwarding state would be nDF for flow (s1,g1) and =
DF
>              for rest other BUM traffic.
>=20
> !        2.  PE-2 forwarding state would be DF for flow (s1,g1) and =
nDF
>              for rest other BUM traffic.
>=20
>          3.  PE-3 forwarding state would be nDF for flow (s1,g1) and =
rest
>              other BUM traffic.
>=20
> !    4.  As and when new multicast membership request comes, same
> !        procedure as above would continue.
>=20
>      5.  If Section 3 has DF type 4, For membership request (S,G) it =
MUST
> !        use Section 4.1 to elect DF among participating PEs.  And
>          membership request (*,G) MUST use Section 4.2 to elect DF =
among
>          participating PEs.
>=20
> --- 450,485 ----
>   Internet-Draft   Per multicast flow Designated Forwarder       July =
2023
>=20
>=20
> !        traffic.  Until multicast membership state is learnt, we use =
the
> !        the DF election procedure in Section 4.3, namely HRW per =
(v,ES)
>          as defined in [RFC8584] .
>=20
>      3.  When a receiver starts sending membership requests for =
(s1,g1),
> !        where s1 is a multicast source address and g1 is a multicast =
group
>          address, CE-1 could hash membership request (IGMP join) to =
any of
>          the PEs in redundancy group.  Let's consider it is hashed to =
PE-
>          2.  [RFC9251] defines a procedure to sync IGMP join state =
among
> !        PEs in a redundancy group.  Now each of the PE would have
> !        information about the membership request (s1,g1) and each of =
them would run
> !        the DF election procedure (refer to Section 4.1)( to elect
> !        a DF among participating  PEs in the redundancy group.  =
Consider PE-2
> !        gets elected as DF for multicast flow (s1,g1).
>=20
>          1.  PE-1 forwarding state would be nDF for flow (s1,g1) and =
DF
>              for rest other BUM traffic.
>=20
> !        2.  PE-2 forwarding state would be the DF for flow (s1,g1) =
and nDF
>              for rest other BUM traffic.
>=20
>          3.  PE-3 forwarding state would be nDF for flow (s1,g1) and =
rest
>              other BUM traffic.
>=20
> !    4.  When a new multicast membership request arrives, the same
> !        procedure as above would used to selected a nDF for the
> !        multicast flow.
>=20
>      5.  If Section 3 has DF type 4, For membership request (S,G) it =
MUST
> !        use Section 4.1 to elect a DF among participating PEs.  And
>          membership request (*,G) MUST use Section 4.2 to elect DF =
among
>          participating PEs.
>=20
> ***************
> *** 487,494 ****
>      There are multiple triggers which can cause DF re-election.  Some =
of
>      the triggers could be
>=20
> !    1.  Local ES going down due to physical failure or configuration
> !        change triggers DF re-election at peering PE.
>=20
>      2.  Detection of new PE through ES route.
>=20
> --- 488,495 ----
>      There are multiple triggers which can cause DF re-election.  Some =
of
>      the triggers could be
>=20
> !    1.  Local ES going down due to physical failure or a =
configuration
> !        change that triggers DF re-election at peering PE.
>=20
>      2.  Detection of new PE through ES route.
>=20
> ***************
> *** 509,515 ****
>      6.  Local configuration change of DF election Type and peering PE
>          consensus on new DF Type
>=20
> !    This document does not provide any new mechanism to handle DF re-
>      election procedure.  It uses the existing mechanism defined in
>      [RFC7432].  Whenever either of the triggers occur, a DF =
re-election
>      would be done. and all of the flows would be redistributed among
> --- 510,516 ----
>      6.  Local configuration change of DF election Type and peering PE
>          consensus on new DF Type
>=20
> !    This document does not provide any new mechanisms to handle DF =
re-
>      election procedure.  It uses the existing mechanism defined in
>      [RFC7432].  Whenever either of the triggers occur, a DF =
re-election
>      would be done. and all of the flows would be redistributed among
>=20


--Apple-Mail=_79F6C49D-1B93-4858-8972-44816CC04C04
Content-Transfer-Encoding: quoted-printable
Content-Type: text/html;
	charset=utf-8

<html><head><meta http-equiv=3D"content-type" content=3D"text/html; =
charset=3Dutf-8"></head><body style=3D"overflow-wrap: break-word; =
-webkit-nbsp-mode: space; line-break: after-white-space;">Hi =
Mankamana,&nbsp;<br><div><br><blockquote type=3D"cite"><div>On Aug 1, =
2023, at 17:44, Mankamana Mishra (mankamis) &lt;mankamis@cisco.com&gt; =
wrote:</div><br class=3D"Apple-interchange-newline"><div><meta =
charset=3D"UTF-8"><div class=3D"WordSection1" style=3D"page: =
WordSection1; caret-color: rgb(0, 0, 0); font-family: Helvetica; =
font-size: 12px; font-style: normal; font-variant-caps: normal; =
font-weight: 400; letter-spacing: normal; text-align: start; =
text-indent: 0px; text-transform: none; white-space: normal; =
word-spacing: 0px; -webkit-text-stroke-width: 0px; text-decoration: =
none;"><div style=3D"margin: 0in; font-size: 11pt; font-family: Calibri, =
sans-serif;">Hi Acee,<span =
class=3D"Apple-converted-space">&nbsp;</span><o:p></o:p></div><div =
style=3D"margin: 0in; font-size: 11pt; font-family: Calibri, =
sans-serif;">Thanks for reviewing and comment. &nbsp;While I make =
changes to existing draft based on your comments, &nbsp;I had question =
on some of the comments<o:p></o:p></div><div style=3D"margin: 0in; =
font-size: 11pt; font-family: Calibri, =
sans-serif;"><o:p>&nbsp;</o:p></div><div style=3D"margin: 0in; =
font-size: 11pt; font-family: Calibri, sans-serif;">&nbsp; 1. Precisely =
explain the hashing algorithm in section 4.1 and 4.2. =
As<br>&nbsp;&nbsp;&nbsp;&nbsp; written, they subject to multiple =
interpretations. Provide a reference<br>&nbsp;&nbsp;&nbsp;&nbsp; to =
CRC_32() and expand acronyms on first use (e.g., MSB).<br><br>&nbsp; 2. =
In addition to explaining the hashing algorithm, the document =
should<br>&nbsp;&nbsp;&nbsp;&nbsp; provide a discussion on why this =
hashing algorithm provides a good<br>&nbsp;&nbsp;&nbsp;&nbsp; =
distribiution of flows.<o:p></o:p></div><div style=3D"margin: 0in; =
font-size: 11pt; font-family: Calibri, =
sans-serif;"><o:p>&nbsp;</o:p></div><div style=3D"margin: 0in; =
font-size: 11pt; font-family: Calibri, sans-serif;"><a =
href=3D"https://datatracker.ietf.org/doc/html/rfc8584#section-3" =
style=3D"color: blue; text-decoration: =
underline;">https://datatracker.ietf.org/doc/html/rfc8584#section-3</a><sp=
an class=3D"Apple-converted-space">&nbsp;</span>defines most of the base =
HRW draft and its benefit . Do you expect it to be repeated in this =
draft too ? This draft does not change the base HRW algorithm but adds =
flow information as also an input parameter to calculate the weight =
?</div></div></div></blockquote><div><br></div><div>You shouldn=E2=80=99t =
include a formula in a document where the elements are not explained, =
acronyms are not expanded, and references are not =
provided.&nbsp;</div><div><br></div><div>You could reference the RFC =
8584 discussion of why the algorithm provides a good distribution of =
traffic this reference should be accompanied with text explaining how =
these benefits extend to individual multicast =
flows.</div><div><br></div><div>Thanks,</div><div>Acee</div><div><br></div=
><div><br></div><div><br></div><br><blockquote type=3D"cite"><div><div =
class=3D"WordSection1" style=3D"page: WordSection1; caret-color: rgb(0, =
0, 0); font-family: Helvetica; font-size: 12px; font-style: normal; =
font-variant-caps: normal; font-weight: 400; letter-spacing: normal; =
text-align: start; text-indent: 0px; text-transform: none; white-space: =
normal; word-spacing: 0px; -webkit-text-stroke-width: 0px; =
text-decoration: none;"><div style=3D"margin: 0in; font-size: 11pt; =
font-family: Calibri, sans-serif;"><o:p></o:p></div><div style=3D"margin: =
0in; font-size: 11pt; font-family: Calibri, =
sans-serif;"><o:p>&nbsp;</o:p></div><div style=3D"margin: 0in; =
font-size: 11pt; font-family: Calibri, sans-serif;">Please let me know =
if you want only reference to be given or content to be copied here =
?<o:p></o:p></div><div style=3D"margin: 0in; font-size: 11pt; =
font-family: Calibri, sans-serif;"><o:p>&nbsp;</o:p></div><div =
style=3D"margin: 0in; font-size: 11pt; font-family: Calibri, =
sans-serif;">Mankamana<span =
class=3D"Apple-converted-space">&nbsp;</span><o:p></o:p></div><div =
style=3D"margin: 0in; font-size: 11pt; font-family: Calibri, =
sans-serif;"><o:p>&nbsp;</o:p></div><div =
id=3D"mail-editor-reference-message-container"><div><div =
style=3D"border-width: 1pt medium medium; border-style: solid none none; =
border-color: rgb(181, 196, 223) currentcolor currentcolor; =
border-image: none; padding: 3pt 0in 0in;"><p class=3D"MsoNormal" =
style=3D"margin: 0in 0in 12pt; font-size: 11pt; font-family: Calibri, =
sans-serif;"><b><span style=3D"font-size: 12pt;">From:<span =
class=3D"Apple-converted-space">&nbsp;</span></span></b><span =
style=3D"font-size: 12pt;">Acee Lindem =
&lt;acee.ietf@gmail.com&gt;<br><b>Date:<span =
class=3D"Apple-converted-space">&nbsp;</span></b>Friday, July 21, 2023 =
at 2:43 PM<br><b>To:<span =
class=3D"Apple-converted-space">&nbsp;</span></b>Routing ADs =
&lt;rtg-ads@ietf.org&gt;, =
draft-ietf-bess-evpn-per-mcast-flow-df-election@ietf.org =
&lt;draft-ietf-bess-evpn-per-mcast-flow-df-election@ietf.org&gt;<br><b>Cc:=
<span class=3D"Apple-converted-space">&nbsp;</span></b>bess@ietf.org =
&lt;bess@ietf.org&gt;, Routing Directorate =
&lt;rtg-dir@ietf.org&gt;<br><b>Subject:<span =
class=3D"Apple-converted-space">&nbsp;</span></b>Routing Directorate =
early review for =
draft-ietf-bess-evpn-per-mcast-flow-df-election-09<o:p></o:p></span></p></=
div><div><p class=3D"MsoNormal" style=3D"margin: 0in 0in 12pt; =
font-size: 11pt; font-family: Calibri, sans-serif;">Hello,<br><br>I have =
been selected as the Routing Directorate reviewer for this draft.<br>The =
Routing Directorate seeks to review all routing or =
routing-related<br>drafts as they pass through IETF last call and IESG =
review, and<br>sometimes on special request. The purpose of the review =
is to provide<br>assistance to the Routing ADs. For more information =
about the Routing<br>Directorate, please see:<br><br>&nbsp;<span =
class=3D"Apple-converted-space">&nbsp;</span><a =
href=3D"http://trac.tools.ietf.org/area/rtg/trac/wiki/RtgDir" =
style=3D"color: blue; text-decoration: =
underline;">http://trac.tools.ietf.org/area/rtg/trac/wiki/RtgDir</a><br><b=
r>Although these comments are primarily for the use of the Routing =
ADs,<br>it would be helpful if you could consider them along with any =
other<br>IETF Early Review/Last Call&nbsp; comments that you receive, =
and strive to<br>resolve them through discussion or by updating the =
draft.<br><br>Document: =
draft-ietf-bess-evpn-per-mcast-flow-df-election-09<br>Reviewer: Acee =
Lindem<br>Review Date: 07/20/2023<br>IETF LC End Date: N/A<br>Intended =
Status: Standards Track<br><br>Summary:<br>This document describes a =
per-multicast-flow DF election mechanism<br>which support per multicast =
flow load-balancing of the EVPN ES<br>forwarding amongst PEs in a =
redundancy group. While the document describes<br>a fairly =
straightforward function, it really needs some editing and =
never<br>should have been adopted as a WG document in this condition. =
Consequently,<br>I have entered a =E2=80=9CNot Ready=E2=80=9D =
disposition for the review.<span =
class=3D"Apple-converted-space">&nbsp;</span><br><br><br>Major =
Issues:<br>&nbsp; 1. Precisely explain the hashing algorithm in section =
4.1 and 4.2. As<br>&nbsp;&nbsp;&nbsp;&nbsp; written, they subject to =
multiple interpretations. Provide a =
reference<br>&nbsp;&nbsp;&nbsp;&nbsp; to CRC_32() and expand acronyms on =
first use (e.g., MSB).<br><br>&nbsp; 2. In addition to explaining the =
hashing algorithm, the document should<br>&nbsp;&nbsp;&nbsp;&nbsp; =
provide a discussion on why this hashing algorithm provides a =
good<br>&nbsp;&nbsp;&nbsp;&nbsp; distribiution of flows.<br><br>&nbsp;3. =
While this is a minor comment, it also pertains to the =
hashing<br>&nbsp;&nbsp;&nbsp; algorithm. To better distribute the flows, =
why not exclude the current<br>&nbsp;&nbsp;&nbsp; BUM DF from the list =
of PEs from which to choose a per-flow DF??<br><br><br>Minor =
Issues:<br><br>&nbsp; 1. Acronyms from RFC 7432 and RFC 8584 used =
without first expansion.<br>&nbsp;&nbsp;&nbsp;&nbsp; For example, none =
of the acronyms in the figures are defined. =
I'd<br>&nbsp;&nbsp;&nbsp;&nbsp; suggest adding a glossary with terms =
from other documents.<br>&nbsp; 2. The acronym "Es" is used for Ethernet =
Segment when ES is used in<br>&nbsp;&nbsp;&nbsp;&nbsp; other EVPN =
documents.<br>&nbsp; 3. Missing articles make the text unwieldy to =
read.<br>&nbsp; 4. Multiple problems with agreement of subject and =
verb.<br>&nbsp; 5. Define what is referred to by DFn. Presumably, this =
is the selected<br>&nbsp;&nbsp;&nbsp;&nbsp; PE in the redundancy =
group.<br>&nbsp; 5. Number 5 in section 5 doesn't make sense as written. =
I was trying to<br>&nbsp;&nbsp;&nbsp;&nbsp; fix it but it needs =
attention from the author.<br>&nbsp; 6. The abstract cannot include RFC =
references from the draft. However,<br>&nbsp;&nbsp;&nbsp;&nbsp; the RFCs =
may be referenced without the braces.<br>&nbsp; 7. The security =
considerations for RFC 8584 are also applicable. =
Additionally,<br>&nbsp;&nbsp;&nbsp;&nbsp; you that you are going to be =
asked for a discussion of how the existing<br>&nbsp;&nbsp;&nbsp;&nbsp; =
security mechanisms apply to per-flow DF selection, so you might as =
well<br>&nbsp;&nbsp;&nbsp;&nbsp; provide it now.<br><br><br>Nits: See =
diff below.<br><br>Thanks,<br>Acee<br><br><br>*** =
draft-ietf-bess-evpn-per-mcast-flow-df-election-09.txt.orig Wed Jul 19 =
11:43:37 2023<br>--- =
draft-ietf-bess-evpn-per-mcast-flow-df-election-09.txt&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp; Wed Jul 19 12:21:57 2023<br>***************<br>*** 18,33 =
****<br><br>&nbsp; Abstract<br><br>!&nbsp;&nbsp;&nbsp; [RFC7432] =
describes mechanism to elect designated forwarder (DF) =
at<br>&nbsp;&nbsp;&nbsp;&nbsp; the granularity of (ESI, EVI) which is =
per VLAN (or per group of<br>&nbsp;&nbsp;&nbsp;&nbsp; VLANs in case of =
VLAN bundle or VLAN-aware bundle service).&nbsp; =
However,<br>&nbsp;&nbsp;&nbsp;&nbsp; the current level of granularity of =
per-VLAN is not adequate for some<br>!&nbsp;&nbsp;&nbsp; =
applications.[RFC8584] improves base line DF election by =
introducing<br>!&nbsp;&nbsp;&nbsp; HRW DF election.&nbsp; [RFC9251] =
introduces applicability of EVPN to<br>!&nbsp;&nbsp;&nbsp; Multicast =
flows, routes to sync them and a default DF election.&nbsp; =
This<br>!&nbsp;&nbsp;&nbsp; document is an extension to HRW base draft =
[RFC8584] and further<br>&nbsp;&nbsp;&nbsp;&nbsp; enhances HRW algorithm =
for the Multicast flows to do DF election at<br>!&nbsp;&nbsp;&nbsp; the =
granularity of (ESI, VLAN, Mcast flow).<br><br>&nbsp; Status of This =
Memo<br><br>--- 18,33 ----<br><br>&nbsp; =
Abstract<br><br>!&nbsp;&nbsp;&nbsp; RFC7432 describes mechanism to elect =
a designated forwarder (DF) at<br>&nbsp;&nbsp;&nbsp;&nbsp; the =
granularity of (ESI, EVI) which is per VLAN (or per group =
of<br>&nbsp;&nbsp;&nbsp;&nbsp; VLANs in case of VLAN bundle or =
VLAN-aware bundle service).&nbsp; However,<br>&nbsp;&nbsp;&nbsp;&nbsp; =
the current level of granularity of per-VLAN is not adequate for =
some<br>!&nbsp;&nbsp;&nbsp; applications. RFC8584 improves the base DF =
election by introducing<br>!&nbsp;&nbsp;&nbsp; Highest Random Weigth =
(HRW) DF election.&nbsp; RFC9251 introduces applicability of EVPN =
to<br>!&nbsp;&nbsp;&nbsp; Multicast flows, routes to sync them, and a =
default DF election.&nbsp; This<br>!&nbsp;&nbsp;&nbsp; document is an =
extension to HRW base draft and further<br>&nbsp;&nbsp;&nbsp;&nbsp; =
enhances HRW algorithm for the Multicast flows to do DF election =
at<br>!&nbsp;&nbsp;&nbsp; the granularity of (ESI, VLAN, Multicast =
flow).<br><br>&nbsp; Status of This Memo<br><br>***************<br>*** =
91,104 ****<br>&nbsp;&nbsp;&nbsp;&nbsp; deployments as well as service =
provider access/aggregation networks.<br>&nbsp;&nbsp;&nbsp;&nbsp; =
[RFC7432] defines the role of a designated forwarder as the node =
in<br>&nbsp;&nbsp;&nbsp;&nbsp; the redundancy group that is responsible =
to forward Broadcast,<br>!&nbsp;&nbsp;&nbsp; Unknown unicast, Multicast =
(BUM) traffic on that Ethernet Segment (CE<br>!&nbsp;&nbsp;&nbsp; device =
or network) in All-Active multi-homing.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; =
The default DF election mechanism allows selecting a DF at =
the<br>&nbsp;&nbsp;&nbsp;&nbsp; granularity of (ES, VLAN) or (ES, VLAN =
bundle) for BUM traffic.<br>!&nbsp;&nbsp;&nbsp; While [RFC8584] improve =
on the default DF election procedure, some<br>&nbsp;&nbsp;&nbsp;&nbsp; =
service provider residential applications require a =
finer<br>!&nbsp;&nbsp;&nbsp; granularity, where whole multicast flows =
are delivered on a single<br>&nbsp;&nbsp;&nbsp;&nbsp; =
VLAN.<br><br><br>--- 91,104 ----<br>&nbsp;&nbsp;&nbsp;&nbsp; deployments =
as well as service provider access/aggregation =
networks.<br>&nbsp;&nbsp;&nbsp;&nbsp; [RFC7432] defines the role of a =
designated forwarder as the node in<br>&nbsp;&nbsp;&nbsp;&nbsp; the =
redundancy group that is responsible to forward =
Broadcast,<br>!&nbsp;&nbsp;&nbsp; Unknown unicast, Multicast (BUM) =
traffic on that Ethernet Segment<br>!&nbsp;&nbsp;&nbsp; (Customer Edge =
(CE) device or network) in All-Active =
multi-homing.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; The default DF election =
mechanism allows selecting a DF at the<br>&nbsp;&nbsp;&nbsp;&nbsp; =
granularity of (ES, VLAN) or (ES, VLAN bundle) for BUM =
traffic.<br>!&nbsp;&nbsp;&nbsp; While [RFC8584] improves on the default =
DF election procedure, some<br>&nbsp;&nbsp;&nbsp;&nbsp; service provider =
residential applications require a finer<br>!&nbsp;&nbsp;&nbsp; =
granularity, where specific multicast flows are delivered on a =
single<br>&nbsp;&nbsp;&nbsp;&nbsp; =
VLAN.<br><br><br>***************<br>*** 154,161 =
****<br><br>&nbsp;&nbsp;&nbsp;&nbsp; Consider the above topology, which =
shows a typical residential<br>&nbsp;&nbsp;&nbsp;&nbsp; deployment =
scenario, where multiple receivers are behind an =
all-<br>!&nbsp;&nbsp;&nbsp; active multihoming segments.&nbsp; All of =
the multicast traffic is<br>!&nbsp;&nbsp;&nbsp; provisioned on =
EVI-1.&nbsp; Assume PE-2 get elected as DF.&nbsp; According =
to<br>&nbsp;&nbsp;&nbsp;&nbsp; [RFC7432], PE-2 will be responsible for =
forwarding multicast traffic<br>&nbsp;&nbsp;&nbsp;&nbsp; to that =
Ethernet segment.<br><br>--- 154,161 =
----<br><br>&nbsp;&nbsp;&nbsp;&nbsp; Consider the above topology, which =
shows a typical residential<br>&nbsp;&nbsp;&nbsp;&nbsp; deployment =
scenario, where multiple receivers are behind an =
all-<br>!&nbsp;&nbsp;&nbsp; active multihoming segment.&nbsp; All of the =
multicast traffic is<br>!&nbsp;&nbsp;&nbsp; provisioned on EVI-1.&nbsp; =
Assume PE-2 gets elected as DF.&nbsp; According =
to<br>&nbsp;&nbsp;&nbsp;&nbsp; [RFC7432], PE-2 will be responsible for =
forwarding multicast traffic<br>&nbsp;&nbsp;&nbsp;&nbsp; to that =
Ethernet segment.<br><br>***************<br>*** 172,194 =
****<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Forcing sole data plane =
forwarding responsibility on PE-2 is =
a<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; limitation in the =
current DF election mechanism.&nbsp; The topology =
at<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Figure 1 would always have =
only one of the PE to be elected as =
DF<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; irrespective of which =
current DF election mechanism is in =
use<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; defined in [RFC7432] or =
[RFC8584].<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; The problem may also =
manifest itself in a different way.&nbsp; =
For<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; example, AC1 happens =
to use 80% of its available bandwidth =
to<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; forward unicast =
data.&nbsp; And now there is need to serve =
multicast<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; receivers where it =
would require more than 20% of AC1 =
bandwidth.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; In this case, =
AC1 becomes oversubscribed and multicast =
traffic<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; drop would be =
observed even though there is already another =
link<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (AC2) present in network =
which can be used more efficiently =
load<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; balance the multicast =
traffic.<br><br>!&nbsp;&nbsp;&nbsp; In this document, we propose an =
extension to the HRW base draft to<br>&nbsp;&nbsp;&nbsp;&nbsp; allow DF =
election at the granularity of (ESI, VLAN, Mcast flow) =
which<br>!&nbsp;&nbsp;&nbsp; would allow multicast flows to be better =
distributed among redundancy<br>!&nbsp;&nbsp;&nbsp; group PEs to share =
the load.<br><br>&nbsp; 2.&nbsp; Terminology<br><br>--- 172,194 =
----<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Forcing sole data plane =
forwarding responsibility on PE-2 is =
a<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; limitation in the =
current DF election mechanism.&nbsp; The topology =
at<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Figure 1 would always have =
only one of the PEs elected as =
DF<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; irrespective of which DF =
election mechanism (defined in =
[RFC7432]<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; or [RFC8584]) is in =
use.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; The problem may also =
manifest itself in a different way.&nbsp; =
For<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; example, AC1 happens =
to use 80% of its available bandwidth =
to<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; forward unicast =
data.&nbsp; And now there is need to serve =
multicast<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; receivers where it =
would require more than 20% of AC1's =
bandwidth.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; In this case, =
AC1 becomes oversubscribed and multicast =
traffic<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; drop would be =
observed even though there is already another =
link<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; (AC2) present in network =
which can be used more efficiently to =
load<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; balance the multicast =
traffic.<br><br>!&nbsp;&nbsp;&nbsp; In this document, we define an =
extension to the HRW base [RFC8584] to<br>&nbsp;&nbsp;&nbsp;&nbsp; allow =
DF election at the granularity of (ESI, VLAN, Mcast flow) =
which<br>!&nbsp;&nbsp;&nbsp; would allow multicast flows to be better =
distributed among PEs in a<br>!&nbsp;&nbsp;&nbsp; redundancy group to =
share the load.<br><br>&nbsp; 2.&nbsp; =
Terminology<br><br>***************<br>*** 201,212 ****<br><br>&nbsp; =
3.&nbsp; The DF Election Extended Community<br><br>!&nbsp;&nbsp;&nbsp; =
[RFC8584] defines an extended community, which would be used for =
PEs<br>&nbsp;&nbsp;&nbsp;&nbsp; in redundancy group to reach a consensus =
as to which DF election<br>&nbsp;&nbsp;&nbsp;&nbsp; procedure is =
desired.&nbsp; A PE can notify other participating PEs =
in<br>!&nbsp;&nbsp;&nbsp; redundancy group about its willingness to =
support Per multicast flow<br>&nbsp;&nbsp;&nbsp;&nbsp; base DF election =
capability by signaling a DF election extended<br>!&nbsp;&nbsp;&nbsp; =
community along with Ethernet-Segment Route (Type-4).&nbsp; The =
current<br>&nbsp;&nbsp;&nbsp;&nbsp; proposal extends the existing =
extended community defined in<br>&nbsp;&nbsp;&nbsp;&nbsp; =
[RFC8584].&nbsp; This draft defines new a DF type.<br><br>--- 201,212 =
----<br><br>&nbsp; 3.&nbsp; The DF Election Extended =
Community<br><br>!&nbsp;&nbsp;&nbsp; [RFC8584] defines an extended =
community, which is used by PEs<br>&nbsp;&nbsp;&nbsp;&nbsp; in =
redundancy group to reach a consensus as to which DF =
election<br>&nbsp;&nbsp;&nbsp;&nbsp; procedure is desired.&nbsp; A PE =
can notify other participating PEs in<br>!&nbsp;&nbsp;&nbsp; the =
redundancy group as to its willingness to support =
per-multicast-flow<br>&nbsp;&nbsp;&nbsp;&nbsp; base DF election =
capability by signaling a DF election extended<br>!&nbsp;&nbsp;&nbsp; =
community along with an Ethernet-Segment Route (Type-4).&nbsp; The =
current<br>&nbsp;&nbsp;&nbsp;&nbsp; proposal extends the existing =
extended community defined in<br>&nbsp;&nbsp;&nbsp;&nbsp; =
[RFC8584].&nbsp; This draft defines new a DF =
type.<br><br>***************<br>*** 229,254 =
****<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; -&nbsp; Type 5: HRW =
base per (*,G) multicast flow DF =
election<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
(explained in this document)<br><br>!&nbsp;&nbsp;&nbsp; *&nbsp; The =
[RFC8584] describes encoding of capabilities associated to =
the<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DF election algorithm using =
Bitmap field.&nbsp; When these =
capabilities<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; bits are set =
along with the DF type-4 and type-5, they need to =
be<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; interpreted in context of =
this new DF type-4 and type-5.&nbsp; =
For<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; example, consider a =
scenario where all PEs in the same =
redundancy<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; group (same ES) can =
support both AC-DF, DF type-4 and DF =
type-5<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; and receive such =
indications from the other PEs in the ES.&nbsp; =
In<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; this scenario, if a =
VLAN is not active in a PE, then the =
DF<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; election procedure on =
all PEs in the ES should factor that in =
and<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; exclude that PE in the DF =
election per multicast flow.<br><br>!&nbsp;&nbsp;&nbsp; *&nbsp; A PE =
SHOULD attach the DF election Extended Community to ES =
route<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; and Extended Community =
MUST be sent if the ES is =
locally<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; configured for DF type =
Per Multicast flow DF election.&nbsp; Only =
one<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DF Election Extended =
community can be sent along with an ES =
route.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; When a PE receives the ES =
Routes from all the other PEs for =
the<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ES, it checks if all =
of other PEs have advertised their desire =
to<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; proceed by Per multicast =
flow DF election.&nbsp; If all peering =
PEs<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; have done so, it performs =
DF election based on Per multicast =
flow<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; procedure.&nbsp; But =
if:<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; -&nbsp; There is =
at least one PE which advertised route-4 ( AD per ES<br>--- 229,254 =
----<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; -&nbsp; Type 5: HRW =
base per (*,G) multicast flow DF =
election<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
(explained in this document)<br><br>!&nbsp;&nbsp;&nbsp; *&nbsp; =
[RFC8584] describes encoding of capabilities associated to =
the<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DF election algorithm using =
a Bitmap field.&nbsp; When these =
capabilities<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; bits are set =
along with the DF type-4 and type-5, they need to =
be<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; interpreted in context of =
the DF type-4 and type-5.&nbsp; =
For<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; example, consider a =
scenario where all PEs in the same =
redundancy<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; group (same ES) can =
support both AC-DF, DF type-4, and DF =
type-5<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; and receive such =
indications from the other PEs in the ES.&nbsp; =
In<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; this scenario, if a =
VLAN is not active in a PE, then the =
DF<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; election procedure on =
all PEs in the ES should factor that in =
and<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; exclude that PE in the =
per-multicast-flow DF election.<br><br>!&nbsp;&nbsp;&nbsp; *&nbsp; A PE =
SHOULD attach the DF election Extended Community to an ES =
route<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; and the Extended =
Community MUST be sent if the ES is =
locally<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; configured for DF type =
Per-Multicast-flow DF election.&nbsp; Only =
one<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DF Election Extended =
community can be sent with an ES route.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; =
*&nbsp; When a PE receives the ES Routes from all the other PEs for =
the<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ES, it checks if all =
of other PEs have advertised their desire =
to<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; proceed with =
Per-multicast-flow DF election.&nbsp; If all peering =
PEs<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; have done so, it performs =
DF election based on the =
Per-multicast-flow<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
procedure.&nbsp; But =
if:<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; -&nbsp; There is =
at least one PE which advertised route-4 ( AD per =
ES<br>***************<br>*** 258,264 =
****<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; -&nbsp; There is at =
least one PE signaling single active in the AD =
per<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ES =
route<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; it MUST be considered =
as an indication to support of only =
Default<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DF election =
[RFC7432] and DF election procedure in [RFC7432] =
MUST<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; be used.<br><br>--- =
258,264 ----<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; -&nbsp; There =
is at least one PE signaling single active in the AD =
per<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; ES =
route<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; it MUST be considered =
as an indication to support of only the =
Default<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DF election =
[RFC7432] and DF election procedure in [RFC7432] =
MUST<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; be =
used.<br><br>***************<br>*** 268,276 =
****<br>&nbsp;&nbsp;&nbsp;&nbsp; repeat the description of HRW algorithm =
itself.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; EVPN PE does the discovery of =
redundancy groups based on [RFC7432].<br>!&nbsp;&nbsp;&nbsp; If =
redundancy group consists of N peering EVPN PE nodes, after =
the<br>!&nbsp;&nbsp;&nbsp; discovery all PEs build an unordered list of =
IP address of all the<br>!&nbsp;&nbsp;&nbsp; nodes in the redundancy =
group.&nbsp; The procedure defined in this =
draft<br>&nbsp;&nbsp;&nbsp;&nbsp; does not require the list of PEs to be =
ordered.&nbsp; Address [i] denotes<br>&nbsp;&nbsp;&nbsp;&nbsp; the IP =
address of the [i]th EVPN PE in redundancy group where (0 &lt; =
i<br>&nbsp;&nbsp;&nbsp;&nbsp; &lt;=3D N ).<br>--- 268,276 =
----<br>&nbsp;&nbsp;&nbsp;&nbsp; repeat the description of HRW algorithm =
itself.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; EVPN PE does the discovery of =
redundancy groups based on [RFC7432].<br>!&nbsp;&nbsp;&nbsp; If a =
redundancy group consists of N peering EVPN PE nodes, after =
the<br>!&nbsp;&nbsp;&nbsp; discovery all PEs, build an unordered list of =
IP address of all the<br>!&nbsp;&nbsp;&nbsp; nodes in the redundancy =
group.&nbsp; The procedure defined in this =
document<br>&nbsp;&nbsp;&nbsp;&nbsp; does not require the list of PEs to =
be ordered.&nbsp; Address [i] denotes<br>&nbsp;&nbsp;&nbsp;&nbsp; the IP =
address of the [i]th EVPN PE in redundancy group where (0 &lt; =
i<br>&nbsp;&nbsp;&nbsp;&nbsp; &lt;=3D N ).<br>***************<br>*** =
284,290 ****<br><br>&nbsp; 4.1.&nbsp; DF election for IGMP (S,G) =
membership request<br><br>!&nbsp;&nbsp;&nbsp; The DF is the PE who has =
maximum weight for (S, G, V, Es) where<br><br>&nbsp;&nbsp;&nbsp;&nbsp; =
*&nbsp; S - Multicast Source<br><br>--- 284,290 ----<br><br>&nbsp; =
4.1.&nbsp; DF election for IGMP (S,G) membership =
request<br><br>!&nbsp;&nbsp;&nbsp; The DF is the PE who has maximum =
weight for (S, G, V, ES) where<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; S =
- Multicast Source<br><br>***************<br>*** 292,309 =
****<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; V - VLAN =
ID.<br><br>!&nbsp;&nbsp;&nbsp; *&nbsp; Es - Ethernet Segment =
Identifier<br><br>&nbsp;&nbsp;&nbsp;&nbsp; Address[i] is address of the =
ith PE.&nbsp; The PEs IP address length does<br>&nbsp;&nbsp;&nbsp;&nbsp; =
not matter as only the lower-order 31 bits are modulo =
significant.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 1.&nbsp; =
Weight<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; The =
weight of PE(i) to (S,G,VLAN ID, Es) is calculated =
by<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
function, weight (S,G,V, Es, Address(i)), where (0 &lt; i &lt;=3D =
N),<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
PE(i) is the PE at ordinal =
i.<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Weight =
(S,G,V, Es, Address(i)) =3D =
(1103515245.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp; ((1103515245.Address(i) + 12345) XOR D(S,G,V,ESI))+12345) =
(mod<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
 2^31)<br><br>--- 292,309 ----<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; V =
- VLAN ID.<br><br>!&nbsp;&nbsp;&nbsp; *&nbsp; ES - Ethernet Segment =
Identifier<br><br>&nbsp;&nbsp;&nbsp;&nbsp; Address[i] is address of the =
ith PE.&nbsp; The PEs IP address length does<br>&nbsp;&nbsp;&nbsp;&nbsp; =
not matter as only the lower-order 31 bits are modulo =
significant.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 1.&nbsp; =
Weight<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; The =
weight of PE(i) to (S,G,VLAN ID, ES) is calculated =
by<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
function, weight (S,G,V, ES, Address(i)), where (0 &lt; i &lt;=3D =
N),<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
PE(i) is the PE at ordinal =
i.<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Weight =
(S,G,V, ES, Address(i)) =3D =
(1103515245.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp; ((1103515245.Address(i) + 12345) XOR D(S,G,V,ESI))+12345) =
(mod<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
 2^31)<br><br>***************<br>*** 312,333 =
****<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 2.&nbsp; =
Digest<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; =
D(S,G,V, Es) =3D CRC_32(S,G,V, =
Es)<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Here =
D(S,G,V,Es) is the 31-bit digest (CRC_32 and =
discarding<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
; the MSB) of the Source IP, Group IP, Vlan ID and Es.&nbsp; The =
CRC<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
MUST proceed as if the architecture is in network byte =
order<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
; (big-endian).<br><br>&nbsp; 4.2.&nbsp; DF election for IGMP (*,G) =
membership request<br><br>!&nbsp;&nbsp;&nbsp; The DF is the PE who has =
maximum weight for (G, V, Es) where<br><br>&nbsp;&nbsp;&nbsp;&nbsp; =
*&nbsp; G - Multicast Group<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; V - =
VLAN ID.<br><br>!&nbsp;&nbsp;&nbsp; *&nbsp; Es - Ethernet Segment =
Identifier<br><br><br><br>--- 312,333 =
----<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 2.&nbsp; =
Digest<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; =
D(S,G,V, ES) =3D CRC_32(S,G,V, =
ES)<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Here =
D(S,G,V,ES) is the 31-bit digest (CRC_32 and =
discarding<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
; the MSB) of the Source IP, Group IP, Vlan ID and ES.&nbsp; The =
CRC<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
MUST proceed as if the architecture is in network byte =
order<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
; (big-endian).<br><br>&nbsp; 4.2.&nbsp; DF election for IGMP (*,G) =
membership request<br><br>!&nbsp;&nbsp;&nbsp; The DF is the PE who has =
maximum weight for (G, V, ES) where<br><br>&nbsp;&nbsp;&nbsp;&nbsp; =
*&nbsp; G - Multicast Group<br><br>&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; V - =
VLAN ID.<br><br>!&nbsp;&nbsp;&nbsp; *&nbsp; ES - Ethernet Segment =
Identifier<br><br><br><br>***************<br>*** 343,353 =
****<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 1.&nbsp; =
Weight<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; The =
weight of PE(i) to (G,VLAN ID, Es) is calculated =
by<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
function, weight (G,V, Es, Address(i)), where (0 &lt; i &lt;=3D =
N),<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
PE(i) is the PE at ordinal =
i.<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Weight =
(G,V, Es, Address(i)) =3D =
(1103515245.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp; ((1103515245.Address(i) + 12345) XOR D(G,V,ESI))+12345) =
(mod<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
 2^31)<br><br>--- 343,353 ----<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 1.&nbsp; =
Weight<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; The =
weight of PE(i) to (G,VLAN ID, ES) is calculated =
by<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
function, weight (G,V, ES, Address(i)), where (0 &lt; i &lt;=3D =
N),<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
PE(i) is the PE at ordinal =
i.<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Weight =
(G,V, ES, Address(i)) =3D =
(1103515245.<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp; ((1103515245.Address(i) + 12345) XOR D(G,V,ESI))+12345) =
(mod<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
 2^31)<br><br>***************<br>*** 356,376 =
****<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 2.&nbsp; =
Digest<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; D(G,V, =
Es) =3D CRC_32(G,V, =
Es)<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Here =
D(G,V,Es) is the 31-bit digest (CRC_32 and discarding =
the<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
MSB) of the Group IP, Vlan ID and Es.&nbsp; The CRC MUST proceed =
as<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
if the architecture is in network byte order (big-endian).<br><br>&nbsp; =
4.3.&nbsp; Default DF election procedure<br><br>!&nbsp;&nbsp;&nbsp; Per =
multicast DF election procedure would be applicable only =
when<br>!&nbsp;&nbsp;&nbsp; host behind Attachment Circuit (of the Es) =
start sending IGMP<br>!&nbsp;&nbsp;&nbsp; membership requests.&nbsp; =
Membership requests are synced using procedure<br>!&nbsp;&nbsp;&nbsp; =
defined in [RFC9251], and each of the PE in redundancy group can =
use<br>!&nbsp;&nbsp;&nbsp; per flow DF election and create DF state per =
multicast flow.&nbsp; The HRW<br>&nbsp;&nbsp;&nbsp;&nbsp; DF election =
"Type 1" procedure defined in [RFC8584] MUST be used =
for<br>!&nbsp;&nbsp;&nbsp; the Es DF election and SHOULD be performed on =
Es even before learning<br>&nbsp;&nbsp;&nbsp;&nbsp; multicast membership =
request state.&nbsp; This default election =
procedure<br>&nbsp;&nbsp;&nbsp;&nbsp; MUST be used at port level but =
will be overwritten by Per flow DF<br>&nbsp;&nbsp;&nbsp;&nbsp; election =
as and when new membership request state are learnt.<br>--- 356,376 =
----<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 2.&nbsp; =
Digest<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; D(G,V, =
ES) =3D CRC_32(G,V, =
Es)<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; *&nbsp; Here =
D(G,V,ES) is the 31-bit digest (CRC_32 and discarding =
the<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
MSB) of the Group IP, Vlan ID and ES.&nbsp; The CRC MUST proceed =
as<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
if the architecture is in network byte order (big-endian).<br><br>&nbsp; =
4.3.&nbsp; Default DF election procedure<br><br>!&nbsp;&nbsp;&nbsp; =
Per-multicast-flow DF election procedure would be applicable only =
when<br>!&nbsp;&nbsp;&nbsp; host behind the Attachment Circuit (of the =
ES) starts sending IGMP<br>!&nbsp;&nbsp;&nbsp; membership =
requests.&nbsp; Membership requests are synced using the =
procedure<br>!&nbsp;&nbsp;&nbsp; defined in [RFC9251], and each of the =
PEs in a redundancy group can use<br>!&nbsp;&nbsp;&nbsp; =
per-multicast-flow DF election and create DF state per multicast =
flow.&nbsp; The HRW<br>&nbsp;&nbsp;&nbsp;&nbsp; DF election "Type 1" =
procedure defined in [RFC8584] MUST be used for<br>!&nbsp;&nbsp;&nbsp; =
the ES DF election and SHOULD be performed on ES even before =
learning<br>&nbsp;&nbsp;&nbsp;&nbsp; multicast membership request =
state.&nbsp; This default election procedure<br>&nbsp;&nbsp;&nbsp;&nbsp; =
MUST be used at port level but will be overwritten by Per flow =
DF<br>&nbsp;&nbsp;&nbsp;&nbsp; election as and when new membership =
request state are learnt.<br>***************<br>*** 394,400 =
****<br>&nbsp; Internet-Draft&nbsp;&nbsp; Per multicast flow Designated =
Forwarder&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; July =
2023<br><br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp; Multicast&nbsp; =
Source<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
|<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
|<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; |<br>--- =
394,400 ----<br>&nbsp; Internet-Draft&nbsp;&nbsp; Per multicast flow =
Designated Forwarder&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; July =
2023<br><br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp; Multicast =
Source<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbs=
p;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
|<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
|<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nb=
sp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp=
;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
|<br>***************<br>*** 436,446 =
****<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Route.&nbsp; =
This draft does not change any of this procedure, =
it<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; still uses the =
procedure defined in [RFC7432].<br><br>!&nbsp;&nbsp;&nbsp; 2.&nbsp; Each =
of the PEs in redundancy group advertise Ethernet =
segment<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; route with =
extended community indicating their ability =
to<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; participate in per =
multicast flow DF election procedure.&nbsp; =
Since<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Per multicast flow =
would not be applicable unless PE learns =
about<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; membership request =
from receiver, there is a need to have =
the<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; default DF =
election among PEs in redundancy group for BUM<br><br><br>--- 436,446 =
----<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Route.&nbsp; =
This draft does not change any of this procedure, =
it<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; still uses the =
procedure defined in [RFC7432].<br><br>!&nbsp;&nbsp;&nbsp; 2.&nbsp; Each =
of the PEs in the redundancy group advertise an Ethernet =
segment<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; route with an =
extended community indicating their ability =
to<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; participate in =
per-multicast-flow DF election procedure.&nbsp; =
Since<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Per multicast flow =
would not be applicable unless the PE learns =
about<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; muilticast =
membership from a receiver, there is a need to have =
the<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; default DF =
election among PEs in redundancy group for =
BUM<br><br><br>***************<br>*** 450,484 ****<br>&nbsp; =
Internet-Draft&nbsp;&nbsp; Per multicast flow Designated =
Forwarder&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; July =
2023<br><br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
traffic.&nbsp; Until multicast membership state are learnt, we use =
the<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; the DF election =
procedure in Section 4.3, namely HRW per =
(v,Es)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; as defined in =
[RFC8584] .<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 3.&nbsp; When a receiver =
starts sending membership requests for =
(s1,g1),<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; where s1 is =
multicast source address and g1 is multicast =
group<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; address, CE-1 =
could hash membership request (IGMP join) to any =
of<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; the PEs in =
redundancy group.&nbsp; Let's consider it is hashed to =
PE-<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2.&nbsp; =
[RFC9251] defines a procedure to sync IGMP join state =
among<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; redundancy group of =
PEs.&nbsp; Now each of the PE would =
have<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; information about =
membership request (s1,g1) and each of them =
run<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; DF election procedure =
Section 4.1 to elect DF among =
participating<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PEs in =
redundancy group.&nbsp; Consider PE-2 gets elected as DF =
for<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; multicast flow =
(s1,g1).<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
1.&nbsp; PE-1 forwarding state would be nDF for flow (s1,g1) and =
DF<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp; for rest other BUM =
traffic.<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2.&nbsp; =
PE-2 forwarding state would be DF for flow (s1,g1) and =
nDF<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp; for rest other BUM =
traffic.<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
3.&nbsp; PE-3 forwarding state would be nDF for flow (s1,g1) and =
rest<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp; other BUM traffic.<br><br>!&nbsp;&nbsp;&nbsp; 4.&nbsp; As and =
when new multicast membership request comes, =
same<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; procedure as above =
would continue.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 5.&nbsp; If Section 3 =
has DF type 4, For membership request (S,G) it =
MUST<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; use Section 4.1 to =
elect DF among participating PEs.&nbsp; =
And<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; membership =
request (*,G) MUST use Section 4.2 to elect DF =
among<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; participating =
PEs.<br><br>--- 450,485 ----<br>&nbsp; Internet-Draft&nbsp;&nbsp; Per =
multicast flow Designated Forwarder&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
July 2023<br><br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
traffic.&nbsp; Until multicast membership state is learnt, we use =
the<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; the DF election =
procedure in Section 4.3, namely HRW per =
(v,ES)<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; as defined in =
[RFC8584] .<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 3.&nbsp; When a receiver =
starts sending membership requests for =
(s1,g1),<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; where s1 is a =
multicast source address and g1 is a multicast =
group<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; address, CE-1 =
could hash membership request (IGMP join) to any =
of<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; the PEs in =
redundancy group.&nbsp; Let's consider it is hashed to =
PE-<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2.&nbsp; =
[RFC9251] defines a procedure to sync IGMP join state =
among<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; PEs in a redundancy =
group.&nbsp; Now each of the PE would =
have<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; information about =
the membership request (s1,g1) and each of them would =
run<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; the DF election =
procedure (refer to Section 4.1)( to =
elect<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; a DF among =
participating&nbsp; PEs in the redundancy group.&nbsp; Consider =
PE-2<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; gets elected as DF =
for multicast flow =
(s1,g1).<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
1.&nbsp; PE-1 forwarding state would be nDF for flow (s1,g1) and =
DF<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&n=
bsp; for rest other BUM =
traffic.<br><br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; 2.&nbsp; =
PE-2 forwarding state would be the DF for flow (s1,g1) and =
nDF<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&=
nbsp; for rest other BUM =
traffic.<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; =
3.&nbsp; PE-3 forwarding state would be nDF for flow (s1,g1) and =
rest<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;=
&nbsp; other BUM traffic.<br><br>!&nbsp;&nbsp;&nbsp; 4.&nbsp; When a new =
multicast membership request arrives, the =
same<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; procedure as above =
would used to selected a nDF for =
the<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; multicast =
flow.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; 5.&nbsp; If Section 3 has DF type =
4, For membership request (S,G) it =
MUST<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; use Section 4.1 to =
elect a DF among participating PEs.&nbsp; =
And<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; membership =
request (*,G) MUST use Section 4.2 to elect DF =
among<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; participating =
PEs.<br><br>***************<br>*** 487,494 =
****<br>&nbsp;&nbsp;&nbsp;&nbsp; There are multiple triggers which can =
cause DF re-election.&nbsp; Some of<br>&nbsp;&nbsp;&nbsp;&nbsp; the =
triggers could be<br><br>!&nbsp;&nbsp;&nbsp; 1.&nbsp; Local ES going =
down due to physical failure or =
configuration<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; change =
triggers DF re-election at peering PE.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; =
2.&nbsp; Detection of new PE through ES route.<br><br>--- 488,495 =
----<br>&nbsp;&nbsp;&nbsp;&nbsp; There are multiple triggers which can =
cause DF re-election.&nbsp; Some of<br>&nbsp;&nbsp;&nbsp;&nbsp; the =
triggers could be<br><br>!&nbsp;&nbsp;&nbsp; 1.&nbsp; Local ES going =
down due to physical failure or a =
configuration<br>!&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; change that =
triggers DF re-election at peering PE.<br><br>&nbsp;&nbsp;&nbsp;&nbsp; =
2.&nbsp; Detection of new PE through ES =
route.<br><br>***************<br>*** 509,515 =
****<br>&nbsp;&nbsp;&nbsp;&nbsp; 6.&nbsp; Local configuration change of =
DF election Type and peering =
PE<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; consensus on new =
DF Type<br><br>!&nbsp;&nbsp;&nbsp; This document does not provide any =
new mechanism to handle DF re-<br>&nbsp;&nbsp;&nbsp;&nbsp; election =
procedure.&nbsp; It uses the existing mechanism defined =
in<br>&nbsp;&nbsp;&nbsp;&nbsp; [RFC7432].&nbsp; Whenever either of the =
triggers occur, a DF re-election<br>&nbsp;&nbsp;&nbsp;&nbsp; would be =
done. and all of the flows would be redistributed among<br>--- 510,516 =
----<br>&nbsp;&nbsp;&nbsp;&nbsp; 6.&nbsp; Local configuration change of =
DF election Type and peering =
PE<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; consensus on new =
DF Type<br><br>!&nbsp;&nbsp;&nbsp; This document does not provide any =
new mechanisms to handle DF re-<br>&nbsp;&nbsp;&nbsp;&nbsp; election =
procedure.&nbsp; It uses the existing mechanism defined =
in<br>&nbsp;&nbsp;&nbsp;&nbsp; [RFC7432].&nbsp; Whenever either of the =
triggers occur, a DF re-election<br>&nbsp;&nbsp;&nbsp;&nbsp; would be =
done. and all of the flows would be redistributed =
among</p></div></div></div></div></div></blockquote></div><br></body></htm=
l>=

--Apple-Mail=_79F6C49D-1B93-4858-8972-44816CC04C04--

