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

Document Type Expired Internet-Draft (alto WG)
Last updated 2019-01-03 (latest revision 2018-07-02)
Replaces draft-yang-alto-path-vector
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-ietf-alto-path-vector-04.txt

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 capacity regions for a given set of flows. A non-normative example called multi-flow scheduling is presented to illustrate the limitations of existing ALTO endpoint cost maps. After that, details of the extension are defined.

Authors

Greg Bernstein (gregb@grotto-networking.com)
Shiwei Chen (dawn_chen_f@hotmail.com)
Kai Gao (gaok12@mails.tsinghua.edu.cn)
Young Lee (leeyoung@huawei.com)
Wendy Roome (wendy@wdroome.com)
Michael Scharf (michael.scharf@nokia.com)
Yang Yang (yry@cs.yale.edu)
J. Zhang (jingxuan.n.zhang@gmail.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)