Path Tracing in SR-MPLS networks
draft-filsfils-spring-path-tracing-srmpls-02
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Active".
Expired & archived
|
|
|---|---|---|---|
| Authors | Clarence Filsfils , Ahmed Abdelsalam , Pablo Camarillo , Israel Meilik , Mike Valentine , Ruediger Geib , Jonathan Desmarais | ||
| Last updated | 2023-11-18 (Latest revision 2023-05-17) | ||
| 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
Path Tracing provides a record of the packet path as a sequence of interface ids. In addition, it provides a record of end-to-end delay, per-hop delay, and load on each interface that forwards the packet. Path Tracing has the lowest MTU overhead compared to alternative proposals such as [INT], [RFC9197], [I-D.song-opsawg-ifit-framework], and [I-D.kumar-ippm-ifa]. Path Tracing supports fine grained timestamp. It has been designed for linerate hardware implementation in the base pipeline. This document defines the Path Tracing specification for the SR-MPLS dataplane. The Path Tracing specification for the SRv6 dataplane is defined in [I-D.filsfils-spring-path-tracing].
Authors
Clarence Filsfils
Ahmed Abdelsalam
Pablo Camarillo
Israel Meilik
Mike Valentine
Ruediger Geib
Jonathan Desmarais
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)