Service Function Path Optimization
draft-kumar-sfc-sfp-optimization-01
Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Authors | Surendra Kumar , Jim Guichard , Paul Quinn , Joel M. Halpern | ||
Last updated | 2016-06-10 (Latest revision 2014-10-24) | ||
Replaced by | draft-kumar-sfc-offloads | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Replaced by draft-kumar-sfc-offloads | |
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
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.
Authors
Surendra Kumar
Jim Guichard
Paul Quinn
Joel M. Halpern
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)