A Forward-Search P2MP TE LSP Inter-Domain Path Computation
draft-chen-pce-forward-search-p2mp-path-18
|
| Document |
Type |
|
Active Internet-Draft (individual)
|
|
Last updated |
|
2020-07-10
|
|
Stream |
|
(None)
|
|
Intended RFC status |
|
(None)
|
|
Formats |
|
plain text
pdf
htmlized (tools)
htmlized
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)
|
PCE Working Group H. Chen
Internet-Draft Futurewei
Intended status: Standards Track July 10, 2020
Expires: January 11, 2021
A Forward-Search P2MP TE LSP Inter-Domain Path Computation
draft-chen-pce-forward-search-p2mp-path-18
Abstract
This document presents a forward search procedure for computing a
path for a Point-to-MultiPoint (P2MP) Traffic Engineering (TE) Label
Switched Path (LSP) crossing a number of domains through using
multiple Path Computation Elements (PCEs). In addition, extensions
to the Path Computation Element Communication Protocol (PCEP) for
supporting the forward search procedure are described.
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 11, 2021.
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
Chen Expires January 11, 2021 [Page 1]
Internet-Draft Forward Search P2mP Path July 2020
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 3
3. Conventions Used in This Document . . . . . . . . . . . . . . 4
4. Requirements . . . . . . . . . . . . . . . . . . . . . . . . 4
5. Forward Search P2MP Path Computation . . . . . . . . . . . . 4
5.1. Overview of Procedure . . . . . . . . . . . . . . . . . . 5
5.2. Description of Procedure . . . . . . . . . . . . . . . . 5
5.3. Processing Request and Reply Messages . . . . . . . . . . 8
6. Comparing to BRPC . . . . . . . . . . . . . . . . . . . . . . 9
7. Extensions to PCEP . . . . . . . . . . . . . . . . . . . . . 9
7.1. RP Object Extension . . . . . . . . . . . . . . . . . . . 10
7.2. PCE Object . . . . . . . . . . . . . . . . . . . . . . . 10
7.3. Candidate Node List Object . . . . . . . . . . . . . . . 11
7.4. Node Flags Object . . . . . . . . . . . . . . . . . . . . 12
7.5. Request Message Extension . . . . . . . . . . . . . . . . 12
7.6. Reply Message Extension . . . . . . . . . . . . . . . . . 13
8. Security Considerations . . . . . . . . . . . . . . . . . . 14
9. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 14
9.1. Request Parameter Bit Flags . . . . . . . . . . . . . . . 14
10. Acknowledgement . . . . . . . . . . . . . . . . . . . . . . . 14
11. References . . . . . . . . . . . . . . . . . . . . . . . . . 14
11.1. Normative References . . . . . . . . . . . . . . . . . . 14
11.2. Informative References . . . . . . . . . . . . . . . . . 15
Author's Address . . . . . . . . . . . . . . . . . . . . . . . . 15
1. Introduction
RFC 4105 "Requirements for Inter-Area MPLS TE" lists the requirements
for computing a shortest path for a TE LSP crossing multiple IGP
areas; and RFC 4216 "MPLS Inter-Autonomous System (AS) TE
Requirements" describes the requirements for computing a shortest
path for a TE LSP crossing multiple ASes. RFC 5671 "Applicability of
PCE to P2MP MPLS and GMPLS TE" examines the applicability of PCE to
path computation for P2MP TE LSPs in MPLS and GMPLS networks.
This document presents a forward search procedure to address these
requirements for computing a path for a P2MP TE LSP crossing domains
through using multiple Path Computation Elements (PCEs).
The procedure is called "Forward Search Shortest P2MP LSP Path
Crossing Domains" or FSPC for short. The major characteristics of
this procedure for computing a path for a P2MP TE LSP from a source
Show full document text