Analysis of the SFC scalability
draft-ao-sfc-scalability-analysis-03
Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
---|---|---|---|
Authors | Ting Ao , Greg Mirsky | ||
Last updated | 2018-05-03 (Latest revision 2017-10-30) | ||
RFC stream | (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
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
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)