Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Jeff Tantsura"'
This document defines a YANG data model ([RFC6020], [RFC7950]) for segment routing ([RFC8402]) configuration and operation. This YANG model is intended to be used on network elements to configure or operate segment routing. This document defines also
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0e57e21945ec0153cb15682095c3ac96
https://doi.org/10.17487/rfc9020
https://doi.org/10.17487/rfc9020
This document introduces a simple mechanism to associate policies to a group of Label Switched Paths (LSPs) via an extension to the Path Computation Element (PCE) Communication Protocol (PCEP). The extension allows a PCEP speaker to advertise to a PC
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7daef669b374820ab0bccc40d1c4ff81
https://doi.org/10.17487/rfc9005
https://doi.org/10.17487/rfc9005
This document defines a way for a Border Gateway Protocol - Link State (BGP-LS) speaker to advertise multiple types of supported Maximum SID Depths (MSDs) at node and/or link granularity. Such advertisements allow entities (e.g., centralized controll
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9edfacd6a5aa36405cd72bfc63484a1c
https://doi.org/10.17487/rfc8814
https://doi.org/10.17487/rfc8814
Autor:
Rob Shakir, Siva Sivabalan, Sriganesh Kini, Stephane Litkowski, Kireeti Kompella, Jeff Tantsura
Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through an ordered list of instructions, called segments. Segment Routing can be applied to the Multi Protocol Label Switching (MPLS) data plane. Entropy label (EL) is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e98488ecccacd07db6390b864a76b1f8
https://doi.org/10.17487/rfc8662
https://doi.org/10.17487/rfc8662
Segment Routing (SR) enables any head-end node to select any path without relying on a hop-by-hop signaling technique (e.g., LDP or RSVP-TE). It depends only on "segments" that are advertised by link- state Interior Gateway Protocols (IGPs). A Segmen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::83ca28bf82bfdbea69ee317a53d64489
https://doi.org/10.17487/rfc8664
https://doi.org/10.17487/rfc8664
This document defines new BGP-LS TLVs in order to carry the IGP Traffic Engineering Metric Extensions defined in the IS-IS and OSPF protocols.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17f11de66a257699e0a7e4cdfffc2c20
https://doi.org/10.17487/rfc8571
https://doi.org/10.17487/rfc8571
Deployment experience gained from implementing algorithms to determine Loop-Free Alternates (LFAs) for multi-homed prefixes has revealed some avenues for potential improvement. This document provides explicit inequalities that can be used to evaluate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae2877b1e2318f2ba11574a6f6d66530
https://doi.org/10.17487/rfc8518
https://doi.org/10.17487/rfc8518
This document defines a way for an Intermediate System to Intermediate System (IS-IS) router to advertise multiple types of supported Maximum SID Depths (MSDs) at node and/or link granularity. Such advertisements allow entities (e.g., centralized con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db6076b66203311453050bd2b36be9c2
https://doi.org/10.17487/rfc8476
https://doi.org/10.17487/rfc8476
A Path Computation Element (PCE) can compute Traffic Engineering (TE) paths through a network that are subject to various constraints. Currently, TE paths are Label Switched Paths (LSPs) which are set up using the RSVP-TE signaling protocol. However,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::115f1542f277dcd70ede606436aea850
https://doi.org/10.17487/rfc8408
https://doi.org/10.17487/rfc8408