Use Cases of Computing-aware Service Function Chaining (SFC)
draft-zhang-computing-aware-sfc-usecase-00
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Shuai Zhang , Xia Chen | ||
| Last updated | 2022-07-25 (Latest revision 2022-01-18) | ||
| 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
Multiple occurrences of the same service function(SF) can exist in the same administrative domain and each occurrence of SF is called SF instance. A Service Function Path(SFP) is determined by composing selected SF instances and overlay links. The SF instances are selected according to the computing power of SFs in addition to the network information and this is defined as the computing-aware SFC in this document. This document describes the use cases for computing-aware Service Function Chaining(SFC).
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)