Supporting Bottleneck Structure Graphs in ALTO: Use Cases and Requirements
draft-giraltyellamraju-alto-bsg-requirements-03
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Jordi Ros-Giralt , Sruthi Yellamraju , Qin Wu , Luis M. Contreras , Y. Richard Yang , Kai Gao | ||
| Last updated | 2023-03-27 (Latest revision 2022-09-23) | ||
| RFC stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats | |||
| Stream | Stream state | (No stream defined) | |
| Consensus boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document proposes an extension to the base Application-Layer Traffic Optimization (ALTO) protocol to support bottleneck structures as an efficient representation of the state of a network. Bottleneck structures are efficient computational graphs that allow network operators and application service providers to optimize application performance in a variety of communication problems including routing, flow control, flow scheduling, bandwidth prediction, and network slicing, among others. This document introduces a new abstraction called Bottleneck Structure Graph (BSG) and the necessary requirements to integrate it into the ALTO standard.
Authors
Jordi Ros-Giralt
Sruthi Yellamraju
Qin Wu
Luis M. Contreras
Y. Richard Yang
Kai Gao
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)