Skip to main content

RIFT: Routing in Fat Trees

Document Type Replaced Internet-Draft (rift WG)
Expired & archived
Authors Tony Przygienda , Alankar Sharma , Alia Atlas , John Drake
Last updated 2018-04-10 (Latest revision 2018-03-01)
Replaced by draft-ietf-rift-rift
RFC stream Internet Engineering Task Force (IETF)
Intended RFC status (None)
Additional resources Mailing list discussion
Stream WG state Candidate for WG Adoption
Document shepherd (None)
IESG IESG state Replaced by draft-ietf-rift-rift
Consensus boilerplate Unknown
Telechat date (None)
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:


This document outlines a specialized, dynamic routing protocol for Clos and fat-tree network topologies. The protocol (1) deals with automatic construction of fat-tree topologies based on detection of links, (2) minimizes the amount of routing state held at each level, (3) automatically prunes the topology distribution exchanges to a sufficient subset of links, (4) supports automatic disaggregation of prefixes on link and node failures to prevent black-holing and suboptimal routing, (5) allows traffic steering and re-routing policies, (6) allows non-ECMP forwarding, (7) automatically re- balances traffic towards the spines based on bandwidth available and ultimately (8) 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.


Tony Przygienda
Alankar Sharma
Alia Atlas
John Drake

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