IGP Flexible Algorithms Reverse Affinity Constraint
draft-ppsenak-lsr-igp-flex-algo-reverse-affinity-02
| Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Peter Psenak , Jakub Horn , Amit Dhamija | ||
| Last updated | 2024-01-25 (Latest revision 2023-07-24) | ||
| Replaced by | draft-ietf-lsr-igp-flex-algo-reverse-affinity | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-lsr-igp-flex-algo-reverse-affinity | |
| 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
An IGP Flexible Algorithm (Flex-Algorithm) allows IGPs to compute constraint-based paths. This document extends IGP Flex-Algorithm with additional constraints.
Authors
Peter Psenak
Jakub Horn
Amit Dhamija
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)