A fast LSP-alert Mechanism
draft-kini-mpls-fast-lsp-alert-02
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Sriganesh Kini , Autumn Liu | ||
| Last updated | 2011-01-13 | ||
| RFC stream | (None) | ||
| Intended RFC status | (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
There are applications (e.g. fault-management, OAM) that need to alert LSRs along an LSP. Currently defined alert mechanisms for labeled packets (e.g., TTL expiry, GAL, etc) alert a single LSR along the LSP with one alert message. To alert multiple LSRs along the LSP, multiple alert messages have to be generated. This results in increasing delays in generating the message as the number of LSRs increase. If the message is used to recover from faults, it results in increasing traffic loss. This document defines a simple and fast mechanism that can alert all the LSRs along a LSP.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)