This document describes extensions to the Path Computation Element
(PCE) Communication Protocol (PCEP) to signal path profile
identifiers. A profile represents a list of path parameters or
policies that a PCEP peer may invoke on a remote peer using an opaque
identifier. When a path computation client (PCC) initiates a path
computation request, the PCC can signal profile identifiers to invoke
path parameters or policies defined on the PCE which would influence
the path computation. Similarly, when a PCE initiates or updates a
path, the PCE can signal profile identifiers to invoke path parameters
or policies defined on the PCC which would influence the path setup.
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 a technique used in
MPLS to improve load-balancing. This document examines and describes
how ELs are to be applied to Segment Routing MPLS.
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 a technique used in
MPLS to improve load-balancing. This document examines and describes
how ELs are to be applied to Segment Routing MPLS.
This document describes an extension to the OSPF protocol to add an optional operational capability that allows tagging and grouping of the nodes in an OSPF domain.This allows simplification, ease of management and control over route and path selection based on configured policies.This document describes an extension to the OSPF protocol to advertise node administrative tags.The node tags can be used to express and apply locally defined network policies, which are a very useful operational capability.Node tags may be used by either OSPF itself or other applications consuming information propagated via OSPF.This document describes the protocol extensions to disseminate node administrative tags to the OSPFv2 and OSPFv3 protocol.It provides example use cases of administrative node tags.
A Segment Routing (SR) node steers a packet through a controlled set
of instructions, called segments, by prepending the packet with an SR
header. A segment can represent any instruction, topological or
service-based. SR allows to enforce a flow through any topological
path and service chain while maintaining per-flow state only at the
ingress node to the SR domain. The Segment Routing architecture can
be directly applied to the MPLS data plane with no change in the
forwarding plane. This drafts describes how Segment Routing operates
in a network where LDP is deployed and in the case where SR-capable
and non-SR-capable nodes coexist.
This document presents an approach for a YANG model catalog and
registry that allows users to find models relevant to their use cases
from the large and growing number of YANG modules being published. The
model catalog may also be used to define bundles of YANG modules
required to realize a particular service or function.
This document defines a framework for a YANG data model for
configuring and managing label switched paths, including the signaling
protocols, traffic engineering, and operational aspects based on
carrier and content provider operational requirements.
Source routed tunnel stacking is a technique that can be leveraged to
provide a method to steer a packet through a controlled set of
segments. This can be applied to the Multi Protocol Label Switching
(MPLS) data plane. Entropy label (EL) is a technique used in MPLS to
improve load balancing. This document examines and describes how ELs
are to be applied to source routed stacked tunnels.
Segment Routing (SR) enables any node to select any path (explicit or
derived from IGPs SPT computations) for each of its traffic classes.
The path does not depend on a hop-by-hop signaling technique (neither
LDP nor RSVP). It only depends on a set of that are
advertised by the IS-IS routing protocol. These segments act as
topological sub-paths that can be combined together to form the
desired path. There are two forms of segments: node and adjacency. A
node segment represents a path to a node. An adjacency segment
represents a specific adjacency to a node. A node segment is typically
a multi- hop path while an adjacency segment is a one-hop path.
SR's control- plane can be applied to IPv6 and MPLS dataplanes.
Segment Routing control-plane can be applied to the MPLS dataplane: a
node segment to node N is instantiated in the MPLS dataplane as an LSP
along the shortest-path (SPT) to the node. An adjacency segment is
instantiated in the MPLS dataplane as a cross-connect entry pointing
to a specific egress datalink. This document describes the Segment
Routing functions, a set of use cases it addresses and the necessary
changes that are required in the IS-IS protocol.
'/%3e%3cuse xlink:href='%23a' transform='rotate(144 450 300)'/%3e%3cuse xlink:href='%23a' transform='rotate(216 450 300)'/%3e%3cuse xlink:href='%23a' transform='rotate(288 450 300)'/%3e%3c/svg%3e)
