draft-ietf-lsr-flex-algo-03.txt   draft-ietf-lsr-flex-algo-04.txt 
Network Working Group P. Psenak, Ed. Network Working Group P. Psenak, Ed.
Internet-Draft Cisco Systems Internet-Draft Cisco Systems
Intended status: Standards Track S. Hegde Intended status: Standards Track S. Hegde
Expires: January 5, 2020 Juniper Networks, Inc. Expires: March 21, 2020 Juniper Networks, Inc.
C. Filsfils C. Filsfils
K. Talaulikar K. Talaulikar
Cisco Systems, Inc. Cisco Systems, Inc.
A. Gulko A. Gulko
Thomson Reuters Thomson Reuters
July 4, 2019 September 18, 2019
IGP Flexible Algorithm IGP Flexible Algorithm
draft-ietf-lsr-flex-algo-03.txt draft-ietf-lsr-flex-algo-04.txt
Abstract Abstract
IGP protocols traditionally compute best paths over the network based IGP protocols traditionally compute best paths over the network based
on the IGP metric assigned to the links. Many network deployments on the IGP metric assigned to the links. Many network deployments
use RSVP-TE based or Segment Routing based Traffic Engineering to use RSVP-TE based or Segment Routing based Traffic Engineering to
enforce traffic over a path that is computed using different metrics enforce traffic over a path that is computed using different metrics
or constraints than the shortest IGP path. This document proposes a or constraints than the shortest IGP path. This document proposes a
solution that allows IGPs themselves to compute constraint based solution that allows IGPs themselves to compute constraint based
paths over the network. This document also specifies a way of using paths over the network. This document also specifies a way of using
skipping to change at page 1, line 44 skipping to change at page 1, line 44
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 January 5, 2020. This Internet-Draft will expire on March 21, 2020.
Copyright Notice Copyright Notice
Copyright (c) 2019 IETF Trust and the persons identified as the Copyright (c) 2019 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 14, line 51 skipping to change at page 14, line 51
0 1 2 3 0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type | Length |Flex-Algorithm | | Type | Length |Flex-Algorithm |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Metric | | Metric |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
where: where:
Type: TBD, suggested value 5 Type: TBD, suggested value 6
Length: 5 octets Length: 5 octets
Flex-Algorithm: Single octet value between 128 and 255 inclusive. Flex-Algorithm: Single octet value between 128 and 255 inclusive.
Metric: 4 octets of metric information Metric: 4 octets of metric information
ISIS FAPM Sub-TLV MAY appear multiple times in its parent TLV. If it ISIS FAPM Sub-TLV MAY appear multiple times in its parent TLV. If it
appears more then once with the same Flex-Algorithm value, the first appears more then once with the same Flex-Algorithm value, the first
appearance MUST be used and any subsequent ones MUST be ignored. appearance MUST be used and any subsequent ones MUST be ignored.
skipping to change at page 16, line 17 skipping to change at page 16, line 17
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Type | Length | | Type | Length |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|Flex-Algorithm | Reserved | |Flex-Algorithm | Reserved |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Metric | | Metric |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
where: where:
Type: TBD, suggested value for OSPFv2 is 3, for OSPFv3 is 10 Type: TBD, suggested value for OSPFv2 is 3, for OSPFv3 is 26
Length: 8 octets Length: 8 octets
Flex-Algorithm: Single octet value between 128 and 255 inclusive. Flex-Algorithm: Single octet value between 128 and 255 inclusive.
Reserved: Must be set to 0, ignored at reception. Reserved: Must be set to 0, ignored at reception.
Metric: 4 octets of metric information Metric: 4 octets of metric information
OSPF FAPM Sub-TLV MAY appear multiple times in its parent TLV. If it OSPF FAPM Sub-TLV MAY appear multiple times in its parent TLV. If it
skipping to change at page 24, line 12 skipping to change at page 24, line 12
Description: Flexible Algorithm Definition. Description: Flexible Algorithm Definition.
Reference: This document (Section 5.1). Reference: This document (Section 5.1).
16.3.2. Sub TLVs for for TLVs 135, 235, 236, and 237 16.3.2. Sub TLVs for for TLVs 135, 235, 236, and 237
This document makes the following registrations in the "Sub-TLVs for This document makes the following registrations in the "Sub-TLVs for
for TLVs 135, 235, 236, and 237" registry. for TLVs 135, 235, 236, and 237" registry.
Type: TBD (suggested value 5). Type: TBD (suggested value 6).
Description: Flex-Algorithm Prefix Metric. Description: Flex-Algorithm Prefix Metric.
Reference: This document (Section 8). Reference: This document (Section 8).
16.3.3. Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV 16.3.3. Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV
This document creates the following Sub-Sub-TLV Registry: This document creates the following Sub-Sub-TLV Registry:
Registry: Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV Registry: Sub-Sub-TLVs for Flexible Algorithm Definition Sub-TLV
skipping to change at page 25, line 31 skipping to change at page 25, line 31
Description: Flex-Algorithm Prefix Metric. Description: Flex-Algorithm Prefix Metric.
Reference: This document (Section 9). Reference: This document (Section 9).
16.4.3. OSPFv3 Extended-LSA Sub-TLVs 16.4.3. OSPFv3 Extended-LSA Sub-TLVs
This document makes the following registrations in the "OSPFv3 This document makes the following registrations in the "OSPFv3
Extended-LSA Sub-TLVs" registry. Extended-LSA Sub-TLVs" registry.
Type: TBD (suggested value 10). Type: TBD (suggested value 26).
Description: Flex-Algorithm Prefix Metric. Description: Flex-Algorithm Prefix Metric.
Reference: This document (Section 9). Reference: This document (Section 9).
16.4.4. OSPF Flexible Algorithm Definition TLV Sub-TLV Registry 16.4.4. OSPF Flexible Algorithm Definition TLV Sub-TLV Registry
This document creates the following registry: This document creates the following registry:
Registry: OSPF Flexible Algorithm Definition TLV sub-TLV Registry: OSPF Flexible Algorithm Definition TLV sub-TLV
skipping to change at page 27, line 24 skipping to change at page 27, line 24
Segment Routing", draft-ietf-isis-segment-routing- Segment Routing", draft-ietf-isis-segment-routing-
extensions-25 (work in progress), May 2019. extensions-25 (work in progress), May 2019.
[I-D.ietf-isis-te-app] [I-D.ietf-isis-te-app]
Ginsberg, L., Psenak, P., Previdi, S., Henderickx, W., and Ginsberg, L., Psenak, P., Previdi, S., Henderickx, W., and
J. Drake, "IS-IS TE Attributes per application", draft- J. Drake, "IS-IS TE Attributes per application", draft-
ietf-isis-te-app-06 (work in progress), April 2019. ietf-isis-te-app-06 (work in progress), April 2019.
[I-D.ietf-lsr-isis-srv6-extensions] [I-D.ietf-lsr-isis-srv6-extensions]
Psenak, P., Filsfils, C., Bashandy, A., Decraene, B., and Psenak, P., Filsfils, C., Bashandy, A., Decraene, B., and
Z. Hu, "IS-IS Extensions to Support Routing over IPv6 Z. Hu, "IS-IS Extension to Support Segment Routing over
Dataplane", draft-ietf-lsr-isis-srv6-extensions-00 (work IPv6 Dataplane", draft-ietf-lsr-isis-srv6-extensions-02
in progress), May 2019. (work in progress), July 2019.
[I-D.ietf-ospf-ospfv3-segment-routing-extensions] [I-D.ietf-ospf-ospfv3-segment-routing-extensions]
Psenak, P. and S. Previdi, "OSPFv3 Extensions for Segment Psenak, P. and S. Previdi, "OSPFv3 Extensions for Segment
Routing", draft-ietf-ospf-ospfv3-segment-routing- Routing", draft-ietf-ospf-ospfv3-segment-routing-
extensions-23 (work in progress), January 2019. extensions-23 (work in progress), January 2019.
[I-D.ietf-ospf-segment-routing-extensions] [I-D.ietf-ospf-segment-routing-extensions]
Psenak, P., Previdi, S., Filsfils, C., Gredler, H., Psenak, P., Previdi, S., Filsfils, C., Gredler, H.,
Shakir, R., Henderickx, W., and J. Tantsura, "OSPF Shakir, R., Henderickx, W., and J. Tantsura, "OSPF
Extensions for Segment Routing", draft-ietf-ospf-segment- Extensions for Segment Routing", draft-ietf-ospf-segment-
routing-extensions-27 (work in progress), December 2018. routing-extensions-27 (work in progress), December 2018.
[I-D.ietf-ospf-te-link-attr-reuse] [I-D.ietf-ospf-te-link-attr-reuse]
Psenak, P., Ginsberg, L., Henderickx, W., Tantsura, J., Psenak, P., Ginsberg, L., Henderickx, W., Tantsura, J.,
and J. Drake, "OSPF Link Traffic Engineering (TE) and J. Drake, "OSPF Link Traffic Engineering (TE)
Attribute Reuse", draft-ietf-ospf-te-link-attr-reuse-07 Attribute Reuse", draft-ietf-ospf-te-link-attr-reuse-08
(work in progress), April 2019. (work in progress), August 2019.
[I-D.li-ospf-ospfv3-srv6-extensions] [I-D.li-ospf-ospfv3-srv6-extensions]
Li, Z., Hu, Z., Cheng, D., Talaulikar, K., and P. Psenak, Li, Z., Hu, Z., Cheng, D., Talaulikar, K., and P. Psenak,
"OSPFv3 Extensions for SRv6", draft-li-ospf- "OSPFv3 Extensions for SRv6", draft-li-ospf-
ospfv3-srv6-extensions-03 (work in progress), March 2019. ospfv3-srv6-extensions-05 (work in progress), August 2019.
[ISO10589] [ISO10589]
International Organization for Standardization, International Organization for Standardization,
"Intermediate system to Intermediate system intra-domain "Intermediate system to Intermediate system intra-domain
routeing information exchange protocol for use in routeing information exchange protocol for use in
conjunction with the protocol for providing the conjunction with the protocol for providing the
connectionless-mode Network Service (ISO 8473)", ISO/ connectionless-mode Network Service (ISO 8473)", ISO/
IEC 10589:2002, Second Edition, Nov 2002. IEC 10589:2002, Second Edition, Nov 2002.
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
 End of changes. 11 change blocks. 
14 lines changed or deleted 14 lines changed or added

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