IGP Flexible Algorithm with Link Loss
draft-xu-lsr-flex-algo-link-loss-00
| Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Guoqi Xu , Wang Yifan | ||
| Last updated | 2023-10-13 | ||
| Replaced by | draft-wang-lsr-flex-algo-link-loss | ||
| 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-wang-lsr-flex-algo-link-loss | |
| 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
IGP Flexible Algorithms allow IGPs to compute constraint-based paths. Since link loss plays an important role in network evaluation, links with high packet loss rate should be bypassed during forwarding. This draft proposes a path computation method based on a link loss constraint to prune unsatisfied links in Flexible Algorithms.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)