ALTO Extension: Path Vector Cost Type
draft-ietf-alto-path-vector-04
| Document | Type | Expired Internet-Draft (alto WG) | |
|---|---|---|---|
| Authors | Greg M. Bernstein , Shiwei Dawn Chen , Kai Gao , Young Lee , Wendy Roome , Michael Scharf , Y. Richard Yang , Jingxuan Zhang | ||
| Last updated | 2019-01-03 (Latest revision 2018-07-02) | ||
| Replaces | draft-yang-alto-path-vector | ||
| Stream | Internet Engineering Task Force (IETF) | ||
| Formats |
Expired & archived
plain text
htmlized
pdfized
bibtex
|
||
| Reviews |
SECDIR Telechat review
(of
-22)
Not Ready
OPSDIR Last Call review
(of
-17)
Not Ready
GENART Last Call review
(of
-17)
Ready with Nits
ARTART Last Call review
(of
-16)
Ready with Issues
|
||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
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 M. Bernstein
Shiwei Dawn Chen
Kai Gao
Young Lee
Wendy Roome
Michael Scharf
Y. Richard Yang
Jingxuan Zhang
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)