@techreport{filsfils-spring-path-tracing-srmpls-05, number = {draft-filsfils-spring-path-tracing-srmpls-05}, type = {Internet-Draft}, institution = {Internet Engineering Task Force}, publisher = {Internet Engineering Task Force}, note = {Work in Progress}, url = {https://datatracker.ietf.org/doc/draft-filsfils-spring-path-tracing-srmpls/05/}, author = {Clarence Filsfils and Ahmed Abdelsalam and Pablo Camarillo and Israel Meilik and Mike Valentine and Ruediger Geib and Jonathan Desmarais}, title = {{Path Tracing in SR-MPLS networks}}, pagetotal = 11, year = 2024, month = nov, day = 9, 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{]}.}, }