Fast Recovery for EVPN DF Election

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Authors Ali Sajassi  , Gaurav Badoni  , Dhananjaya Rao  , Patrice Brissette  , John Drake 
Last updated 2017-09-14 (latest revision 2017-03-13)
Replaced by draft-ietf-bess-evpn-fast-df-recovery
Stream (None)
Intended RFC status (None)
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


Ethernet Virtual Private Network (EVPN) solution [RFC 7432] describes DF election procedures for multi-homing Ethernet Segments. These procedures are enhanced further in [EVPN-DF-Election] by applying Highest Random Weight Algorithm for DF election in order to avoid DF status unnecessarily upon a failure. This draft makes further improvement to DF election procedures in [EVPN-DF-Election] by providing two options for fast DF election upon recovery of the failed link or node associated with the multi-homing Ethernet Segment. This fast DF election is achieved independent of number of EVIs associated with that Ethernet Segment and it is performed via a simple signaling between the recovered PE and each PE in the multi- homing group.


Ali Sajassi (
Gaurav Badoni (
Dhananjaya Rao (
Patrice Brissette (
John Drake (

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)