RIFT: Routing in Fat Trees
draft-przygienda-rift-01

Document Type Active Internet-Draft (individual)
Last updated 2017-01-24
Stream (None)
Intended RFC status (None)
Formats plain text xml pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Networking Working Group                                   T. Przygienda
Internet-Draft                                                  J. Drake
Intended status: Standards Track                                A. Atlas
Expires: July 28, 2017                                  Juniper Networks
                                                        January 24, 2017

                       RIFT: Routing in Fat Trees
                        draft-przygienda-rift-01

Abstract

   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 blackholing and
   suboptimal routing, (5) allows traffic steering and re-routing
   policies and ultimately (6) 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.

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 http://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 July 28, 2017.

Copyright Notice

   Copyright (c) 2017 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

Przygienda, et al.        Expires July 28, 2017                 [Page 1]
Internet-Draft                    RIFT                      January 2017

   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  . . . . . . . . . . . . . . . . . . . . . . . .   3
     1.1.  Requirements Language . . . . . . . . . . . . . . . . . .   3
   2.  Reference Frame . . . . . . . . . . . . . . . . . . . . . . .   3
     2.1.  Terminology . . . . . . . . . . . . . . . . . . . . . . .   4
     2.2.  Topology  . . . . . . . . . . . . . . . . . . . . . . . .   6
   3.  Requirement Considerations  . . . . . . . . . . . . . . . . .   8
   4.  RIFT: Routing in Fat Trees  . . . . . . . . . . . . . . . . .   9
     4.1.  Overview  . . . . . . . . . . . . . . . . . . . . . . . .  10
     4.2.  Specification . . . . . . . . . . . . . . . . . . . . . .  10
       4.2.1.  Transport . . . . . . . . . . . . . . . . . . . . . .  10
       4.2.2.  Link (Neighbor) Discovery (LIE Exchange)  . . . . . .  10
       4.2.3.  Topology Exchange (TIE Exchange)  . . . . . . . . . .  11
         4.2.3.1.  Topology Information Elements . . . . . . . . . .  11
         4.2.3.2.  South- and Northbound Representation  . . . . . .  11
         4.2.3.3.  Flooding  . . . . . . . . . . . . . . . . . . . .  13
         4.2.3.4.  TIE Flooding Scopes . . . . . . . . . . . . . . .  13
         4.2.3.5.  Initial and Periodic Database Synchronization . .  14
         4.2.3.6.  Purging . . . . . . . . . . . . . . . . . . . . .  15
         4.2.3.7.  Optional Automatic Flooding Reduction and
                   Partitioning  . . . . . . . . . . . . . . . . . .  15
       4.2.4.  Automatic Disaggregation on Link & Node Failures  . .  16
       4.2.5.  Policy-Guided Prefixes  . . . . . . . . . . . . . . .  19
         4.2.5.1.  Ingress Filtering . . . . . . . . . . . . . . . .  20
         4.2.5.2.  Applying Policy . . . . . . . . . . . . . . . . .  21
         4.2.5.3.  Store Policy-Guided Prefix for Route Computation
                   and Regeneration  . . . . . . . . . . . . . . . .  22
         4.2.5.4.  Regeneration  . . . . . . . . . . . . . . . . . .  22
         4.2.5.5.  Overlap with Disaggregated Prefixes . . . . . . .  22
Show full document text