SRIFT: Segment Routing In Fat Trees
draft-zzhang-rift-sr-01
Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Replaced".
Expired & archived
|
|
---|---|---|---|
Authors | Zhaohui (Jeffrey) Zhang , Jeff Tantsura , Don Fedyk | ||
Last updated | 2019-10-27 (Latest revision 2019-04-25) | ||
Replaced by | draft-ietf-rift-sr | ||
RFC stream | (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
This document specifies signaling procedures for Segment Routing [RFC8402] with RIFT. Each node's loopback address, Segment Routing Global Block (SRGB) and Node Segment Identifier (SID), which must be unique within the SR domain and are typically assigned by SR controllers or management, are distributed southbound from the Top Of Fabric (TOF) nodes via the Key-Value distribution mechanism, so that each node can compute how to reach a node represented by the topmost Node SIDs . For an ingress node to send SR traffic to another node via an explicit path, an SR controller signals the corresponding label stack to the ingress node so that the ingress node can send packets accordingly.
Authors
Zhaohui (Jeffrey) Zhang
Jeff Tantsura
Don Fedyk
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)