[sfc] I-D Action: draft-ietf-sfc-proof-of-transit-07.txt

internet-drafts@ietf.org Sun, 25 October 2020 13:36 UTC

Return-Path: <internet-drafts@ietf.org>
X-Original-To: sfc@ietf.org
Delivered-To: sfc@ietfa.amsl.com
Received: from ietfa.amsl.com (localhost [IPv6:::1]) by ietfa.amsl.com (Postfix) with ESMTP id 707A93A08C0; Sun, 25 Oct 2020 06:36:41 -0700 (PDT)
MIME-Version: 1.0
Content-Type: text/plain; charset="utf-8"
Content-Transfer-Encoding: 7bit
From: internet-drafts@ietf.org
To: i-d-announce@ietf.org
Cc: sfc@ietf.org
X-Test-IDTracker: no
X-IETF-IDTracker: 7.20.0
Auto-Submitted: auto-generated
Precedence: bulk
Reply-To: sfc@ietf.org
Message-ID: <160363300140.27527.16990698011216122226@ietfa.amsl.com>
Date: Sun, 25 Oct 2020 06:36:41 -0700
Archived-At: <https://mailarchive.ietf.org/arch/msg/sfc/lu2dTTcwAq0gIzA8KS1UfAkhM7c>
Subject: [sfc] I-D Action: draft-ietf-sfc-proof-of-transit-07.txt
X-BeenThere: sfc@ietf.org
X-Mailman-Version: 2.1.29
List-Id: Network Service Chaining <sfc.ietf.org>
List-Unsubscribe: <https://www.ietf.org/mailman/options/sfc>, <mailto:sfc-request@ietf.org?subject=unsubscribe>
List-Archive: <https://mailarchive.ietf.org/arch/browse/sfc/>
List-Post: <mailto:sfc@ietf.org>
List-Help: <mailto:sfc-request@ietf.org?subject=help>
List-Subscribe: <https://www.ietf.org/mailman/listinfo/sfc>, <mailto:sfc-request@ietf.org?subject=subscribe>
X-List-Received-Date: Sun, 25 Oct 2020 13:36:41 -0000

A New Internet-Draft is available from the on-line Internet-Drafts directories.
This draft is a work item of the Service Function Chaining WG of the IETF.

        Title           : Proof of Transit
        Authors         : Frank Brockners
                          Shwetha Bhandari
                          Tal Mizrahi
                          Sashank Dara
                          Stephen Youell
	Filename        : draft-ietf-sfc-proof-of-transit-07.txt
	Pages           : 31
	Date            : 2020-10-25

Abstract:
   Several technologies such as Traffic Engineering (TE), Service
   Function Chaining (SFC), and policy based routing are used to steer
   traffic through a specific, user-defined path.  This document defines
   mechanisms to securely prove that traffic transited a defined path.
   These mechanisms allow to securely verify whether, within a given
   path, all packets traversed all the nodes that they are supposed to
   visit.  The document defines the data model through Unified Modeling
   Language (UML) class diagrams and formally specifies it using an
   NDMA- compliant YANG model to enable these mechanisms.


The IETF datatracker status page for this draft is:
https://datatracker.ietf.org/doc/draft-ietf-sfc-proof-of-transit/

There are also htmlized versions available at:
https://tools.ietf.org/html/draft-ietf-sfc-proof-of-transit-07
https://datatracker.ietf.org/doc/html/draft-ietf-sfc-proof-of-transit-07

A diff from the previous version is available at:
https://www.ietf.org/rfcdiff?url2=draft-ietf-sfc-proof-of-transit-07


Please note that it may take a couple of minutes from the time of submission
until the htmlized version and diff are available at tools.ietf.org.

Internet-Drafts are also available by anonymous FTP at:
ftp://ftp.ietf.org/internet-drafts/