Internet-Draft | ALTO Cost Mode | April 2022 |
Boucadair & Wu | Expires 18 October 2022 | [Page] |
This document creates a new IANA registry for tracking cost modes supported by the Application-Layer Traffic Optimization (ALTO) protocol. Also, this document relaxes a constraint that was imposed by the ALTO specification on allowed cost mode values.¶
This document updates RFC 7285.¶
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 18 October 2022.¶
Copyright (c) 2022 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.¶
The cost mode attribute indicates how costs should be interpreted when communicated in the Application-Layer Traffic Optimization (ALTO) protocol [RFC7285]. The base ALTO specification includes a provision for only two modes:¶
Additional cost modes are required for specific ALTO deployment cases (e.g., [I-D.ietf-alto-path-vector]). In order to allow for such use cases, this document relaxes the constraint imposed by the base ALTO specification on allowed cost modes (Section 3) and creates a new ALTO registry to track new cost modes (Section 4).¶
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.¶
This document updates Section 6.1.2 of [RFC7285] as follows:¶
OLD: The cost mode attribute indicates how costs should be interpreted. Specifically, the cost mode attribute indicates whether returned costs should be interpreted as numerical values or ordinal rankings. It is important to communicate such information to ALTO clients, as certain operations may not be valid on certain costs returned by an ALTO server. For example, it is possible for an ALTO server to return a set of IP addresses with costs indicating a ranking of the IP addresses. Arithmetic operations that would make sense for numerical values, do not make sense for ordinal rankings. ALTO clients may handle such costs differently. Cost modes are indicated in protocol messages as strings. NEW:¶
The cost mode attribute indicates how costs should be interpreted. This document defines two cost modes (numerical values and ordinal rankings), but additional cost modes can be defined in the future.¶
It is important to communicate such information to ALTO clients, as certain operations may not be valid on certain costs returned by an ALTO server. For example, it is possible for an ALTO server to return a set of IP addresses with costs indicating a ranking of the IP addresses. Arithmetic operations that would make sense for numerical values, do not make sense for ordinal rankings. ALTO clients may handle such costs differently.¶
Cost modes are indicated in protocol messages as strings.¶
Future documents that define a new cost mode SHOULD indicate whether that new cost mode applies to all or a subset of cost metrics. If not explicitly indicated, the new cost mode applies to all cost metrics.¶
This document updates Section 10.5 of [RFC7285] as follows:¶
OLD: A cost mode is encoded as a string. The string MUST have a value of either "numerical" or "ordinal". NEW:¶
A cost mode is encoded as a string. The string MUST be no more than 32 characters, and it MUST NOT contain characters other than US-ASCII alphanumeric characters (U+0030-U+0039, U+0041 -U+005A, and U+0061-U+007A), the hyphen-minus ('-', U+002D), the colon (':', U+003A), or the low line ('_', +005F). Cost modes reserved for Private Use are prefixed with "priv:" (Section 4). Otherwise, the cost mode MUST have a value that is listed in the registry created in Section 4 of RFCXXXX.¶
This document requests IANA to create a new subregistry entitled "ALTO Cost Modes" under the "Application-Layer Traffic Optimization (ALTO) Protocol" registry available at [ALTO].¶
The registry is initially populated with the following values:¶
+===========-+=============================+====================+ | Identifier | Description | Intended Semantics | +============+=============================+====================+ | numerical | Indicates that numerical | Section 6.1.2.1 | | | operations can be performed | of RFC7285 | | | on the returned costs | | +------------+-----------------------------+--------------------+ | ordinal | Indicates that the cost | Section 6.1.2.2 | | | values in a cost map | of RFC7285 | | | represent ranking | | +------------+-----------------------------+--------------------+¶
The assignment policy for this registry is "IETF Review" (Section 4.8 of [RFC8126]).¶
Cost modes prefixed with "priv:" are reserved for Private Use (Section 4.1 of [RFC8126]).¶
This document does not introduce new concerns other than those already discussed in Section 15 of [RFC7285].¶
Many thanks to Benjamin Kaduk for spotting the issue during the review of [I-D.ietf-alto-path-vector].¶
Thanks to Adrian Farrel, Dhruv Dhody, Luis Miguel Contreras Murillo, Sabine Randriamasy, and Qiao Xiang for the review and comments.¶
Special thanks to Kai Gao for Shepherding the document.¶