Compressing ALTO Path Vectors
draft-gao-alto-routing-state-abstraction-08
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Kai Gao , xinwang2014@hotmail.com , Qiao Xiang , Chen Gu , Y. Richard Yang , Yawei Zhang | ||
| Last updated | 2018-09-02 (Latest revision 2018-03-01) | ||
| 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
The path vector extension [I-D.ietf-alto-path-vector] has extended the base ALTO protocol [RFC7285] with the ability to represent a more detailed view of the network which contains not only end-to-end costs but also information about shared bottlenecks. However, the view computed by straw man algorithms can contain redundant information and result in unnecessary communication overhead. The situation gets even worse when certain ALTO extensions are enabled, for example, the incremental update extension [I-D.ietf-alto-incr-update-sse] which continuously pushes data changes to ALTO clients. Redundant information can trigger unnecessary updates. In this document, several algorithms are described which can effectively reduce the redundancy in the network view while still providing the same information as in the original path vectors.
Authors
Kai Gao
xinwang2014@hotmail.com
Qiao Xiang
Chen Gu
Y. Richard Yang
Yawei Zhang
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)