P2MP Policy Ping
draft-hb-pim-p2mp-policy-ping-00
Network Working Group H. Bidgoli, Ed.
Internet-Draft Nokia
Intended status: Standards Track V. Voyer
Expires: January 28, 2021 Bell Canada
P. Parekh
Cisco System
Z. Zhang
Juniper Networks
July 27, 2020
P2MP Policy Ping
draft-hb-pim-p2mp-policy-ping-00
Abstract
SR P2MP policies are set of policies that enable architecture for
P2MP service delivery. A P2MP Policy consists of candidate paths
that connects the Root of the Tree to a set of Leaves. The P2MP
policy is composed of replication segments. A replication segment is
a forwarding instruction for a candidate path which is downloaded to
the Root, transit nodes and the leaves.
This document describes a simple and efficient mechanism that can be
used to detect data plane failures in P2MP Policy Candidate Paths
(CPs) and Path Instances (PIs).
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.
Bidgoli, et al. Expires January 28, 2021 [Page 1]
Internet-Draft P2MP Policy Ping 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 . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Conventions used in this document . . . . . . . . . . . . . . 3
3. Motivation . . . . . . . . . . . . . . . . . . . . . . . . . 3
3.1. P2MP Policy Ping and Traceroute . . . . . . . . . . . . . 3
3.2. Packet format and new TLVs . . . . . . . . . . . . . . . 3
3.2.1. Identifying a P2MP Policy . . . . . . . . . . . . . . 4
3.2.1.1. P2MP Policy Sub-TLVs . . . . . . . . . . . . . . 4
3.3. Limiting the Scope of Response . . . . . . . . . . . . . 5
4. Operation of P2MP Policy Ping . . . . . . . . . . . . . . . . 5
4.1. Replication Segments Connected via a Unicast SR domain . 5
5. IANA Consideration . . . . . . . . . . . . . . . . . . . . . 6
6. Security Considerations . . . . . . . . . . . . . . . . . . . 6
7. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 6
8. References . . . . . . . . . . . . . . . . . . . . . . . . . 6
8.1. Normative References . . . . . . . . . . . . . . . . . . 6
8.2. Informative References . . . . . . . . . . . . . . . . . 6
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 6
1. Introduction
Each P2MP Policy can have multiple CPs. The CP with highest
preference is the active CP while all other CPs are the backup CPs.
A CP can have multiple PI to allow global optimization of the CP via
Make Before Break procedures between the active PI and the newly
setup and optimized PI.
This document describes a mechanism that can be used to detect data
plane failures in P2MP Policy Candidate Paths (CP) and its associate
Path Instances (PI) from the root to a set of leaves.
Bidgoli, et al. Expires January 28, 2021 [Page 2]
Internet-Draft P2MP Policy Ping July 2020
This draft defines two new sub-TLVs to identifier a P2MP Policy and
reuses concepts from [RFC6425]
2. Conventions used in this document
Show full document text