Path Computation Element Communication Protocol (PCEP) Extension for LSP Diversity Constraint Signaling
draft-ietf-pce-association-diversity-11

The information below is for an old version of the document
Document Type None Internet-Draft (pce WG)
Last updated 2019-10-28 (latest revision 2019-08-31)
Replaces draft-dhody-pce-of-diverse, draft-litkowski-pce-association-diversity
Stream IETF
Intended RFC status Proposed Standard
Formats
Expired & archived
pdf htmlized bibtex
Reviews
Additional URLs
- Mailing list discussion
Stream WG state (None)
Doc Shepherd Follow-up Underway
Document shepherd Julien Meuric
Shepherd write-up Show (last changed 2019-07-05)
IESG IESG state Unknown state
Consensus Boilerplate Yes
Telechat date
Responsible AD Deborah Brungard
Send notices to Julien Meuric <julien.meuric@orange.com>

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-ietf-pce-association-diversity-11.txt

Abstract

This document introduces a simple mechanism to associate a group of Label Switched Paths (LSPs) via an extension to the Path Computation Element (PCE) communication Protocol (PCEP) with the purpose of computing diverse paths for those LSPs. The proposed extension allows a Path Computation Client (PCC) to advertise to a PCE that a particular LSP belongs to a particular disjoint-group, thus the PCE knows that the LSPs in the same group need to be disjoint from each other.

Authors

Stephane Litkowski (stephane.litkowski@orange.com)
Siva Sivabalan (msiva@cisco.com)
Colby Barth (cbarth@juniper.net)
Mahendra Negi (mahend.ietf@gmail.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)