Optimized Service Function Chaining
draft-khalili-sfc-optimized-chaining-01

Document Type Active Internet-Draft (individual)
Last updated 2018-08-28
Replaces draft-khalili-optimized-service-function-chaining
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
SFC WG                                                        R. Khalili
Internet-Draft                                             Z. Despotovic
Intended status: Informational                                 A. Hecker
Expires: March 1, 2019                       Huawei ERC, Munich, Germany
                                                          D. Purkayastha
                                                               A. Rahman
                                                              D. Trossen
                                        InterDigital Communications, LLC
                                                         August 28, 2018

                  Optimized Service Function Chaining 
                draft-khalili-sfc-optimized-chaining-01

Abstract

   This draft investigates possibilities to use so-called 'transport-
   derived service function forwarders' (tSFFs) that uses existing
   transport information for explicit service path information. The
   draft discusses two such possibilities, focusing on realization of
   efficient chaining over single transport networks. In the first one,
   the transport network is SDN-based. The second one introduces and
   explains a specific service request routing (SRR) function to support
   URL-level routing of service requests. 

Status of this Memo

   This Internet-Draft is submitted to IETF in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF), its areas, and its working groups.  Note that
   other groups may also distribute working documents as
   Internet-Drafts.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   The list of current Internet-Drafts can be accessed at
   http://www.ietf.org/1id-abstracts.html

   The list of Internet-Draft Shadow Directories can be accessed at
   http://www.ietf.org/shadow.html

Copyright and License Notice

 

R. Khalili et al.        Expires March 1, 2019                  [Page 1]
INTERNET DRAFT    Optimized Service Function Chaining    August 28, 2018

   Copyright (c) 2018 IETF Trust and the persons identified as the
   document authors. All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (http://trustee.ietf.org/license-info) in effect on the date of
   publication of this document. Please review these documents
   carefully, as they describe your rights and restrictions with respect
   to this document. Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . .  3
     1.1  Terminology . . . . . . . . . . . . . . . . . . . . . . . .  4
   2 SFC Forwarding Solutions . . . . . . . . . . . . . . . . . . . .  5
     2.1 Edge classification and network forwarding aggregation . . .  5
       2.1.1 Example  . . . . . . . . . . . . . . . . . . . . . . . .  5
     2.2 SRR  . . . . . . . . . . . . . . . . . . . . . . . . . . . .  7
   3 Optimized SFC Chaining . . . . . . . . . . . . . . . . . . . . .  9
     3.1 Utilizing Transport-derived SFFs . . . . . . . . . . . . . .  9
       3.1.1 Hierarchical addressing for service chaining . . . . . .  9
       3.1.2 Edge classification and service chains . . . . . . . . . 10
     3.2 Pre-Warming SFP Information for SRR-based Chaining . . . . . 11
   4 Applicability  . . . . . . . . . . . . . . . . . . . . . . . . . 14
   5 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
   6 Informative References . . . . . . . . . . . . . . . . . . . . . 16
   Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . . 17

 

R. Khalili et al.        Expires March 1, 2019                  [Page 2]
INTERNET DRAFT    Optimized Service Function Chaining    August 28, 2018

1 Introduction

   The delivery of end-to-end network services often requires steering
   traffic through a sequence of individual service functions.
   Deployment of these functions and particularly creation of a
   composite service from them, i.e. steering traffic through them, had
   traditionally been coupled to the underlying network topology and as
   such awkward to configure and operate [RFC7498]. 

   To remedy the problems identified by [RFC7498], [RFC7665] defines
   architecture for service function chaining that is topology
   independent. The architecture is predicated on a service indirection
Show full document text