Extensions to Resource Reservation Protocol For Re-optimization of Loosely Routed Point-to-Multipoint Traffic Engineering LSPs
draft-ietf-mpls-p2mp-loose-path-reopt-01
| Document | Type |
Replaced Internet-Draft
(teas WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Tarek Saad , Rakesh Gandhi , Zafar Ali , Robert H. Venator , Yuji Kamite | ||
| Last updated | 2014-12-08 (Latest revision 2014-09-30) | ||
| Replaces | draft-tsaad-mpls-p2mp-loose-path-reopt | ||
| Replaced by | RFC 8149 | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Reviews | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | Dead WG Document | |
| Document shepherd | Loa Andersson | ||
| IESG | IESG state | Replaced by draft-ietf-teas-p2mp-loose-path-reopt | |
| Consensus boilerplate | Unknown | ||
| 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
For a Traffic Engineered (TE) point-to-multipoint (P2MP) Label Switched Path (LSP), it is preferable in some cases to re-evaluate and re-optimize the entire P2MP-TE LSP by re-signaling all its Source-to-Leaf (S2L) sub-LSP(s). Existing mechanisms, a mechanism for an ingress Label Switched Router (LSR) to trigger a new path re- evaluation request and a mechanism for a mid-point LSR to notify an availability of a preferred path, operate on an individual or a sub- group of S2L sub-LSP(s) basis only. This document defines RSVP-TE signaling extensions to allow an ingress node of a P2MP-TE LSP to request the re-evaluation of the entire LSP tree containing one or more S2L sub-LSPs whose paths are loose (or abstract) hop expanded, and for a mid-point LSR to notify to the ingress node that a preferable tree exists for the entire P2MP-TE LSP. This document also defines markers to indicate beginning and end of a S2L sub-LSP descriptor list when RSVP message needs to be fragmented due to large number of S2L sub-LSPs when performing re-optimization.
Authors
Tarek Saad
Rakesh Gandhi
Zafar Ali
Robert H. Venator
Yuji Kamite
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)