CARVIEW |
Search RFCs
RFC 9832
BGP Classful Transport Planes, September 2025
- File formats:
- Also available: XML file for editing
- Status:
- EXPERIMENTAL
- Authors:
- K. Vairavakkalai, Ed.
N. Venkataraman, Ed. - Stream:
- IETF
- Source:
- idr (rtg)
Cite this RFC: TXT | XML | BibTeX
DOI: https://doi.org/10.17487/RFC9832
Discuss this RFC: Send questions or comments to the mailing list idr@ietf.org
Other actions: View Errata | Submit Errata | Find IPR Disclosures from the IETF | View History of RFC 9832
Abstract
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").
For the definition of Status, see RFC 2026.
For the definition of Stream, see RFC 8729.
IAB • IANA • IETF • IRTF • ISE • ISOC • IETF Trust
Reports • Privacy Statement • Site Map • Contact Us