Bottleneck Structure Graphs in Multidomain Networks: Introduction and Requirements for ALTO
draft-giraltyellamraju-alto-bsg-multidomain-00
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-04-27 (Latest revision 2022-10-24) | ||
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 the computation of bottleneck structure graphs [I-D.draft-giraltyellamraju-alto-bsg-requirements] under partial information. A primary application corresponds to the case of multi- domain networks, whereby each network domain is administered separately and lacks information about the other domains. A proposed border protocol is introduced that ensures each domain's independent convergence to the correct bottleneck substructure graph without the need to know private flow and topology information from other domains. Initial discussions are presented on the necessary requirements to integrate the proposed capability 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.)