Segment Routing Point-to-Multipoint Policy
draft-ietf-pim-sr-p2mp-policy-00
Network Working Group D. Voyer, Ed.
Internet-Draft Bell Canada
Intended status: Standards Track C. Filsfils
Expires: January 28, 2021 R. Parekh
Cisco Systems, Inc.
H. Bidgoli
Nokia
Z. Zhang
Juniper Networks
July 27, 2020
Segment Routing Point-to-Multipoint Policy
draft-ietf-pim-sr-p2mp-policy-00
Abstract
This document describes an architecture to construct a Point-to-
Multipoint (P2MP) tree to deliver Multi-point services in a Segment
Routing domain. A SR P2MP tree is constructed by stitching a set of
Replication segments together. A SR Point-to-Multipoint (SR P2MP)
Policy is used to define and instantiate a P2MP tree which is
computed by a PCE.
Requirements Language
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in RFC 2119 [RFC2119].
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 https://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 January 28, 2021.
Voyer, Ed., et al. Expires January 28, 2021 [Page 1]
Internet-Draft SR P2MP Policy July 2020
Copyright Notice
Copyright (c) 2020 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
(https://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
2. P2MP Tree . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2.1. Sharing Replication segments across P2MP trees . . . . . 4
3. SR P2MP Policy . . . . . . . . . . . . . . . . . . . . . . . 5
4. Using Controller to build a P2MP Tree . . . . . . . . . . . . 6
4.1. Provisioning SR P2MP Policy Creation . . . . . . . . . . 6
4.1.1. API . . . . . . . . . . . . . . . . . . . . . . . . . 6
4.1.2. Invoking API . . . . . . . . . . . . . . . . . . . . 7
4.2. P2MP Tree Computation . . . . . . . . . . . . . . . . . . 7
4.2.1. Topology Discovery . . . . . . . . . . . . . . . . . 8
4.2.2. Capability and Attribute Discovery . . . . . . . . . 8
4.3. Instantiating P2MP tree on nodes . . . . . . . . . . . . 8
4.3.1. PCEP . . . . . . . . . . . . . . . . . . . . . . . . 8
4.3.2. BGP . . . . . . . . . . . . . . . . . . . . . . . . . 8
4.3.3. NetConf . . . . . . . . . . . . . . . . . . . . . . . 8
4.4. Protection . . . . . . . . . . . . . . . . . . . . . . . 9
4.4.1. Local Protection . . . . . . . . . . . . . . . . . . 9
4.4.2. Path Protection . . . . . . . . . . . . . . . . . . . 9
5. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 9
6. Security Considerations . . . . . . . . . . . . . . . . . . . 9
7. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 9
8. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 9
9. References . . . . . . . . . . . . . . . . . . . . . . . . . 11
9.1. Normative References . . . . . . . . . . . . . . . . . . 11
9.2. Informative References . . . . . . . . . . . . . . . . . 11
Appendix A. Illustration of SR P2MP Policy and P2MP Tree . . . . 11
A.1. P2MP Tree with non-adjacent Replication Segments . . . . 12
Show full document text