Proof of Transit
draft-brockners-proof-of-transit-03

The information below is for an old version of the document
Document Type Expired Internet-Draft (individual)
Last updated 2017-09-14 (latest revision 2017-03-13)
Replaced by draft-ietf-sfc-proof-of-transit
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Additional URLs
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-brockners-proof-of-transit-03.txt

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 said 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.

Authors

Frank Brockners (fbrockne@cisco.com)
Shwetha Bhandari (shwethab@cisco.com)
Sashank Dara (sadara@cisco.com)
Carlos Pignataro (cpignata@cisco.com)
John Leddy (john_leddy@cable.comcast.com)
Stephen Youell (stephen.youell@jpmorgan.com)
David Mozes (davidm@mellanox.com)
Tal Mizrahi (talmi@marvell.com)

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