Path Computation Element communication Protocol extension for signaling LSP diversity constraint
draft-ietf-pce-association-diversity-03

The information below is for an old version of the document
Document Type None Internet-Draft (pce WG)
Last updated 2018-02-27
Replaces draft-dhody-pce-of-diverse, draft-litkowski-pce-association-diversity
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Reviews
Additional URLs
- Mailing list discussion
Stream WG state (None)
Document shepherd No shepherd assigned
IESG IESG state Unknown state
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

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-03.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 Communication Protocol (PCEP) with the purpose of computing diverse paths for those LSPs. The proposed extension allows a PCC to advertise to a PCE the belonging of a particular LSP to a disjoint- group, thus the PCE knows that LSPs in the same group must be disjoint from each other.

Authors

Stephane Litkowski (stephane.litkowski@orange.com)
Siva Sivabalan (msiva@cisco.com)
Colby Barth (cbarth@juniper.net)
Dhruv Dhody (dhruv.dhody@huawei.com)

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