<?xml version="1.0" encoding="UTF-8"?>
<reference anchor="I-D.ietf-bess-evpn-df-election-framework" target="https://datatracker.ietf.org/doc/html/draft-ietf-bess-evpn-df-election-framework-00">
   <front>
      <title>Framework for EVPN Designated Forwarder Election Extensibility</title>
      <author initials="J." surname="Rabadan" fullname="Jorge Rabadan">
         <organization>Nokia</organization>
      </author>
      <author initials="M. R." surname="Satya" fullname="SATYA R MOHANTY">
         <organization>Cisco</organization>
      </author>
      <author initials="A." surname="Sajassi" fullname="Ali Sajassi">
         <organization>Cisco</organization>
      </author>
      <author initials="J." surname="Drake" fullname="John Drake">
         <organization>Juniper</organization>
      </author>
      <author initials="K." surname="Nagaraj" fullname="Kiran Nagaraj">
         <organization>Nokia</organization>
      </author>
      <author initials="S." surname="Sathappan" fullname="Senthil Sathappan">
         <organization>Nokia</organization>
      </author>
      <date month="March" day="5" year="2018" />
      <abstract>
	 <t>   The Designated Forwarder (DF) in EVPN networks is the PE responsible
   for sending broadcast, unknown unicast and multicast (BUM) traffic to
   a multi-homed CE, on a given VLAN on a particular Ethernet Segment
   (ES). The DF is selected out of a list of candidate PEs that
   advertise the same Ethernet Segment Identifier (ESI) to the EVPN
   network. By default, EVPN uses a DF Election algorithm referred to as
   &quot;Service Carving&quot; and it is based on a modulus function (V mod N)
   that takes the number of PEs in the ES (N) and the VLAN value (V) as
   input. This default DF Election algorithm has some inefficiencies
   that this document addresses by defining a new DF Election algorithm
   and a capability to influence the DF Election result for a VLAN,
   depending on the state of the associated Attachment Circuit (AC). In
   addition, this document creates a registry with IANA, for future DF
   Election Algorithms and Capabilities. It also presents a formal
   definition and clarification of the DF Election Finite State Machine.


	 </t>
      </abstract>
   </front>
   <seriesInfo name="Internet-Draft" value="draft-ietf-bess-evpn-df-election-framework-00" />
   
</reference>
