Proof of Transit
draft-brockners-proof-of-transit-03
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
|
|
|---|---|---|---|
| Authors | Frank Brockners , Shwetha Bhandari , Sashank Dara , Carlos Pignataro , John Leddy , Stephen Youell , David Mozes , Tal Mizrahi | ||
| Last updated | 2017-09-14 (Latest revision 2017-03-13) | ||
| Replaced by | draft-ietf-sfc-proof-of-transit | ||
| 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
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
Shwetha Bhandari
Sashank Dara
Carlos Pignataro
John Leddy
Stephen Youell
David Mozes
Tal Mizrahi
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)