Path Maximum Transmission Unit Discovery (PMTUD) for Bit Index Explicit Replication (BIER) Layer
draft-mirsky-bier-path-mtu-discovery-00

The information below is for an old version of the document
Document Type Active Internet-Draft (individual)
Last updated 2015-10-08
Replaced by draft-ietf-bier-path-mtu-discovery
Stream (None)
Intended RFC status (None)
Formats plain text 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)
BIER  Working Group                                            G. Mirsky
Internet-Draft                                             T. Przygienda
Intended status: Standards Track                                Ericsson
Expires: April 10, 2016                                      A. Dolganow
                                                          Alcatel-Lucent
                                                         October 8, 2015

Path Maximum Transmission Unit Discovery (PMTUD) for Bit Index Explicit
                        Replication (BIER) Layer
                draft-mirsky-bier-path-mtu-discovery-00

Abstract

   This document describes Path Maximum Transmission Unit Discovery
   (PMTUD) in Bit Indexed Explicit Replication (BIER) layer.

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 April 10, 2016.

Copyright Notice

   Copyright (c) 2015 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.

Mirsky, et al.           Expires April 10, 2016                 [Page 1]

Internet-Draft               PMTUD for BIER                 October 2015

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
     1.1.  Conventions used in this document . . . . . . . . . . . .   3
       1.1.1.  Terminology . . . . . . . . . . . . . . . . . . . . .   3
       1.1.2.  Requirements Language . . . . . . . . . . . . . . . .   3
   2.  Problem Statement . . . . . . . . . . . . . . . . . . . . . .   3
   3.  PMTUD Mechanism for BIER  . . . . . . . . . . . . . . . . . .   4
     3.1.  Data TLV for BIER Ping  . . . . . . . . . . . . . . . . .   6
   4.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   6
   5.  Security Considerations . . . . . . . . . . . . . . . . . . .   7
   6.  Acknowledgement . . . . . . . . . . . . . . . . . . . . . . .   7
   7.  References  . . . . . . . . . . . . . . . . . . . . . . . . .   7
     7.1.  Normative References  . . . . . . . . . . . . . . . . . .   7
     7.2.  Informative References  . . . . . . . . . . . . . . . . .   8
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   8

1.  Introduction

   In packet switched networks when a host seeks to transmit a sizable
   amount of data to a target destination the data is transmitted as a
   set of datagrams.  In most cases it is more efficient to use the
   largest possible datagrams but so that these datagrams do not have to
   be fragmented at any point along the path from the host to the
   destination in order to avoid performance degradation caused by
   fragmentation.  Fragmentation occurs on hops along the route where an
   Maximum Transmission Unit (MTU) is smaller than the size of the
   datagram.  To avoid such fragmentation the MTU for each hop along a
   path from a host to a destination must be known to select an
   appropriate datagram size.  Such MTU determination along a specific
   path is referred to as path MTU discovery (PMTUD).

   [I-D.ietf-bier-architecture] introduces and explains Bit Index
   Explicit Replication (BIER) architecture and how it supports
   forwarding of multicast data packets.  A BIER domain consists of Bit-
   Forwarding Routers (BFRs) that are uniquely identified by their
   respective BFR-ids.  An ingress border router (acting as a Bit
   Forwarding Ingress Router (BFIR)) inserts a Forwarding Bit Mask
   (F-BM) into a packet.  Each targeted egress node (referred to as a
   Bit Forwarding Egress Router (BFER)) is represented by Bit Mask
   Position (BMP) in the BMS.  A transit or intermediate BIER node,
   referred as BFR, forwards BIER encapsulated packets to BFERs,
   identified by respective BMPs, according to a Bit Index Forwarding
Show full document text