Path Computation Element Communication Protocol (PCEP) Extension for Label Switched Path (LSP) Diversity Constraint Signaling

Autor:	Colby Barth, Stephane Litkowski, Siva Sivabalan, Mahendra Negi
Rok vydání:	2020
Předmět:	Constraint (information theory) SIMPLE (military communications protocol) business.industry Computer science Computation Path computation element Path (graph theory) Disjoint sets Extension (predicate logic) business Communications protocol Computer network
Popis:	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 (disjointed) 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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::13942e8823a90b0c5fc5747890f3482c https://doi.org/10.17487/rfc8800 Zobrazit plný text záznamu