Flexible Algorithms: Bandwidth, Delay, Metrics and Constraints
draft-ietf-lsr-flex-algo-bw-con-01
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Active".
Expired & archived
|
|
|---|---|---|---|
| Authors | Shraddha Hegde , William Britto , Rejesh Shetty , Bruno Decraene , Peter Psenak , Tony Li | ||
| Last updated | 2022-01-13 (Latest revision 2021-07-12) | ||
| Replaces | draft-hegde-lsr-flex-algo-bw-con | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | Acee Lindem | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Yes | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | acee@cisco.com |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
Many networks configure the link metric relative to the link capacity. High bandwidth traffic gets routed as per the link capacity. Flexible algorithms provides mechanisms to create constraint based paths in IGP. This draft documents a generic metric type and set of bandwidth related constraints to be used in Flexible Algorithms.
Authors
Shraddha Hegde
William Britto
Rejesh Shetty
Bruno Decraene
Peter Psenak
Tony Li
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)