Fast Recovery for EVPN DF Election
This is an older version of an Internet-Draft whose latest revision state is "Active".
Expired & archived
|Authors||Ali Sajassi , Gaurav Badoni , Dhananjaya Rao , Patrice Brissette , John Drake , Jorge Rabadan|
|Last updated||2020-09-10 (Latest revision 2020-03-09)|
|RFC stream||Internet Engineering Task Force (IETF)|
|Additional resources||Mailing list discussion|
|Stream||WG state||WG Document|
|Send notices to||(None)|
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Ethernet Virtual Private Network (EVPN) solution [RFC7432] describes DF election procedures for multi-homing Ethernet Segments. These procedures are enhanced further in [RFC8584] 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 [RFC8584] 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.
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)