ALTO Extension: Path Vector Cost Type
draft-ietf-alto-path-vector-06

Document Type Active Internet-Draft (alto WG)
Last updated 2019-06-18
Replaces draft-yang-alto-path-vector
Stream IETF
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)
ALTO WG                                                           K. Gao
Internet-Draft                                       Tsinghua University
Intended status: Standards Track                                  Y. Lee
Expires: December 20, 2019                                        Huawei
                                                          S. Randriamasy
                                                         Nokia Bell Labs
                                                                 Y. Yang
                                                         Yale University
                                                                J. Zhang
                                                       Tongji University
                                                           June 18, 2019

                 ALTO Extension: Path Vector Cost Type
                     draft-ietf-alto-path-vector-06

Abstract

   The Application-Layer Traffic Optimization (ALTO) protocol [RFC7285]
   has defined cost maps and endpoint cost maps to provide basic network
   information.  However, they provide only scalar (numerical or
   ordinal) cost mode values, which are insufficient to satisfy the
   demands of solving more complex network optimization problems.  This
   document introduces an extension to the base ALTO protocol, namely
   the path-vector extension, which allows ALTO clients to query
   information such as the capacity region for a given set of flows
   (called co-flows).  A non-normative example called co-flow scheduling
   is presented to illustrate the limitations of existing ALTO endpoint
   cost maps.  After that, details of the extension are defined.

Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
   document are to be interpreted as described in RFC 2119 [RFC2119].

Status of This Memo

   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

Gao, et al.             Expires December 20, 2019               [Page 1]
Internet-Draft         ALTO Extension: Path Vector             June 2019

   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 December 20, 2019.

Copyright Notice

   Copyright (c) 2019 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 Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
   2.  Terminology . . . . . . . . . . . . . . . . . . . . . . . . .   5
   3.  Use Case: Capacity Region for Co-Flow Scheduling  . . . . . .   5
   4.  Overview of Path Vector Extensions  . . . . . . . . . . . . .   7
     4.1.  New Cost Mode to Encode Path Vectors  . . . . . . . . . .   7
     4.2.  New ALTO Entity Domain for ANE Properties . . . . . . . .   8
     4.3.  Multipart/Related Resource for Consistency  . . . . . . .   8
   5.  Path-Vector Cost Type . . . . . . . . . . . . . . . . . . . .   9
     5.1.  Cost Mode: path-vector  . . . . . . . . . . . . . . . . .  10
     5.2.  Cost Metric: Link Maximum Reservable Bandwidth  . . . . .  10
   6.  ANE Domain  . . . . . . . . . . . . . . . . . . . . . . . . .  10
     6.1.  Domain Name . . . . . . . . . . . . . . . . . . . . . . .  11
     6.2.  Domain-Specific Entity Identifier . . . . . . . . . . . .  11
     6.3.  Hierarchy and Inheritance . . . . . . . . . . . . . . . .  11
   7.  Multipart Filtered Cost Map for Path Vector . . . . . . . . .  11
     7.1.  Media Type  . . . . . . . . . . . . . . . . . . . . . . .  11
     7.2.  HTTP Method . . . . . . . . . . . . . . . . . . . . . . .  11
     7.3.  Accept Input Parameters . . . . . . . . . . . . . . . . .  12
     7.4.  Capabilities  . . . . . . . . . . . . . . . . . . . . . .  12
Show full document text