TRILL (Transparent Interconnection of Lots of Links): Fine-Grained Labeling
draft-ietf-trill-fine-labeling-06

The information below is for an old version of the document
Document Type Active Internet-Draft (trill WG)
Last updated 2013-05-16 (latest revision 2013-03-29)
Replaces draft-eastlake-trill-rbridge-fine-labeling
Stream IETF
Intended RFC status Proposed Standard
Formats plain text pdf html
Stream WG state In WG Last Call
Consensus Unknown
Document shepherd None
IESG IESG state IESG Evaluation::AD Followup
Telechat date
Needs 3 more YES or NO OBJECTION positions to pass.
Responsible AD Ted Lemon
IESG note Erik Nordmark (nordmark@acm.org) is the Document Shepherd.
Send notices to trill-chairs@tools.ietf.org, draft-ietf-trill-fine-labeling@tools.ietf.org
IANA IANA review state IANA OK - Actions Needed
IANA action state None
TRILL Working Group                                      Donald Eastlake
INTERNET-DRAFT                                              Mingui Zhang
Intended status: Proposed Standard                                Huawei
Updates: 6325                                             Puneet Agarwal
                                                                Broadcom
                                                           Radia Perlman
                                                              Intel Labs
                                                             Dinesh Dutt
                                                        Cumulus Networks
Expires: September 28, 2013                               March 29, 2013

         TRILL (Transparent Interconnection of Lots of Links):
                         Fine-Grained Labeling
                <draft-ietf-trill-fine-labeling-06.txt>

Abstract

   The IETF has standardized TRILL (Transparent Interconnection of Lots
   of Links), a protocol for least cost transparent frame routing in
   multi-hop networks with arbitrary topologies and link technologies,
   using link-state routing and a hop count. The TRILL base protocol
   standard supports labeling of TRILL data with up to 4K IDs. However,
   there are applications that require more fine-grained labeling of
   data. This document updates RFC 6325 by specifying optional
   extensions to the TRILL base protocol to safely accomplish this.

Status of This Memo

   This Internet-Draft is submitted to IETF in full conformance with the
   provisions of BCP 78 and BCP 79.

   Distribution of this document is unlimited. Comments should be sent
   to the TRILL working group mailing list.

   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
   http://www.ietf.org/1id-abstracts.html. The list of Internet-Draft
   Shadow Directories can be accessed at
   http://www.ietf.org/shadow.html.

D. Eastlake, et al                                              [Page 1]
INTERNET-DRAFT                              TRILL: Fine-Grained Labeling

Table of Contents

      1. Introduction............................................3
      1.1 Terminology............................................3
      1.2 Contributors...........................................4

      2. Fine-Grained Labeling...................................5
      2.1 Goals..................................................5
      2.2 Base Protocol TRILL Data Labeling......................6
      2.3 Fine-Grained Labeling (FGL)............................7
      2.4 Reasons for VL and FGL Co-existence....................8

      3. VL versus FGL Label Differences.........................9

      4. FGL Processing.........................................10
      4.1 Ingress Processing....................................10
      4.1.1 Multi-Destination FGL Ingress.......................10
      4.2 Transit Processing....................................11
      4.2.1 Unicast Transit Processing..........................11
      4.2.2 Multi-Destination Transit Processing................11
      4.3 Egress Processing.....................................12
      4.4 Appointed Forwarders and the DRB......................13
      4.5 Distribution Tree Construction........................13
      4.6 Address Learning......................................14
      4.7 ESADI Extension.......................................14

      5. FGL TRILL Interaction with VL TRILL....................15
      5.1 FGL and VL Mixed Campus...............................15
      5.2 FGL and VL Mixed Links................................17
      5.3 Summary of FGL-safe Requirements......................17

      6. IS-IS Extensions.......................................19
      7. Comparison to Goals....................................20

      8. Allocation Considerations..............................21
      8.1 IEEE Allocation Considerations........................21
      8.2 IANA Considerations...................................21

      9. Security Considerations................................22
      Acknowledgements..........................................23
      Normative References......................................24
      Informative References....................................24

      Appendix A: Serial Unicast................................25
Show full document text