ALTO Extension: Path Vector
draft-ietf-alto-path-vector-10
ALTO K. Gao
Internet-Draft Sichuan University
Intended status: Standards Track Y. Lee
Expires: 10 September 2020
S. Randriamasy
Nokia Bell Labs
Y.R. Yang
Yale University
J. Zhang
Tongji University
9 March 2020
ALTO Extension: Path Vector
draft-ietf-alto-path-vector-10
Abstract
This document is an extension to the base Application-Layer Traffic
Optimization protocol [RFC7285]. The current ALTO Cost Services
allow applications to obtain cost values on an end-to-end path
defined by its source and destination. The present extension
provides abstracted information on particular network parts or
elements traversed by a path between its source and destination.
Examples of such abstracted parts are networks, data centers or
links. This is useful for applications whose performance is impacted
by particular network parts they traverse or by their properties.
Applications having the choice among several connection paths may use
this information to select paths accordingly and improve their
performance. In particular, they may infer that several paths share
common links and prevent traffic bottlenecks by avoiding such paths.
This document introduces a new cost type called Path Vector. A Path
Vector is an array of entities that each identifies an abstracted
representation of a network part and that are called Abstract Network
Element (ANE). Each ANE is defined by a set of properties. ANE
properties are conveyed by an ALTO information resource called
"Property Map", that can be packed together with the Path Vectors in
a multipart response. They can also be obtained via a separate ALTO
request to a Property Map. An ALTO Property Map is an extension to
the ALTO protocol, that is specified in another document entitled
"Unified Properties for the ALTO Protocol"
[I-D.ietf-alto-unified-props-new].
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Gao, et al. Expires 10 September 2020 [Page 1]
Internet-Draft ALTO-PV March 2020
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 10 September 2020.
Copyright Notice
Copyright (c) 2020 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 . . . . . . . . . . . . . . . . . . . . . . . . 4
2. Use Cases . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2.1. Capacity Region for Multi-Flow Scheduling . . . . . . . . 6
2.2. Recent Use Cases . . . . . . . . . . . . . . . . . . . . 7
2.2.1. Large-scale Data Analytics . . . . . . . . . . . . . 8
2.2.2. Context-aware Data Transfer . . . . . . . . . . . . . 8
2.2.3. CDN and Service Edge . . . . . . . . . . . . . . . . 8
2.3. Terminology . . . . . . . . . . . . . . . . . . . . . . . 8
3. Overview . . . . . . . . . . . . . . . . . . . . . . . . . . 9
3.1. Abstract Network Element . . . . . . . . . . . . . . . . 10
3.1.1. ANE Name . . . . . . . . . . . . . . . . . . . . . . 10
3.1.2. ANE Properties . . . . . . . . . . . . . . . . . . . 11
3.2. Path Vector . . . . . . . . . . . . . . . . . . . . . . . 12
Show full document text