IGP Flexible Algorithm with Link Loss
draft-wang-lsr-flex-algo-link-loss-03
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Wang Yifan , Guoqi Xu , Xuesong Geng , Jie Dong , Peter Psenak | ||
| Last updated | 2024-12-30 (Latest revision 2024-06-28) | ||
| Replaces | draft-xu-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 | 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
IGP Flexible Algorithms allow IGPs to compute constraint-based paths. Since link packet loss rate 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 maximum link loss constraint to prune unsatisfied links in Flexible Algorithms.
Authors
Wang Yifan
Guoqi Xu
Xuesong Geng
Jie Dong
Peter Psenak
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)