Compressing ALTO Path Vectors
draft-gao-alto-routing-state-abstraction-08

Document Type Expired Internet-Draft (individual)
Last updated 2018-09-02 (latest revision 2018-03-01)
Stream (None)
Intended RFC status (None)
Formats
Expired & archived
pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
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-gao-alto-routing-state-abstraction-08.txt

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 (gaok12@mails.tsinghua.edu.cn)
xinwang2014@hotmail.com (xinwang2014@hotmail.com)
Qiao Xiang (qiao.xiang@cs.yale.edu)
Chen Gu (gc19931011jy@gmail.com)
Y. Yang (yry@cs.yale.edu)
G.Robert Chen (chenguohai@huawei.com)

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