%% You should probably cite draft-gao-alto-routing-state-abstraction-08 instead of this revision.
@techreport{gao-alto-routing-state-abstraction-05,
    number =    {draft-gao-alto-routing-state-abstraction-05},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-gao-alto-routing-state-abstraction/05/},
    author =    {Kai Gao and xinwang2014@hotmail.com and Chen Gu and Y. Richard Yang and Yawei Zhang},
    title =     {{A Recommendation for Compressing ALTO Path Vectors}},
    pagetotal = 23,
    year =      2017,
    month =     jul,
    day =       3,
    abstract =  {The path vector extension {[}I-D.ietf-alto-path-vector{]} has extended the original ALTO protocol {[}RFC7285{]} with the ability to represent a more detailed view of the network, containing not only end-to-end metrics 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, an algorithm is described which can effectively reduce the redundancy in the network view while still providing the same information as in the original path vectors. The algorithm is fully compatible with the path vector extension and has several by- products which can be leveraged by other extensions to achieve better performance.},
}