| Internet-Draft | IGP Reverse Metric Algorithm | July 2024 |
| Psenak, et al. | Expires 3 January 2025 | [Page] |
IANA has set up a subregistry called "IGP Algorithm Type" under the "Interior Gateway Protocol (IGP) Parameters" registry. This draft introduces a new algorithm type which utilizes the cost in the reverse direction on each link.¶
This document also discusses using this new algorithm type in combination with IGP Flexible Algorithm to compute constraint-based paths.¶
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶
This Internet-Draft will expire on 3 January 2025.¶
Copyright (c) 2024 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.¶
Existing IGP Algorithm types as defined in the IANA IGP Algorithm Types registry created by [RFC8665] utilize metrics in the forward direction on each link. But there are use cases (discussed later in this document) where utilizing the metric in the reverse direction on each link is desirable.¶
This document defines a new IGP Algorithm type which uses link metrics in the reverse direction.¶
An IGP Flexible Algorithm as specified in [RFC9350] computes a constraint-based path. It supports various metric types, including native Interior Gateway Protocol (IGP) metric, Min Unidirectional Link Delay, Traffic Engineering Default Metric, all defined in [RFC9350]. In addition, Bandwidth Metric and User defined metrics are defined in [I-D.ietf-lsr-flex-algo-bw-con].¶
Existing IGP Flexible Algorithm use cases specify an IGP Algorithm Type where all these link metric types are used by Flexible Algorithm in the forward direction, e.g., the direction in which the link is added to the topology during the computation.¶
This document extends IGP Flexible Algorithm to be able to use the IGP Algorithm Type which specifies using the link metric in a reverse direction.¶
Usage of the Reverse Shortest Path First (RSPF) algorithm outside of the IGP Flexible Algorithm is outside of the scope of this draft.¶
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 [RFC2119] [RFC8174] when, and only when, they appear in all capitals, as shown here.¶
A multicast tree is typically established from the receivers (R) towards the multicast source (S). When determining the path for traffic originating from S towards R, a shortest path from R to S is often used. When the metric on all links is symmetric, e.g. equal in both directions, this provides the correct outcome.¶
With the introduction of IGP Flexible Algorithms, additional metrics become available for calculating the shortest path. One commonly employed metric is latency, which often exhibits asymmetry. Multicast traffic is frequently required to take the path with the minimal latency. In the presence of the asymmetric link latency, the usage of the reverse link latency is required for multicast tree calculation. Failure to use the reverse link latency can result in multicast traffic not taking the least latency path across the network.¶
Flexible Algorithm Definition Sub-TLV [RFC9350] defines the Calc-Type field, that carries the calculation-type used by the Flexible Algorithm. Values are defined in IANA "IGP Algorithm Types" registry defined under the "Interior Gateway Protocol (IGP) Parameters" registry.¶
We define a new IGP Algorithm Type - Reverse Shortest Path First (SPF) algorithm based on link metric. It is equivalent to the IGP Algorithm Type 0, but the link metric is taken from the reverse direction of the link.¶
If the winning Flexible Algorithm Definition signals the Reverse SPF algorithm calculation-type, defines the metric-type other than IGP metric and such metric is not advertised for the link in the reverse direction in a topology for which the computation is done, such link MUST be pruned from the computation. A metric of value 0 MUST NOT be assumed in such a case. This is the application of the rule (5), as specified in section 13 of [RFC9350], in a reverse direction.¶
This document defines a new algorithm type in the IANA "IGP Algorithm Types" registry defined under the "Interior Gateway Protocol (IGP) Parameters" registry. The "value" is suggested - to be assigned by IANA.¶
Value Description
----- ------------------------------
2 Shortest Path First (SPF) algorithm based on reverse link metric. It's
equivalent to standard (SPF) algorithm (IGP Algorithm Type 0), but uses
the metric from the reverse direction of the link.
¶
This document inherits security considerations from the [RFC9350]¶