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

        
        RFC 9351

        Title:      Border Gateway Protocol - Link 
                    State (BGP-LS) Extensions for Flexible Algorithm 
                    Advertisement 
        Author:     K. Talaulikar, Ed.,
                    P. Psenak,
                    S. Zandi,
                    G. Dawra
        Status:     Standards Track
        Stream:     IETF
        Date:       February 2023
        Mailbox:    [email protected],
                    [email protected],
                    [email protected],
                    [email protected]
        Pages:      14
        Updates/Obsoletes/SeeAlso:   None

        I-D Tag:    draft-ietf-idr-bgp-ls-flex-algo-12.txt

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

        DOI:        10.17487/RFC9351

Flexible Algorithm is a solution that allows some routing protocols
(e.g., OSPF and IS-IS) to compute paths over a network based on
user-defined (and hence, flexible) constraints and metrics. The
computation is performed by routers participating in the specific
network in a distributed manner using a Flexible Algorithm Definition
(FAD). This definition is provisioned on one or more routers and
propagated through the network by OSPF and IS-IS flooding.

Border Gateway Protocol - Link State (BGP-LS) enables the collection
of various topology information from the network. This document
defines extensions to the BGP-LS address family to advertise the FAD
as a part of the topology information from the network.

This document is a product of the Inter-Domain Routing Working Group of the 
IETF.

This is now a Proposed Standard.

STANDARDS TRACK: This document specifies an Internet Standards Track
protocol for the Internet community, and requests discussion and suggestions
for improvements.  Please refer to the current edition of the Official
Internet Protocol Standards (https://www.rfc-editor.org/standards) for the 
standardization state and status of this protocol.  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 [email protected].  Unless
specifically noted otherwise on the RFC itself, all RFCs are for
unlimited distribution.


The RFC Editor Team
Association Management Solutions, LLC


_______________________________________________
IETF-Announce mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/ietf-announce

Reply via email to