Transparent Interconnection of Lots of Links (TRILL): Using Data Labels for Tree Selection for Multi-Destination Data
RFC 7968

Document Type RFC - Proposed Standard (August 2016; No errata)
Last updated 2016-08-31
Replaces draft-yizhou-trill-tree-selection
Stream IETF
Formats plain text pdf html bibtex
Reviews
Stream WG state Submitted to IESG for Publication
Document shepherd Susan Hares
Shepherd write-up Show (last changed 2016-04-19)
IESG IESG state RFC 7968 (Proposed Standard)
Consensus Boilerplate Yes
Telechat date
Responsible AD Alia Atlas
Send notices to (None)
IANA IANA review state IANA OK - Actions Needed
IANA action state RFC-Ed-Ack
Internet Engineering Task Force (IETF)                             Y. Li
Request for Comments: 7968                               D. Eastlake 3rd
Category: Standards Track                                         W. Hao
ISSN: 2070-1721                                                  H. Chen
                                                     Huawei Technologies
                                                           S. Chatterjee
                                                                   Cisco
                                                             August 2016

         Transparent Interconnection of Lots of Links (TRILL):
    Using Data Labels for Tree Selection for Multi-Destination Data

Abstract

   TRILL (Transparent Interconnection of Lots of Links) uses
   distribution trees to deliver multi-destination frames.  Multiple
   trees can be used by an ingress Routing Bridge (RBridge) for flows,
   regardless of the VLAN, Fine-Grained Label (FGL), and/or multicast
   group of the flow.  Different ingress RBridges may choose different
   distribution trees for TRILL Data packets in the same VLAN, FGL,
   and/or multicast group.  To avoid unnecessary link utilization,
   distribution trees should be pruned based on one or more of the
   following: VLAN, FGL, or multicast destination address.  If any VLAN,
   FGL, or multicast group can be sent on any tree, for typical fast-
   path hardware, the amount of pruning information is multiplied by the
   number of trees, but there is limited hardware capacity for such
   pruning information.

   This document specifies an optional facility to restrict the TRILL
   Data packets sent on particular distribution trees by VLAN, FGL,
   and/or multicast groups, thus reducing the total amount of pruning
   information so that it can more easily be accommodated by fast-path
   hardware.

Status of This Memo

   This is an Internet Standards Track document.

   This document is a product of the Internet Engineering Task Force
   (IETF).  It represents the consensus of the IETF community.  It has
   received public review and has been approved for publication by the
   Internet Engineering Steering Group (IESG).  Further information on
   Internet Standards is available in Section 2 of RFC 7841.

   Information about the current status of this document, any errata,
   and how to provide feedback on it may be obtained at
   http://www.rfc-editor.org/info/rfc7968.

Li, et al.                   Standards Track                    [Page 1]
RFC 7968       TRILL: Tree Selection Based on Data Labels    August 2016

Copyright Notice

   Copyright (c) 2016 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 ....................................................3
      1.1. Background Description .....................................3
      1.2. Terminology Used in This Document ..........................4
   2. Motivations .....................................................5
   3. Tree Selection Based on Data Labels .............................9
      3.1. Overview of the Mechanism ..................................9
      3.2. APPsub-TLVs Supporting Tree Selection .....................10
           3.2.1. The Tree and VLANs APPsub-TLV ......................11
           3.2.2. The Tree and VLANs Used APPsub-TLV .................12
           3.2.3. The Tree and FGLs APPsub-TLV .......................12
           3.2.4. The Tree and FGLs Used APPsub-TLV ..................13
           3.2.5. The Tree and Groups APPsub-TLV .....................13
           3.2.6. The Tree and Groups Used APPsub-TLV ................14
      3.3. Detailed Processing .......................................14
      3.4. Failure Handling ..........................................15
   4. Backward Compatibility .........................................17
   5. Security Considerations ........................................18
   6. IANA Considerations ............................................19
   7. References .....................................................19
      7.1. Normative References ......................................19
      7.2. Informative References ....................................20
   Acknowledgments ...................................................21
   Authors' Addresses ................................................21
Show full document text