Fast Recovery for EVPN DF Election
draft-ietf-bess-evpn-fast-df-recovery-00
BESS Working Group A. Sajassi
Internet-Draft G. Badoni
Intended Status: Standards Track D. Rao
P. Brissette
Cisco
J. Drake
Juniper
J. Rabadan
Nokia
Expires: December 12, 2018 June 12, 2018
Fast Recovery for EVPN DF Election
draft-ietf-bess-evpn-fast-df-recovery-00
Abstract
Ethernet Virtual Private Network (EVPN) solution [RFC 7432] describes
DF election procedures for multi-homing Ethernet Segments. These
procedures are enhanced further in [DF-FRAMEWORK] 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 [DF-FRAMEWORK] 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.
Status of this Memo
This Internet-Draft is submitted to IETF in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF), its areas, and its working groups. Note that
other groups may also distribute working documents as
Internet-Drafts.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
The list of current Internet-Drafts can be accessed at
Sajassi et al. Expires December 12, 2018 [Page 1]
INTERNET DRAFT Fast Recovery for EVPN DF Election June 12, 2018
http://www.ietf.org/1id-abstracts.html
The list of Internet-Draft Shadow Directories can be accessed at
http://www.ietf.org/shadow.html
Copyright and License Notice
Copyright (c) 2017 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.1 Terminology . . . . . . . . . . . . . . . . . . . . . . . . 4
2 Challenges with Existing Solution . . . . . . . . . . . . . . . 4
3 Operation . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
3.1 DF Election Handshake Solution . . . . . . . . . . . . . . . 6
3.1.1 Discovery . . . . . . . . . . . . . . . . . . . . . . . 6
3.1.2 DF candidates Determination . . . . . . . . . . . . . . 6
3.1.3 DF Election Handshake . . . . . . . . . . . . . . . . . 7
3.1.4 Node Insertion . . . . . . . . . . . . . . . . . . . . . 8
3.1.5 BGP Encoding . . . . . . . . . . . . . . . . . . . . . . 8
3.1.5.1 DF Election Handshake Request Route . . . . . . . . 9
3.5.1.2 DF Election Handshake Response Route . . . . . . . . 9
3.1.6 DF Handshake Scenarios . . . . . . . . . . . . . . . . . 11
3.1.7 Interoperability . . . . . . . . . . . . . . . . . . . 13
3.2 DF Election Synchronization Solution . . . . . . . . . . . . 14
3.2.3 Advantages . . . . . . . . . . . . . . . . . . . . . . . 15
3.2.4 Interoperability . . . . . . . . . . . . . . . . . . . . 16
3.2.5 BGP Encoding . . . . . . . . . . . . . . . . . . . . . . 16
3.2.6 Note on NTP-based synchronization . . . . . . . . . . . 17
3.2.7 An example . . . . . . . . . . . . . . . . . . . . . . . 17
4 Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . . 18
Show full document text