Service Function Path Optimization

Document Type Replaced Internet-Draft (individual)
Last updated 2016-06-10 (latest revision 2014-10-24)
Replaced by draft-kumar-sfc-offloads
Stream (None)
Intended RFC status (None)
Expired & archived
pdf htmlized (tools) htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Replaced by draft-kumar-sfc-offloads
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at


Service Function Chaining (SFC) enables services to be delivered by selective traffic steering through an ordered set of service functions. Once classified into an SFC, the traffic for a given flow is steered through all the service functions of the SFC for the life of the traffic flow even though this is often not necessary. Steering traffic to service functions only while required and not otherwise, leads to optimal SFCs with improved latencies, reduced resource consumption and better user experience. This document describes the rationale, techniques and necessary protocol extensions to achieve such optimization.


Surendra Kumar (
Jim Guichard (
Paul Quinn (
Joel Halpern (

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)