A new Request for Comments is now available in online RFC libraries.
RFC 9832
Title: BGP Classful Transport Planes
Author: K. Vairavakkalai, Ed.,
N. Venkataraman, Ed.
Status: Experimental
Stream: IETF
Date: September 2025
Mailbox: [email protected],
[email protected]
Pages: 67
Updates/Obsoletes/SeeAlso: None
I-D Tag: draft-ietf-idr-bgp-ct-39.txt
URL: https://www.rfc-editor.org/info/rfc9832
DOI: 10.17487/RFC9832
This document specifies a mechanism referred to as "Intent-Driven
Service Mapping". The mechanism uses BGP to express Intent-based
association of overlay routes with underlay routes having specific
Traffic Engineering (TE) characteristics satisfying a certain Service
Level Agreement (SLA). This is achieved by defining new constructs to
group underlay routes with sufficiently similar TE characteristics
into identifiable classes (called "Transport Classes" or "TCs"), that
overlay routes use as an ordered set to resolve reachability
(Resolution Schemes) towards service endpoints. These constructs can
be used, for example, to realize the "IETF Network Slice" defined in
the TEAS Network Slices framework (RFC 9543).
Additionally, this document specifies protocol procedures for BGP
that enable dissemination of service mapping information in a network
that may span multiple cooperating administrative domains. These
domains may be administered either by the same provider or by closely
coordinating providers. A new BGP address family that leverages the
procedures described in RFC 4364 ("BGP/MPLS IP Virtual Private
Networks (VPNs)") and follows the NLRI encoding described in RFC 8277
("Using BGP to Bind MPLS Labels to Address Prefixes") is defined to
enable each advertised underlay route to be identified by its class.
This new address family is called "BGP Classful Transport" (or "BGP
CT").
This document is a product of the Inter-Domain Routing 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 [email protected]. Unless
specifically noted otherwise on the RFC itself, all RFCs are for
unlimited distribution.
The RFC Editor Team
_______________________________________________
rfc-dist mailing list -- [email protected]
To unsubscribe send an email to [email protected]
http://www.rfc-editor.org
