RIFT: Routing in Fat Trees
draft-ietf-rift-rift-12
|
| Document |
Type |
|
Active Internet-Draft (rift WG)
|
|
Last updated |
|
2020-06-02
(latest revision 2020-05-26)
|
|
Replaces |
|
draft-przygienda-rift
|
|
Stream |
|
IETF
|
|
Intended RFC status |
|
Proposed Standard
|
|
Formats |
|
plain text
xml
pdf
htmlized (tools)
htmlized
bibtex
|
|
Reviews |
|
|
| Stream |
WG state
|
|
Submitted to IESG for Publication
(wg milestones:
Mar 2018 - Adopt a protocol spe...,
Apr 2020 - Submit protocol spec...
)
|
|
Document shepherd |
|
Zheng Zhang
|
|
Shepherd write-up |
|
Show
(last changed 2020-06-01)
|
| IESG |
IESG state |
|
Publication Requested
|
|
Consensus Boilerplate |
|
Yes
|
|
Telechat date |
|
|
|
Responsible AD |
|
Alvaro Retana
|
|
Send notices to |
|
Zheng Zhang <zhang.zheng@zte.com.cn>
|
RIFT Working Group A. Przygienda, Ed.
Internet-Draft Juniper
Intended status: Standards Track A. Sharma
Expires: November 27, 2020 Comcast
P. Thubert
Cisco
Bruno. Rijsman
Individual
Dmitry. Afanasiev
Yandex
May 26, 2020
RIFT: Routing in Fat Trees
draft-ietf-rift-rift-12
Abstract
This document defines a specialized, dynamic routing protocol for
Clos and fat-tree network topologies optimized towards minimization
of configuration and operational complexity. The protocol
o deals with no configuration, fully automated construction of fat-
tree topologies based on detection of links,
o minimizes the amount of routing state held at each level,
o automatically prunes and load balances topology flooding exchanges
over a sufficient subset of links,
o supports automatic disaggregation of prefixes on link and node
failures to prevent black-holing and suboptimal routing,
o allows traffic steering and re-routing policies,
o allows loop-free non-ECMP forwarding,
o automatically re-balances traffic towards the spines based on
bandwidth available and finally
o provides mechanisms to synchronize a limited key-value data-store
that can be used after protocol convergence to e.g. bootstrap
higher levels of functionality on nodes.
Przygienda, et al. Expires November 27, 2020 [Page 1]
Internet-Draft RIFT May 2020
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/.
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."
This Internet-Draft will expire on November 27, 2020.
Copyright Notice
Copyright (c) 2020 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
(https://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. Authors . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 6
2.1. Requirements Language . . . . . . . . . . . . . . . . . . 8
3. Reference Frame . . . . . . . . . . . . . . . . . . . . . . . 8
3.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 8
3.2. Topology . . . . . . . . . . . . . . . . . . . . . . . . 13
4. RIFT: Routing in Fat Trees . . . . . . . . . . . . . . . . . 15
4.1. Overview . . . . . . . . . . . . . . . . . . . . . . . . 16
4.1.1. Properties . . . . . . . . . . . . . . . . . . . . . 16
4.1.2. Generalized Topology View . . . . . . . . . . . . . . 17
4.1.2.1. Terminology . . . . . . . . . . . . . . . . . . . 17
4.1.2.2. Clos as Crossed Crossbars . . . . . . . . . . . . 18
4.1.3. Fallen Leaf Problem . . . . . . . . . . . . . . . . . 28
4.1.4. Discovering Fallen Leaves . . . . . . . . . . . . . . 30
Przygienda, et al. Expires November 27, 2020 [Page 2]
Internet-Draft RIFT May 2020
4.1.5. Addressing the Fallen Leaves Problem . . . . . . . . 31
4.2. Specification . . . . . . . . . . . . . . . . . . . . . . 32
4.2.1. Transport . . . . . . . . . . . . . . . . . . . . . . 33
4.2.2. Link (Neighbor) Discovery (LIE Exchange) . . . . . . 33
Show full document text