Re: [alto] RFC 9275 on An Extension for Application-Layer Traffic Optimization (ALTO): Path Vector

Congratulation to all authors and other people who contributed to this work all the way along!

-Qin (on behalf of chairs)
-----邮件原件-----
发件人: alto [mailto:alto-bounces@ietf.org] 代表 rfc-editor@rfc-editor.org
发送时间: 2022年9月24日 4:39
收件人: ietf-announce@ietf.org; rfc-dist@rfc-editor.org
抄送: rfc-editor@rfc-editor.org; drafts-update-ref@iana.org; alto@ietf.org
主题: [alto] RFC 9275 on An Extension for Application-Layer Traffic Optimization (ALTO): Path Vector

A new Request for Comments is now available in online RFC libraries.

        RFC 9275

        Title:      An Extension for Application-Layer Traffic 
                    Optimization (ALTO): Path Vector 
        Author:     K. Gao,
                    Y. Lee,
                    S. Randriamasy,
                    Y. Yang,
                    J. Zhang
        Status:     Experimental
        Stream:     IETF
        Date:       September 2022
        Mailbox:    kaigao@scu.edu.cn,
                    younglee.tx@gmail.com,
                    sabine.randriamasy@nokia-bell-labs.com,
                    yry@cs.yale.edu,
                    jingxuan.n.zhang@gmail.com
        Pages:      54
        Updates/Obsoletes/SeeAlso:   None

        I-D Tag:    draft-ietf-alto-path-vector-25.txt

        URL:        https://www.rfc-editor.org/info/rfc9275

        DOI:        10.17487/RFC9275

This document is an extension to the base Application-Layer Traffic Optimization (ALTO) protocol. It extends the ALTO cost map and ALTO property map services so that an application can decide to which
endpoint(s) to connect based not only on numerical/ordinal cost values but also on fine-grained abstract information regarding the paths. This is useful for applications whose performance is impacted by specific components of a network on the end-to-end paths, e.g., they may infer that several paths share common links and prevent traffic bottlenecks by avoiding such paths. This extension introduces a new abstraction called the "Abstract Network Element" (ANE) to represent these components and encodes a network path as a vector of ANEs. Thus, it provides a more complete but still abstract graph representation of the underlying network(s) for informed traffic optimization among endpoints.

This document is a product of the Application-Layer Traffic Optimization Working Group of the IETF.

EXPERIMENTAL: This memo defines an Experimental Protocol for the Internet community.  It does not specify an Internet standard of any kind. Discussion and suggestions for improvement are requested.
Distribution of this memo is unlimited.

This announcement is sent to the IETF-Announce and rfc-dist lists.
To subscribe or unsubscribe, see
  https://www.ietf.org/mailman/listinfo/ietf-announce
  https://mailman.rfc-editor.org/mailman/listinfo/rfc-dist

For searching the RFC series, see https://www.rfc-editor.org/search For downloading RFCs, see https://www.rfc-editor.org/retrieve/bulk

Requests for special distribution should be addressed to either the author of the RFC in question, or to rfc-editor@rfc-editor.org.  Unless specifically noted otherwise on the RFC itself, all RFCs are for unlimited distribution.

The RFC Editor Team
Association Management Solutions, LLC

_______________________________________________
alto mailing list
alto@ietf.org
https://www.ietf.org/mailman/listinfo/alto