Future-Proof TLV Codepoint Space for LSP Ping
draft-farrel-mpls-lsp-ping-tlvs-01

Document Type Expired Internet-Draft (individual)
Authors Adrian Farrel  , George Swallow 
Last updated 2007-11-17
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-farrel-mpls-lsp-ping-tlvs-01.txt

Abstract

Techniques for detecting Multi-Protocol Label Switched (MPLS) data plane failures are described in RFC 4379 and include the definition of a control protocol for testing and verifying Label Switched Path (LSP) connectivity that is known as LSP Ping. The protocol consists of a set of messages each of which contains data encoded as TLVs. The LSP Ping protocol is being extended for several related uses. Each extension gives rise to the definition of new TLVs to be carried on the existing protocol messages. The LSP Ping specification makes it mandatory that all TLVs are understood by each participating Label Switching Router (LSR) that receives an LSP Ping message. This makes future extensibility hard without upgrading all LSRs in the network. This document defines ranges in the TLV codepoint space so that TLVs may be associated with different processing rules within an LSR if the TLV is unknown. This will make extensibility more simple.

Authors

Adrian Farrel (adrian@olddog.co.uk)
George Swallow (swallow@cisco.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)