Segment Routing Recursive Information
draft-filsfils-spring-sr-recursing-info-05
| Document | Type |
Expired Internet-Draft
(candidate for spring WG)
Expired & archived
|
|
|---|---|---|---|
| Authors | Clarence Filsfils , Stefano Previdi , Peter Psenak , Les Ginsberg | ||
| Last updated | 2017-12-22 (Latest revision 2017-06-20) | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | Call For Adoption By WG Issued | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| 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
Segment Routing (SR) allows for a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). There are use cases where it is desirable to utilize a SID associated with a given node in order to transport traffic destined to different local services supported by such node. This document defines the mechanism to do so and illustrates it.
Authors
Clarence Filsfils
Stefano Previdi
Peter Psenak
Les Ginsberg
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)