Analysis of the SFC scalability
draft-ao-sfc-scalability-analysis-03

Document Type Expired Internet-Draft (individual)
Last updated 2018-05-03 (latest revision 2017-10-30)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html 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)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-ao-sfc-scalability-analysis-03.txt

Abstract

SFC is an ordered set of service function, should be scalable to meet broad range of requirements. The scalability of SFC can be interpreted as ability of the SFC to accommodate one or more SFs joining the SFC , or leaving the SFC without significant impact to SFC performance. This document presents four aspects on SFC scalability, and provide analysis of the data plane and the control plane to implement the scalable SFC.

Authors

Ting Ao (ao.ting@zte.com.cn)
Gregory Mirsky (gregimirsky@gmail.com)

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