draft-ietf-ospf-segment-routing-extensions-20.txt   draft-ietf-ospf-segment-routing-extensions-21.txt 
Open Shortest Path First IGP P. Psenak, Ed. Open Shortest Path First IGP P. Psenak, Ed.
Internet-Draft S. Previdi, Ed. Internet-Draft S. Previdi, Ed.
Intended status: Standards Track C. Filsfils Intended status: Standards Track C. Filsfils
Expires: April 23, 2018 Cisco Systems, Inc. Expires: April 27, 2018 Cisco Systems, Inc.
H. Gredler H. Gredler
RtBrick Inc. RtBrick Inc.
R. Shakir R. Shakir
Google, Inc. Google, Inc.
W. Henderickx W. Henderickx
Nokia Nokia
J. Tantsura J. Tantsura
Individual Individual
October 20, 2017 October 24, 2017
OSPF Extensions for Segment Routing OSPF Extensions for Segment Routing
draft-ietf-ospf-segment-routing-extensions-20 draft-ietf-ospf-segment-routing-extensions-21
Abstract Abstract
Segment Routing (SR) allows a flexible definition of end-to-end paths Segment Routing (SR) allows a flexible definition of end-to-end paths
within IGP topologies by encoding paths as sequences of topological within IGP topologies by encoding paths as sequences of topological
sub-paths, called "segments". These segments are advertised by the sub-paths, called "segments". These segments are advertised by the
link-state routing protocols (IS-IS and OSPF). link-state routing protocols (IS-IS and OSPF).
This draft describes the OSPF extensions required for Segment This draft describes the OSPF extensions required for Segment
Routing. Routing.
skipping to change at page 2, line 4 skipping to change at page 2, line 4
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/. Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on April 23, 2018. This Internet-Draft will expire on April 27, 2018.
Copyright Notice Copyright Notice
Copyright (c) 2017 IETF Trust and the persons identified as the Copyright (c) 2017 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of (https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents publication of this document. Please review these documents
skipping to change at page 2, line 48 skipping to change at page 2, line 48
7.2. Inter-area Segment routing in OSPFv2 . . . . . . . . . . 20 7.2. Inter-area Segment routing in OSPFv2 . . . . . . . . . . 20
7.3. Segment Routing for External Prefixes . . . . . . . . . . 21 7.3. Segment Routing for External Prefixes . . . . . . . . . . 21
7.4. Advertisement of Adj-SID . . . . . . . . . . . . . . . . 21 7.4. Advertisement of Adj-SID . . . . . . . . . . . . . . . . 21
7.4.1. Advertisement of Adj-SID on Point-to-Point Links . . 21 7.4.1. Advertisement of Adj-SID on Point-to-Point Links . . 21
7.4.2. Adjacency SID on Broadcast or NBMA Interfaces . . . . 21 7.4.2. Adjacency SID on Broadcast or NBMA Interfaces . . . . 21
8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 22 8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 22
8.1. OSPF OSPF Router Information (RI) TLVs Registry . . . . . 22 8.1. OSPF OSPF Router Information (RI) TLVs Registry . . . . . 22
8.2. OSPF Extended Prefix LSA TLV Registry . . . . . . . . . . 22 8.2. OSPF Extended Prefix LSA TLV Registry . . . . . . . . . . 22
8.3. OSPF Extended Prefix LSA Sub-TLV Registry . . . . . . . . 22 8.3. OSPF Extended Prefix LSA Sub-TLV Registry . . . . . . . . 22
8.4. OSPF Extended Link LSA Sub-TLV Registry . . . . . . . . . 22 8.4. OSPF Extended Link LSA Sub-TLV Registry . . . . . . . . . 22
8.5. SR-Algorithm Registry . . . . . . . . . . . . . . . . . . 23 8.5. IGP Algorithm Type Registry . . . . . . . . . . . . . . . 23
9. Implementation Status . . . . . . . . . . . . . . . . . . . . 23 9. Implementation Status . . . . . . . . . . . . . . . . . . . . 23
10. Security Considerations . . . . . . . . . . . . . . . . . . . 25 10. Security Considerations . . . . . . . . . . . . . . . . . . . 25
11. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 25 11. Contributors . . . . . . . . . . . . . . . . . . . . . . . . 25
12. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 25 12. Acknowledgements . . . . . . . . . . . . . . . . . . . . . . 25
13. References . . . . . . . . . . . . . . . . . . . . . . . . . 25 13. References . . . . . . . . . . . . . . . . . . . . . . . . . 25
13.1. Normative References . . . . . . . . . . . . . . . . . . 26 13.1. Normative References . . . . . . . . . . . . . . . . . . 26
13.2. Informative References . . . . . . . . . . . . . . . . . 26 13.2. Informative References . . . . . . . . . . . . . . . . . 26
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 27 Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 27
1. Introduction 1. Introduction
skipping to change at page 23, line 5 skipping to change at page 23, line 5
8.4. OSPF Extended Link LSA Sub-TLV Registry 8.4. OSPF Extended Link LSA Sub-TLV Registry
Following initial values are allocated: Following initial values are allocated:
o 1 - SID/Label Sub-TLV o 1 - SID/Label Sub-TLV
o 2 - Adj-SID Sub-TLV o 2 - Adj-SID Sub-TLV
o 3 - LAN Adj-SID/Label Sub-TLV o 3 - LAN Adj-SID/Label Sub-TLV
8.5. SR-Algorithm Registry 8.5. IGP Algorithm Type Registry
IANA is requested to set up a registry called "SR-Algorithm Type". IANA is requested to set up a registry called "IGP Algorithm Type".
The registration policy for this registry is "Standards Action" The registration policy for this registry is "Standards Action"
([RFC8126] and [RFC7120]). ([RFC8126] and [RFC7120]).
Values in this registry must come from the range 0-255. Values in this registry must come from the range 0-255.
The initial values in the SR-Algorithm Type registry are: The initial values in the IGP Algorithm Type registry are:
0: Shortest Path First (SPF) algorithm based on link metric. This 0: Shortest Path First (SPF) algorithm based on link metric. This
is the standard shortest path algorithm as computed by the IGP is the standard shortest path algorithm as computed by the IGP
protocol. Consistent with the deployed practice for link-state protocol. Consistent with the deployed practice for link-state
protocols, Algorithm 0 permits any node to overwrite the SPF path protocols, Algorithm 0 permits any node to overwrite the SPF path
with a different path based on its local policy. with a different path based on its local policy.
1: Strict Shortest Path First (SPF) algorithm based on link 1: Strict Shortest Path First (SPF) algorithm based on link
metric. The algorithm is identical to Algorithm 0 but Algorithm 1 metric. The algorithm is identical to Algorithm 0 but Algorithm 1
requires that all nodes along the path will honor the SPF routing requires that all nodes along the path will honor the SPF routing
 End of changes. 8 change blocks. 
8 lines changed or deleted 8 lines changed or added

This html diff was produced by rfcdiff 1.46. The latest version is available from http://tools.ietf.org/tools/rfcdiff/