Proof of Transit
draft-ietf-sfc-proof-of-transit-04
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Frank Brockners , Shwetha Bhandari , Tal Mizrahi , Sashank Dara , Stephen Youell | ||
| Last updated | 2020-05-23 (Latest revision 2019-11-20) | ||
| Replaces | draft-brockners-proof-of-transit | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Formats | |||
| Reviews |
SECDIR Last Call review
(of
-08)
by Christian Huitema
Serious Issues
|
||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| 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
Tal Mizrahi
Sashank Dara
Stephen Youell
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)