SRIFT: Segment Routing in Fat Trees
draft-zzhang-rift-sr-03
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Authors | Zhaohui (Jeffrey) Zhang , Jeff Tantsura , Jordan Head , Don Fedyk | ||
| Last updated | 2021-08-26 (Latest revision 2021-02-22) | ||
| Stream | (None) | ||
| Formats |
Expired & archived
plain text
htmlized
pdfized
bibtex
|
||
| 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) |
https://www.ietf.org/archive/id/draft-zzhang-rift-sr-03.txt
Abstract
This document specifies signaling procedures for Segment Routing in RIFT. Each node's loopback address, Segment Routing Global Block (SRGB) and Node Segment Identifier (Node-SID), which are typically assigned by a configuration management system and distibuted by routing protocols, are distributed southbound from the Top Of Fabric (TOF) nodes via RIFT's Key-Value distribution mechanism, so that each node can compute how to reach a segment represented by the active SID in a packet. An SR controller signals SR policies to ingress nodes so that they can send packets with a desired segment list to steer traffic.
Authors
Zhaohui (Jeffrey) Zhang
Jeff Tantsura
Jordan Head
Don Fedyk
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)