Proof of Transit
draft-ietf-sfc-proof-of-transit-08
| Document | Type |
Expired Internet-Draft
(sfc WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Frank Brockners , Shwetha Bhandari , Tal Mizrahi , Sashank Dara , Stephen Youell | ||
| Last updated | 2021-11-08 (Latest revision 2020-11-01) | ||
| Replaces | draft-brockners-proof-of-transit | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Formats | |||
| Reviews |
SECDIR Last Call review
by Christian Huitema
Serious Issues
YANGDOCTORS Last Call review
by Martin Björklund
Ready w/nits
|
||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | Submitted to IESG for Publication | |
| Document shepherd | Nagendra Kumar Nainar | ||
| Shepherd write-up | Show Last changed 2020-08-02 | ||
| IESG | IESG state | Expired (IESG: Dead) | |
| Consensus boilerplate | Yes | ||
| Telechat date | (None) | ||
| Responsible AD | Martin Vigoureux | ||
| Send notices to | Nagendra Nainar <naikumar@cisco.com> | ||
| IANA | IANA review state | IANA OK - Actions Needed | |
| IANA expert review state | Expert Reviews OK |
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 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. This document specifies a data model to enable these mechanisms using YANG.
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.)