PCEP Extensions for Service Function Chaining (SFC)
draft-wu-pce-traffic-steering-sfc-12
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2018-01-01 (latest revision 2017-06-30) | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-wu-pce-traffic-steering-sfc-12.txt
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
(bill.wu@huawei.com)
Dhruv Dhody
(dhruv.ietf@gmail.com)
Mohamed Boucadair
(mohamed.boucadair@orange.com)
Christian Jacquenet
(christian.jacquenet@orange.com)
Jeff Tantsura
(jefftant.ietf@gmail.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)