PCEP Extensions for Service Function Chaining (SFC)
draft-wu-pce-traffic-steering-sfc-12
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Qin Wu , Dhruv Dhody , Mohamed Boucadair , Christian Jacquenet , Jeff Tantsura | ||
Last updated | 2018-01-01 (Latest revision 2017-06-30) | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document provides an overview of the usage of Path Computation Element (PCE) to dynamically structure service function chains. Service Function Chaining (SFC) is a technique that is meant to facilitate the dynamic enforcement of differentiated traffic forwarding policies within a domain. Service function chains are composed of an ordered set of elementary Service Functions (such as firewalls, load balancers) that need to be invoked according to the design of a given service. Corresponding traffic is thus forwarded along a Service Function Path (SFP) that can be computed by means of PCE. This document specifies extensions to the Path Computation Element Protocol (PCEP) that allow a stateful PCE to compute and instantiate Service Function Paths.
Authors
Qin Wu
Dhruv Dhody
Mohamed Boucadair
Christian Jacquenet
Jeff Tantsura
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)