| < draft-ietf-bier-path-mtu-discovery-02.txt | draft-ietf-bier-path-mtu-discovery-03.txt > | |||
|---|---|---|---|---|
| BIER Working Group G. Mirsky | BIER Working Group G. Mirsky | |||
| Internet-Draft ZTE Corp. | Internet-Draft ZTE Corp. | |||
| Intended status: Standards Track T. Przygienda | Intended status: Standards Track T. Przygienda | |||
| Expires: January 17, 2018 Juniper Networks | Expires: July 21, 2018 Juniper Networks | |||
| A. Dolganow | A. Dolganow | |||
| Nokia | Nokia | |||
| July 16, 2017 | January 17, 2018 | |||
| Path Maximum Transmission Unit Discovery (PMTUD) for Bit Index Explicit | Path Maximum Transmission Unit Discovery (PMTUD) for Bit Index Explicit | |||
| Replication (BIER) Layer | Replication (BIER) Layer | |||
| draft-ietf-bier-path-mtu-discovery-02 | draft-ietf-bier-path-mtu-discovery-03 | |||
| Abstract | Abstract | |||
| This document describes Path Maximum Transmission Unit Discovery | This document describes Path Maximum Transmission Unit Discovery | |||
| (PMTUD) in Bit Indexed Explicit Replication (BIER) layer. | (PMTUD) in Bit Indexed Explicit Replication (BIER) layer. | |||
| Status of This Memo | Status of This Memo | |||
| This Internet-Draft is submitted in full conformance with the | This Internet-Draft is submitted in full conformance with the | |||
| provisions of BCP 78 and BCP 79. | provisions of BCP 78 and BCP 79. | |||
| Internet-Drafts are working documents of the Internet Engineering | Internet-Drafts are working documents of the Internet Engineering | |||
| Task Force (IETF). Note that other groups may also distribute | Task Force (IETF). Note that other groups may also distribute | |||
| working documents as Internet-Drafts. The list of current Internet- | working documents as Internet-Drafts. The list of current Internet- | |||
| Drafts is at http://datatracker.ietf.org/drafts/current/. | Drafts is at https://datatracker.ietf.org/drafts/current/. | |||
| Internet-Drafts are draft documents valid for a maximum of six months | Internet-Drafts are draft documents valid for a maximum of six months | |||
| and may be updated, replaced, or obsoleted by other documents at any | and may be updated, replaced, or obsoleted by other documents at any | |||
| time. It is inappropriate to use Internet-Drafts as reference | time. It is inappropriate to use Internet-Drafts as reference | |||
| material or to cite them other than as "work in progress." | material or to cite them other than as "work in progress." | |||
| This Internet-Draft will expire on January 17, 2018. | This Internet-Draft will expire on July 21, 2018. | |||
| Copyright Notice | Copyright Notice | |||
| Copyright (c) 2017 IETF Trust and the persons identified as the | Copyright (c) 2018 IETF Trust and the persons identified as the | |||
| document authors. All rights reserved. | document authors. All rights reserved. | |||
| This document is subject to BCP 78 and the IETF Trust's Legal | This document is subject to BCP 78 and the IETF Trust's Legal | |||
| Provisions Relating to IETF Documents | Provisions Relating to IETF Documents | |||
| (http://trustee.ietf.org/license-info) in effect on the date of | (https://trustee.ietf.org/license-info) in effect on the date of | |||
| publication of this document. Please review these documents | publication of this document. Please review these documents | |||
| carefully, as they describe your rights and restrictions with respect | carefully, as they describe your rights and restrictions with respect | |||
| to this document. Code Components extracted from this document must | to this document. Code Components extracted from this document must | |||
| include Simplified BSD License text as described in Section 4.e of | include Simplified BSD License text as described in Section 4.e of | |||
| the Trust Legal Provisions and are provided without warranty as | the Trust Legal Provisions and are provided without warranty as | |||
| described in the Simplified BSD License. | described in the Simplified BSD License. | |||
| Table of Contents | Table of Contents | |||
| 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 | 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2 | |||
| skipping to change at page 2, line 40 ¶ | skipping to change at page 2, line 40 ¶ | |||
| for any forwarding device along the routed path to the IP destination | for any forwarding device along the routed path to the IP destination | |||
| for these packets. Such "least MTU" is known as Path MTU (PMTU). | for these packets. Such "least MTU" is known as Path MTU (PMTU). | |||
| Fragmentation or packet drop, silent or not, may occur on hops along | Fragmentation or packet drop, silent or not, may occur on hops along | |||
| the route where a MTU is smaller than the size of the datagram. To | the route where a MTU is smaller than the size of the datagram. To | |||
| avoid any of the listed above behaviors, the packet source must find | avoid any of the listed above behaviors, the packet source must find | |||
| the value of the least MTU, i.e. PMTU, that will be encountered along | the value of the least MTU, i.e. PMTU, that will be encountered along | |||
| the route that a set of packets will follow to reach the given set of | the route that a set of packets will follow to reach the given set of | |||
| destinations. Such MTU determination along a specific path is | destinations. Such MTU determination along a specific path is | |||
| referred to as path MTU discovery (PMTUD). | referred to as path MTU discovery (PMTUD). | |||
| [I-D.ietf-bier-architecture] introduces and explains Bit Index | [RFC8279] introduces and explains Bit Index Explicit Replication | |||
| Explicit Replication (BIER) architecture and how it supports | (BIER) architecture and how it supports forwarding of multicast data | |||
| forwarding of multicast data packets. A BIER domain consists of Bit- | packets. A BIER domain consists of Bit-Forwarding Routers (BFRs) | |||
| Forwarding Routers (BFRs) that are uniquely identified by their | that are uniquely identified by their respective BFR-ids. An ingress | |||
| respective BFR-ids. An ingress border router (acting as a Bit | border router (acting as a Bit Forwarding Ingress Router (BFIR)) | |||
| Forwarding Ingress Router (BFIR)) inserts a Forwarding Bit Mask | inserts a Forwarding Bit Mask (F-BM) into a packet. Each targeted | |||
| (F-BM) into a packet. Each targeted egress node (referred to as a | egress node (referred to as a Bit Forwarding Egress Router (BFER)) is | |||
| Bit Forwarding Egress Router (BFER)) is represented by Bit Mask | represented by Bit Mask Position (BMP) in the BMS. A transit or | |||
| Position (BMP) in the BMS. A transit or intermediate BIER node, | intermediate BIER node, referred as BFR, forwards BIER encapsulated | |||
| referred as BFR, forwards BIER encapsulated packets to BFERs, | packets to BFERs, identified by respective BMPs, according to a Bit | |||
| identified by respective BMPs, according to a Bit Index Forwarding | Index Forwarding Table (BIFT). | |||
| Table (BIFT). | ||||
| 1.1. Conventions used in this document | 1.1. Conventions used in this document | |||
| 1.1.1. Terminology | 1.1.1. Terminology | |||
| BFR: Bit-Forwarding Router | BFR: Bit-Forwarding Router | |||
| BFER: Bit-Forwarding Egress Router | BFER: Bit-Forwarding Egress Router | |||
| BFIR: Bit-Forwarding Ingress Router | BFIR: Bit-Forwarding Ingress Router | |||
| skipping to change at page 7, line 35 ¶ | skipping to change at page 7, line 35 ¶ | |||
| Authors greatly appreciate thorough review and the most detailed | Authors greatly appreciate thorough review and the most detailed | |||
| comments by Eric Gray. | comments by Eric Gray. | |||
| 7. References | 7. References | |||
| 7.1. Normative References | 7.1. Normative References | |||
| [I-D.ietf-bier-ping] | [I-D.ietf-bier-ping] | |||
| Kumar, N., Pignataro, C., Akiya, N., Zheng, L., Chen, M., | Kumar, N., Pignataro, C., Akiya, N., Zheng, L., Chen, M., | |||
| and G. Mirsky, "BIER Ping and Trace", draft-ietf-bier- | and G. Mirsky, "BIER Ping and Trace", draft-ietf-bier- | |||
| ping-01 (work in progress), January 2017. | ping-02 (work in progress), July 2017. | |||
| [RFC1191] Mogul, J. and S. Deering, "Path MTU discovery", RFC 1191, | [RFC1191] Mogul, J. and S. Deering, "Path MTU discovery", RFC 1191, | |||
| DOI 10.17487/RFC1191, November 1990, | DOI 10.17487/RFC1191, November 1990, | |||
| <http://www.rfc-editor.org/info/rfc1191>. | <https://www.rfc-editor.org/info/rfc1191>. | |||
| [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate | [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate | |||
| Requirement Levels", BCP 14, RFC 2119, | Requirement Levels", BCP 14, RFC 2119, | |||
| DOI 10.17487/RFC2119, March 1997, | DOI 10.17487/RFC2119, March 1997, | |||
| <http://www.rfc-editor.org/info/rfc2119>. | <https://www.rfc-editor.org/info/rfc2119>. | |||
| [RFC4821] Mathis, M. and J. Heffner, "Packetization Layer Path MTU | [RFC4821] Mathis, M. and J. Heffner, "Packetization Layer Path MTU | |||
| Discovery", RFC 4821, DOI 10.17487/RFC4821, March 2007, | Discovery", RFC 4821, DOI 10.17487/RFC4821, March 2007, | |||
| <http://www.rfc-editor.org/info/rfc4821>. | <https://www.rfc-editor.org/info/rfc4821>. | |||
| [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC | [RFC8174] Leiba, B., "Ambiguity of Uppercase vs Lowercase in RFC | |||
| 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, | 2119 Key Words", BCP 14, RFC 8174, DOI 10.17487/RFC8174, | |||
| May 2017, <http://www.rfc-editor.org/info/rfc8174>. | May 2017, <https://www.rfc-editor.org/info/rfc8174>. | |||
| [RFC8201] McCann, J., Deering, S., Mogul, J., and R. Hinden, Ed., | [RFC8201] McCann, J., Deering, S., Mogul, J., and R. Hinden, Ed., | |||
| "Path MTU Discovery for IP version 6", STD 87, RFC 8201, | "Path MTU Discovery for IP version 6", STD 87, RFC 8201, | |||
| DOI 10.17487/RFC8201, July 2017, | DOI 10.17487/RFC8201, July 2017, | |||
| <http://www.rfc-editor.org/info/rfc8201>. | <https://www.rfc-editor.org/info/rfc8201>. | |||
| 7.2. Informative References | 7.2. Informative References | |||
| [I-D.ietf-bier-architecture] | ||||
| Wijnands, I., Rosen, E., Dolganow, A., Przygienda, T., and | ||||
| S. Aldrin, "Multicast using Bit Index Explicit | ||||
| Replication", draft-ietf-bier-architecture-07 (work in | ||||
| progress), June 2017. | ||||
| [I-D.ietf-bier-oam-requirements] | [I-D.ietf-bier-oam-requirements] | |||
| Mirsky, G., Nordmark, E., Pignataro, C., Kumar, N., | Mirsky, G., Nordmark, E., Pignataro, C., Kumar, N., | |||
| Aldrin, S., Zheng, L., Chen, M., Akiya, N., and S. | Aldrin, S., Zheng, L., Chen, M., Akiya, N., and S. | |||
| Pallagatti, "Operations, Administration and Maintenance | Pallagatti, "Operations, Administration and Maintenance | |||
| (OAM) Requirements for Bit Index Explicit Replication | (OAM) Requirements for Bit Index Explicit Replication | |||
| (BIER) Layer", draft-ietf-bier-oam-requirements-03 (work | (BIER) Layer", draft-ietf-bier-oam-requirements-04 (work | |||
| in progress), January 2017. | in progress), July 2017. | |||
| [RFC8279] Wijnands, IJ., Ed., Rosen, E., Ed., Dolganow, A., | ||||
| Przygienda, T., and S. Aldrin, "Multicast Using Bit Index | ||||
| Explicit Replication (BIER)", RFC 8279, | ||||
| DOI 10.17487/RFC8279, November 2017, | ||||
| <https://www.rfc-editor.org/info/rfc8279>. | ||||
| Authors' Addresses | Authors' Addresses | |||
| Greg Mirsky | Greg Mirsky | |||
| ZTE Corp. | ZTE Corp. | |||
| Email: gregimirsky@gmail.com | Email: gregimirsky@gmail.com | |||
| Tony Przygienda | Tony Przygienda | |||
| Juniper Networks | Juniper Networks | |||
| End of changes. 16 change blocks. | ||||
| 33 lines changed or deleted | 32 lines changed or added | |||
This html diff was produced by rfcdiff 1.48. The latest version is available from http://tools.ietf.org/tools/rfcdiff/ | ||||