OSPF Segment Routing Flexible Algorithm
draft-ppsenak-ospf-sr-flex-algo-00
| Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Peter Psenak , Ketan Talaulikar , Shraddha Hegde , Arkadiy Gulko | ||
| Last updated | 2018-02-16 | ||
| Replaced by | draft-ietf-lsr-flex-algo | ||
| 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-flex-algo | |
| 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 protocols traditionally compute best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE based or Segment Routing based Traffic Engineering to enforce traffic over a path that is computed using different metrics or constraints than the shortest IGP path. Various mechanisms are used to steer the traffic towards such traffic engineered paths. This document proposes a solution that allows IGPs themselves to compute constraint based paths over the network without the use of the above mentioned traffic engineering technologies.
Authors
Peter Psenak
Ketan Talaulikar
Shraddha Hegde
Arkadiy Gulko
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)