draft-ietf-ospf-segment-routing-extensions-08.txt   draft-ietf-ospf-segment-routing-extensions-09.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: October 29, 2016 Cisco Systems, Inc. Expires: January 7, 2017 Cisco Systems, Inc.
H. Gredler H. Gredler
Individual Individual
R. Shakir R. Shakir
Jive Communications, Inc. Jive Communications, Inc.
W. Henderickx W. Henderickx
Alcatel-Lucent Nokia
J. Tantsura J. Tantsura
Individual Individual
April 27, 2016 July 6, 2016
OSPF Extensions for Segment Routing OSPF Extensions for Segment Routing
draft-ietf-ospf-segment-routing-extensions-08 draft-ietf-ospf-segment-routing-extensions-09
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 http://datatracker.ietf.org/drafts/current/. Drafts is at http://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 October 29, 2016. This Internet-Draft will expire on January 7, 2017.
Copyright Notice Copyright Notice
Copyright (c) 2016 IETF Trust and the persons identified as the Copyright (c) 2016 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
(http://trustee.ietf.org/license-info) in effect on the date of (http://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 4, line 51 skipping to change at page 5, line 4
LSA (defined in [RFC7770]). LSA (defined in [RFC7770]).
3.1. SR-Algorithm TLV 3.1. SR-Algorithm TLV
The SR-Algorithm TLV is a top-level TLV of the Router Information The SR-Algorithm TLV is a top-level TLV of the Router Information
Opaque LSA (defined in [RFC7770]). Opaque LSA (defined in [RFC7770]).
The SR-Algorithm Sub-TLV is optional. It MAY only be advertised once The SR-Algorithm Sub-TLV is optional. It MAY only be advertised once
in the Router Information Opaque LSA. If the SID/Label Range TLV, as in the Router Information Opaque LSA. If the SID/Label Range TLV, as
defined in Section 3.2, is advertised, then the SR-Algorithm TLV MUST defined in Section 3.2, is advertised, then the SR-Algorithm TLV MUST
also be advertised. also be advertised. If the SR-Algorithm TLV is not advertised by the
node, such node is considered as not being segment routing capable.
An SR Router may use various algorithms when calculating reachability An SR Router may use various algorithms when calculating reachability
to OSPF routers or prefixes in an OSPF area. Examples of these to OSPF routers or prefixes in an OSPF area. Examples of these
algorithms are metric based Shortest Path First (SPF), various algorithms are metric based Shortest Path First (SPF), various
flavors of Constrained SPF, etc. The SR-Algorithm TLV allows a flavors of Constrained SPF, etc. The SR-Algorithm TLV allows a
router to advertise the algorithms currently used by the router to router to advertise the algorithms currently used by the router to
other routers in an OSPF area. The SR-Algorithm TLV has following other routers in an OSPF area. The SR-Algorithm TLV has following
format: format:
0 1 2 3 0 1 2 3
skipping to change at page 32, line 5 skipping to change at page 32, line 5
Email: hannes@gredler.at Email: hannes@gredler.at
Rob Shakir Rob Shakir
Jive Communications, Inc. Jive Communications, Inc.
1275 West 1600 North, Suite 100 1275 West 1600 North, Suite 100
Orem, UT 84057 Orem, UT 84057
US US
Email: rrjs@rob.sh Email: rrjs@rob.sh
Wim Henderickx Wim Henderickx
Alcatel-Lucent Nokia
Copernicuslaan 50 Copernicuslaan 50
Antwerp 2018 Antwerp 2018
BE BE
Email: wim.henderickx@alcatel-lucent.com Email: wim.henderickx@nokia.com
Jeff Tantsura Jeff Tantsura
Individual Individual
US US
Email: Jeff.Tantsura@ericsson.com Email: jefftant.ietf@gmail.com
 End of changes. 9 change blocks. 
8 lines changed or deleted 9 lines changed or added

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