ISIS Segment Routing Flexible Algorithm
draft-hegdeppsenak-isis-sr-flex-algo-02
| Document | Type | Replaced Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2018-02-16 | ||
| Replaced by | draft-ietf-lsr-flex-algo | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized
bibtex
|
||
| 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 | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-hegdeppsenak-isis-sr-flex-algo-02.txt
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
(ppsenak@cisco.com)
Shraddha Hegde
(shraddha@juniper.net)
Clarence Filsfils
(cfilsfil@cisco.com)
Arkadiy Gulko
(arkadiy.gulko@thomsonreuters.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)