Cisco Systems

United States of America dhrao@cisco.com

Cisco Systems

United States of America swaagraw@cisco.com

RTG idr intent-aware routing intent-based routing color-aware VPNs color-aware BGP transport BGP extensible NLRI This document describes a BGP-based routing solution to establish end-to-end intent-aware paths across a multi-domain transport network. The transport network can span multiple service provider and customer network domains. The BGP intent-aware paths can be used to steer traffic flows for service routes that need a specific intent. This solution is called BGP Color-Aware Routing (BGP CAR). This document describes the routing framework and BGP extensions to enable intent-aware routing using the BGP CAR solution. The solution defines two new BGP SAFIs (BGP CAR SAFI and BGP VPN CAR SAFI) for IPv4 and IPv6. It also defines an extensible Network Layer Reachability Information (NLRI) model for both SAFIs that allows multiple NLRI types to be defined for different use cases. Each type of NLRI contains key and TLV-based non-key fields for efficient encoding of different per-prefix information. This specification defines two NLRI types: Color-Aware Route NLRI and IP Prefix NLRI. It defines non-key TLV types for the MPLS label stack, SR-MPLS label index, and Segment Routing over IPv6 (SRv6) Segment Identifiers (SIDs). This solution also defines a new Local Color Mapping (LCM) Extended Community.

Status of This Memo This document is not an Internet Standards Track specification; it is published for examination, experimental implementation, and evaluation. This document defines an Experimental Protocol for the Internet community. This document is a product of the Internet Engineering Task Force (IETF). It represents the consensus of the IETF community. It has received public review and has been approved for publication by the Internet Engineering Steering Group (IESG). Not all documents approved by the IESG are candidates for any level of Internet Standard; see Section 2 of RFC 7841. Information about the current status of this document, any errata, and how to provide feedback on it may be obtained at .

Copyright Notice Copyright (c) 2025 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents () in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.

Table of Contents

• .  Introduction
  • .  Terminology
  • .  Illustration
  • .  Requirements Language
• .  BGP CAR SAFI
  • .  Data Model
  • .  Extensible Encoding
  • .  BGP CAR Route Origination
  • .  BGP CAR Route Validation
  • .  BGP CAR Route Resolution
  • .  AIGP Metric Computation
  • .  Inherent Multipath Capability
  • .  BGP CAR Signaling Through Different Color Domains
  • .  Format and Encoding
    • .  BGP CAR SAFI NLRI Format
    • .  Type-Specific Non-Key TLV Format
    • .  Color-Aware Route (E, C) NLRI Type
    • .  IP Prefix (E) NLRI Type
    • .  Local Color Mapping (LCM) Extended Community
  • . LCM-EC and BGP Color-EC Usage
  • . Error Handling
• .  Service Route Automated Steering on Color-Aware Paths
• .  Filtering
• .  Scaling
  • .  Ultra-Scale Reference Topology
  • .  Deployment Model
    • .  Flat
    • .  Hierarchical Design with Next-Hop-Self at Ingress Domain BR
    • .  Hierarchical Design with Next-Hop-Unchanged at Ingress Domain BR
  • .  Scale Analysis
  • .  Anycast SID
    • .  Anycast SID for Transit Inter-Domain Nodes
    • .  Anycast SID for Transport Color Endpoints
• .  Routing Convergence
• .  CAR SRv6
  • .  Overview
    • .  Routed Service SID
    • .  Non-Routed Service SID
  • .  Deployment Options for CAR SRv6 Locator Reachability Distribution and Forwarding
    • .  Hop-by-Hop IPv6 Forwarding for BGP SRv6 Prefixes
    • .  Encapsulation Between BRs for BGP SRv6 Prefixes
  • .  Operational Benefits of Using CAR SAFI for SRv6 Locator Prefix Distribution
• .  CAR IP Prefix Route
• .  VPN CAR
  • .  Format and Encoding
    • .  VPN CAR (E, C) NLRI Type
    • .  VPN CAR IP Prefix NLRI Type
• . IANA Considerations
  • .  BGP CAR SAFIs
  • .  "BGP CAR NLRI Types" Registry
  • .  "BGP CAR NLRI TLV" Registry
  • .  Guidance for Designated Experts
    • .  Additional Evaluation Criteria for the "BGP CAR NLRI Types" Registry
    • .  Additional Evaluation Criteria for the "BGP CAR NLRI TLV" Registry
  • .  "Border Gateway Protocol (BGP) Extended Communities" Registry
• . Manageability and Operational Considerations
• . Security Considerations
• . References
  • .  Normative References
  • .  Informative References
• .  Illustrations of Service Steering
  • .  E2E BGP Transport CAR Intent Realized Using IGP Flexible Algorithm
  • .  E2E BGP Transport CAR Intent Realized Using SR Policy
  • .  BGP Transport CAR Intent Realized in a Section of the Network
    • .  Provide Intent for Service Flows Only in Core Domain Running IS-IS Flexible Algorithm
    • .  Provide Intent for Service Flows Only in Core Domain over TE Tunnel Mesh
  • .  Transit Network Domains That Do Not Support CAR
  • .  Resource Avoidance Using BGP CAR and IGP Flexible Algorithm
  • .  Per-Flow Steering over CAR Routes
  • .  Advertising BGP CAR Routes for Shared IP Addresses
• .  Color Mapping Illustrations
  • .  Single Color Domain Containing Network Domains with N:N Color Distribution
  • .  Single Color Domain Containing Network Domains with N:M Color Distribution
  • .  Multiple Color Domains
• .  CAR SRv6 Illustrations
  • .  BGP CAR SRv6 Locator Reachability Hop-by-Hop Distribution
  • .  BGP CAR SRv6 Locator Reachability Distribution with Encapsulation
  • .  BGP CAR (E, C) Route Distribution for Steering Non-Routed Service SID
• .  CAR SAFI NLRI Update Packing Efficiency Calculation
• Acknowledgements
• Contributors
• Authors' Addresses

Introduction BGP Color-Aware Routing (CAR) is a BGP-based routing solution to establish end-to-end intent-aware paths across a multi-domain service provider transport network. BGP CAR distributes distinct routes to a destination network endpoint, such as a Provider Edge (PE) router, for different intents or colors. Color is a non-zero 32-bit integer value associated with a network intent (such as low cost, low delay, avoid some resources, 5G network slice, etc.) as defined in . BGP CAR fulfills the transport and VPN problem statement and the requirements described in . For this purpose, this document specifies two new BGP SAFIs, called BGP CAR SAFI (83) and VPN CAR SAFI (84), that carry infrastructure routes to set up the transport paths. Both CAR SAFI and VPN CAR SAFI apply to IPv4 Unicast and IPv6 Unicast AFIs (AFI 1 and AFI 2). The use of these SAFIs with other AFIs are outside the scope of this document. BGP CAR SAFI can be enabled on transport devices in a provider network (underlay) to set up color-aware transport/infrastructure paths across provider networks. The multi-domain transport network may comprise of multiple BGP Autonomous Systems (ASes) as well as multiple IGP domains within a single BGP AS. BGP CAR SAFI can also be enabled within a VPN Routing and Forwarding (VRF) on a PE router towards a peering Customer Edge (CE) router, and on devices within a customer network. VPN CAR SAFI is used for the distribution of intent-aware routes from different customers received on a PE router across the provider networks, maintaining the separation of the customer address spaces that may overlap. The BGP CAR solution thus enables intent-aware transport paths to be set up across a multi-domain network that can span customer and provider network domains. This document also defines two BGP CAR route types for this purpose. The BGP CAR Type-1 NLRI (E, C) enables the generation and distribution of multiple color-aware routes to the same destination IP prefix for different colors. This case arises from situations where a transport node such as a PE has a common IP address (such as a loopback) to advertise for multiple intents. The operator intends to use the common IP address as both the BGP next hop for service routes and as the transport endpoint for the data plane path. Multiple routes are needed for this same address or prefix to set up a unique path for each intent. One example is setting up multiple Label Switched Paths (LSPs) for MPLS or Segment Routing over MPLS (SR-MPLS) to an egress PE, one per intent. The BGP CAR Type-2 NLRI (IP Prefix or E) enables the distribution of multiple color-aware routes to a transport node for the case where the operator specifies a unique network IP address block for a given intent, and the transport node gets assigned a unique IP prefix or address for each intent. An example use case is Segment Routing over IPv6 (SRv6) per-intent locators. These BGP CAR intent-aware paths are then used by an ingress node (such as a PE) to steer traffic flows for service routes that need the specific intents. Steering may be towards a destination for all or specific traffic flows. BGP CAR adheres to the flat routing model of BGP for IP routing (BGP-IP) or BGP Labeled Unicast (BGP-LU) (SAFI 4 in ), and extends it to support intent awareness, thereby providing a consistent operational experience with those widely deployed transport routing technologies.

Terminology

Intent (in routing):

Any behaviors to influence routing or path selection, including any combination of the following behaviors:

1. Topology path selection (e.g., minimize metric or avoid resource)
2. Network Function Virtualization (NFV) service insertion (e.g., service chain steering)
3. Per-hop behavior (e.g., a 5G slice)

This is a more specific concept with respect to routing beyond best-effort, compared to intent as a declarative abstraction in .

Color:

A non-zero 32-bit integer value associated with an intent (e.g., low cost, low delay, or avoid some resources) as defined in . Color assignment is managed by the operator.

Colored service route:

An egress PE (e.g., E2) colors its BGP service (e.g., VPN) route (e.g., V/v) to indicate the intent that it requests for the traffic bound to V/v. The color is encoded as a BGP Color Extended Community , used as per , or represented by the locator part of SRv6 Service SID .

Color-aware path to (E2, C):

A path to forward packets towards E2 that satisfies the intent associated with color C. Several technologies may provide a color-aware path to (E2, C), such as SR Policy , IGP Flexible Algorithm , and BGP CAR (as specified in this document).

Color-aware route (E2, C):

A distributed or signaled route that builds a color-aware path to E2 for color C.

Service route automated steering on color-aware path:

An ingress PE (or ASBR) E1 automatically steers traffic for a C-colored service route V/v from E2 onto an (E2, C) color-aware path. If several such paths exist, a preference scheme is used to select the best path (for example, IGP Flexible Algorithm is preferred over SR Policy, and SR Policy is preferred over BGP CAR).

Color domain:

A set of nodes that share the same color-to-intent mapping, typically under single administration. This set can be organized into one or multiple network domains (IGP areas/instances within a single BGP AS, or multiple BGP ASes). Color-to-intent mapping on nodes is set by configuration. Color re-mapping and filtering may happen at color domain boundaries. Refer to .

Resolution of a BGP CAR route (E, C):

An inter-domain BGP CAR route (E, C) via N is resolved on an intra-domain color-aware path (N, C) where N is the next hop of the BGP CAR route.

Resolution versus steering:

Consistent with the terminology used in the SR Policy document (), in this document (service route) steering is used to describe the mapping of the traffic for a service route onto a BGP CAR path. In contrast, the term resolution is preserved for the mapping of an inter-domain BGP CAR route on an intra-domain color-aware path.

Service steering:

Service route maps traffic to a BGP CAR path (or other color-aware path, e.g., SR Policy). If a color-aware path is not available, local policy may map to a color-unaware routing/TE path (e.g., BGP-LU, RSVP-TE, IGP/LDP). The service steering concept is agnostic to the transport technology used. describes the specific service steering mechanisms leveraged for MPLS, SR-MPLS, and SRv6.

Intra-domain resolution:

BGP CAR route maps to an intra-domain color-aware path (e.g., SR Policy, IGP Flexible Algorithm, BGP CAR) or a color-unaware routing/TE path (e.g., RSVP-TE, IGP/LDP, BGP-LU).

Transport network:

A network that comprises of multiple cooperating domains managed by one or more operators, and uses routing technologies such as IP, MPLS, and SR to forward packets for connectivity and other services. In an SR deployment, the transport network is within a trusted domain as per .

Transport layer:

Refers to an underlay network layer (e.g., MPLS LSPs between PEs) that gets used by an overlay or service layer (e.g., MPLS VPNs).

Transport RR:

A BGP Route Reflector (RR) used to distribute transport/underlay routes within a domain or across domains.

Service RR:

A BGP Route Reflector (RR) used to distribute service/overlay routes within a domain or across domains.

Abbreviations:

ABR:

Area Border Router

AFI:

Address Family Identifier

AIGP:

Accumulated IGP Metric Attribute

ASBR:

Autonomous System Border Router

BGP-LU:

BGP Labeled Unicast SAFI (SAFI value 4 as per )

BGP-IP:

BGP IPv4/IPv6 Unicast SAFI (SAFI value 1 as per and )

BR:

Border Router (either for an IGP area (an ABR) or a BGP autonomous system (an ASBR))

Color-EC:

BGP Color Extended Community

E:

Generic representation of a transport endpoint such as a PE, ABR, or ASBR

LCM-EC:

BGP Local Color Mapping Extended Community

NLRI:

Network Layer Reachability Information

P node:

An intra-domain transport router

RD:

Route Distinguisher

RR:

Route Reflector

T-RR:

Transport Route Reflector

S-RR:

Service Route Reflector

SAFI:

Subsequent Address Family Identifier

TEA:

Tunnel Encapsulation Attribute

V/v, W/w:

Generic representations of a service route (indicating prefix/mask length), regardless of AFI/SAFI or actual NLRI encoding

Illustration Here is a brief illustration of the salient properties of the BGP CAR solution.

BGP CAR Solution Illustration +-------------+ +-------------+ +-------------+ | | | | | | V/v with C1 |----+ |------| |------| +----|/ | E1 | | | | | | E2 |\ |----+ | | | | +----| W/w with C2 | |------| |------| | | Domain 1 | | Domain 2 | | Domain 3 | +-------------+ +-------------+ +-------------+

All the nodes are part of an inter-domain network under a single authority and with a consistent color-to-intent mapping:

• C1 is mapped to "low delay"
  • Flex-Algo 1 is mapped to "low delay", and hence to C1
• C2 is mapped to "low delay and avoid resource R"
  • Flex-Algo 2 is mapped to "low delay and avoid resource R", and hence to C2

E1 receives two service routes from E2:

• V/v with BGP Color-EC C1
• W/w with BGP Color-EC C2

E1 has the following color-aware paths:

• (E2, C1) provided by BGP CAR with the following per-domain support:
  • Domain 1: over IGP FA1
  • Domain 2: over SR Policy bound to color C1
  • Domain 3: over IGP FA1
• (E2, C2) provided by SR Policy

E1 automatically steers traffic for the received service routes as follows:

• V/v via (E2, C1) provided by BGP CAR
• W/w via (E2, C2) provided by SR Policy

Illustrated properties:

• Leverage of the BGP Color-EC
  • The service routes are colored with widely used BGP Color Extended Community to request intent
• (E, C) automated steering
  • V/v and W/w are automatically steered on the appropriate color-aware path
• Seamless coexistence of BGP CAR and SR Policy
  • V/v is steered on a color-aware path provided by BGP CAR
  • W/w is steered on a color-aware path provided by SR Policy
• Seamless interworking of BGP CAR and SR Policy
  • V/v is steered on a BGP CAR path that is itself resolved within domain 2 onto an SR Policy bound to the color of V/v

Other properties:

• MPLS data plane: with 300k PEs and 5 colors, the BGP CAR solution ensures that no single node needs to support a data plane scaling in the order of Remote PE * C (). This would otherwise exceed the MPLS data plane.
• Control plane: a node should not install a (E, C) path if it's not participating in that color-aware path.
• Incongruent color-intent mapping: the solution supports the signaling of a BGP CAR route across different color domains ().

The key benefits of this model are:

• Leverage of the BGP Color-EC to color service routes
• The definition of the automated service steering: a C-colored service route V/v from E2 is steered onto a color-aware path (E2, C)
• The definition of the data model of a BGP CAR path: (E, C)
  • Natural extension of BGP-IP/BGP-LU data model (E)
  • Consistent with SR Policy data model
• The definition of the recursive resolution of a BGP CAR route: a BGP CAR (E2, C) route via N is resolved onto the color-aware path (N, C), which may itself be provided by BGP CAR or via another color-aware routing solution (e.g., SR Policy, IGP Flexible Algorithm)
• Explicit definitions for multiple transport encapsulations (e.g., MPLS, SR, SRv6, IP)

Requirements Language The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here.

BGP CAR SAFI

Data Model The BGP CAR data model is:

NLRI key:

Falls into two categories to accommodate the use cases described in the introduction:

Type-1:

Key is IP Prefix and Color (E, C). Color in NLRI key distinguishes a color-aware route for a common IP prefix, one per intent. Color also indicates the intent associated with the route.

Type-2:

Key is IP Prefix (E). The unique IP prefix assigned for an intent (i.e, IP Prefix == intent) distinguishes the color-aware route. Color is not needed in NLRI key as a distinguisher.

NLRI non-key encapsulation data:

Data such as MPLS label stack, SR-MPLS label index, and SRv6 SID list associated with NLRI. Contained in TLVs as described in .

BGP next hop:

Next hop address associated with a particular NLRI key .

AIGP metric :

Accumulates a metric value specific to color/intent for a CAR route across multiple BGP hops.

Local Color Mapping Extended Community (LCM-EC):

Optional non-zero 32-bit color value used to represent the intent associated with a CAR route:

• when the CAR route propagates between different color domains.
• when the CAR route has a unique IP prefix for an intent.

BGP Color Extended Community (Color-EC) :

Optional non-zero 32-bit color value used to represent the intent associated with the BGP CAR next hop. It is used as per for automated route resolution, when intent/color used for the next hop is different than the CAR route's intent/color.

The sections below describe the data model in detail. The sections that describe the protocol processing for CAR SAFI generally apply consistently to both route types (for instance, any operation based on color). The examples use (E, C) for simplicity.

Extensible Encoding Extensible encoding is provided by:

NLRI Type field:

This provides extensibility to add new NLRI formats for new route types. NLRI (route) types other than Type-1 (E, C) and Type-2 (E) are outside the scope of this document.

Key Length field:

This specifies the key length. It allows new NLRI types to be handled opaquely, which permits transitivity of new route types through BGP speakers such as Route Reflectors (RRs).

TLV-based encoding of non-key part of NLRI:

This allows the inclusion of additional non-key fields for a prefix to support different types of transport simultaneously with efficient BGP update packing ().

AIGP attribute:

This provides extensibility via TLVs, enabling definition of additional metric semantics for a color as needed for an intent.

BGP CAR Route Origination A BGP CAR route may be originated locally (e.g., loopback) or through redistribution of an (E, C) color-aware path provided by another routing solution (e.g., SR Policy, IGP Flexible Algorithm, RSVP-TE, BGP-LU ).

BGP CAR Route Validation A BGP CAR path (E, C) via next hop N with encapsulation T is valid if color-aware path (N, C) exists with encapsulation T available in data plane. A local policy may customize the validation process:

• The color constraint in the first check may be relaxed. If N is reachable via alternate color(s) or in the default routing table, the route may be considered valid.
• The data plane availability constraint of T may be relaxed to use an alternate encapsulation.
• A performance-measurement verification may be added to ensure that the intent associated with C is met (e.g., delay < bound).

A path that is not valid MUST NOT be considered for BGP best path selection.

BGP CAR Route Resolution A BGP color-aware route (E2, C1) with next hop N is automatically resolved over a color-aware route (N, C1) by default. The color-aware route (N, C1) is provided by color-aware mechanisms such as IGP Flexible Algorithm , SR Policy (), or recursively by BGP CAR. When multiple producers of (N, C1) are available, the default preference is: IGP Flexible Algorithm, SR Policy, BGP CAR. Local policy SHOULD provide additional control:

• A BGP color-aware route (E2, C1) with next hop N may be resolved over a color-aware route (N, C2) (i.e., the local policy maps the resolution of C1 over a different color C2). Examples where such a resolution can occur are:
  • In a domain where resource R is known to not be present, the inter-domain intent C1="low delay and avoid R" may be resolved over an intra-domain path of intent C2="low delay".
  • In a domain where if no (N, C1) path is available, resolution may fallback to a C2 path if the user has permitted it.
• Route resolution may be driven by an egress node. In an SRv6 domain, an egress node selects and advertises an SRv6 SID from its locator for intent C1, with a BGP CAR route. In such a case, the ingress node resolves the received SRv6 SID over an IPv6 route for the intent-aware locator of the egress node for C1 or a summary route that covers the locator. This summary route may be provided by SRv6 Flexible Algorithm or BGP CAR IP Prefix route itself (e.g., ).
• Local policy may map the CAR route to mechanisms that are unaware of color or that provide best-effort, such as RSVP-TE, IGP/LDP, BGP-LU/BGP-IP (e.g., ) for brownfield scenarios.

Route resolution via a different color C2 can be automated by attaching BGP Color-EC C2 to CAR route (E2, C1), leveraging automated steering as described in Section of "Segment Routing Policy Architecture" for BGP CAR routes. This mechanism is illustrated in . This mechanism SHOULD be supported. For CAR route resolution, if Color-EC color is present with the route, it takes precedence over the route's intent color. The route's intent color is the LCM-EC color if present (see ), or else it is the NLRI color. Local policy takes precedence over the color-based automated resolution specified above. The color-aware route (N, C1) may be provided by BGP CAR itself in a hierarchical transport routing design. In such cases, based on the procedures described above, recursive resolution may occur over the same or different CAR route type. describes a scenario where CAR (E, C) route resolves over CAR IP Prefix route. CAR IP Prefix route is allowed to be without color for best-effort. In this case, resolution is based on BGP next hop N, or when present, a best-effort SRv6 SID advertised by node N. A BGP CAR route may recursively resolve over a BGP route that carries a TEA and follows for validation. In this case, the procedures of apply to BGP CAR routes, using color precedence as specified above for resolution. The procedures of , also apply to BGP CAR routes (AFI/SAFI = 1/83 or 2/83). For instance, a BGP CAR BR may advertise a BGP CAR route to an ingress BR or PE with a specific BGP next hop per color, with a TEA or Tunnel Encapsulation EC, as per . BGP CAR resolution in one network domain is independent of resolution in another domain.

AIGP Metric Computation The Accumulated IGP (AIGP) Metric Attribute is updated as the BGP CAR route propagates across the network. The value that is set (or appropriately incremented) in the AIGP TLV corresponds to the metric associated with the underlying intent of the color. For example, when the color is associated with a low latency path, the metric value is set based on the delay metric. Information regarding the metric type used by the underlying intra-domain mechanism can also be used to set the metric value. If BGP CAR routes traverse across a discontinuity in the transport path for a given intent, a penalty is added in the AIGP metric (value set by user policy). This could occur, for instance, when color C1 path is not available, and route resolves via color C2 path (see for an example). AIGP metric computation is recursive. To avoid continuous IGP metric changes causing end-to-end BGP CAR route churn, an implementation should provide thresholds to trigger AIGP updates. Additional AIGP extensions may be defined to signal state for specific use cases such as Maximum SID Depth (MSD) along the BGP CAR route advertisement and minimum MTU along the BGP CAR route advertisement. This is out of scope for this document.

Inherent Multipath Capability The (E, C) route definition inherently provides availability of redundant paths at every BGP hop identical to BGP-LU or BGP-IP. For instance, BGP CAR routes originated by two or more egress ABRs in a domain are advertised as multiple paths to ingress ABRs in the domain, where they become equal-cost or primary-backup paths. A failure of an egress ABR is detected and handled by ingress ABRs locally within the domain for faster convergence, without any necessity to propagate the event to upstream nodes for traffic restoration. BGP ADD-PATH SHOULD be enabled for BGP CAR to signal multiple next hops through a transport RR (T-RR).

BGP CAR Signaling Through Different Color Domains [Color Domain 1 A]-----[B Color Domain 2 E2] [C1=low delay ] [C2=low delay ] Let us assume a BGP CAR route (E2, C2) is signaled from B to A, two BRs of Domain 2 and Domain 1, respectively. Let us assume that these two domains do not share the same color-to-intent mapping (i.e., they belong to different color domains). Low delay in Domain 2 is color C2, while it is C1 in Domain 1 (C1 <> C2). It is not expected to be a typical scenario to have an underlay transport path (e.g., an MPLS LSP) extend across different color domains. However, the BGP CAR solution seamlessly supports this rare scenario while maintaining the separation and independence of the administrative authority in different color domains. The solution works as described below:

• Within Domain 2, the BGP CAR route is (E2, C2) via E2.
• B signals to A the BGP CAR route as (E2, C2) via B with Local Color Mapping Extended Community (LCM-EC) of color C2.
• A is aware of the intent-to-color mapping within Domain 2 ("low delay" in Domain 2 is C2), as per typical coordination that exists between operators of peering domains.
• A maps C2 in LCM-EC to C1 and signals within Domain 1 the received BGP CAR route as (E2, C2) via A with LCM-EC (C1).
• The nodes within the receiving Domain 1 use the local color encoded in the LCM-EC for next-hop resolution and service steering.

The following procedures apply at a color domain boundary for BGP CAR routes, performed by route policy at the sending and receiving peer:

• Use local policy to control which routes are advertised to or accepted from a peer in a different color domain.
• Attach LCM-EC if not present with the route. If LCM-EC is present, then update the value to re-map the color as needed.
  • This function may be done by the advertising BGP speaker or the receiving BGP speaker as determined by the operator peering agreement, and indicated by local policy on the BGP peers.

These procedures apply to both CAR route types, in addition to all procedures specified in earlier sections. LCM-EC is described in . Salient properties:

• The NLRI never changes, even though the color-to-intent mapping changes.
• E is globally unique, which makes E-C in that order unique.
• In typical expected cases, the color of the NLRI is used for resolution and steering.
• In the rare case of color incongruence, the local color encoded in LCM-EC takes precedence.

Operational considerations are in . Further illustrations are provided in .

Format and Encoding BGP CAR leverages BGP multiprotocol extensions and uses the MP_REACH_NLRI and MP_UNREACH_NLRI attributes for route updates within SAFI value 83 along with AFI 1 for IPv4 prefixes and AFI 2 for IPv6 prefixes. BGP speakers MUST use the BGP Capabilities Advertisement to ensure support for processing of BGP CAR updates. This is done as specified in , by using capability code 1 (multiprotocol BGP), with AFI 1 and 2 (as required) and SAFI 83. The Next Hop network address field in the MP_REACH_NLRI may either be an IPv4 address or an IPv6 address, independent of AFI. If the next hop length is 4, then the next hop is an IPv4 address. The next hop length may be 16 or 32 for an IPv6 next hop address, set as per . Processing of the Next Hop field is governed by standard BGP procedures as described in . The sub-sections below specify the generic encoding of the BGP CAR NLRI and non-key TLV fields, followed by the encoding for specific NLRI types introduced in this document.

BGP CAR SAFI NLRI Format The generic format for the BGP CAR SAFI NLRI is shown below: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | NLRI Length | Key Length | NLRI Type | // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ // | Type-Specific Key Fields // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type-Specific Non-Key TLV Fields (if applicable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ where:

NLRI Length:

1-octet field that indicates the length in octets of the NLRI excluding the NLRI Length field itself.

Key Length:

1-octet field that indicates the length in octets of the NLRI Type-Specific Key Fields. Key Length MUST be at least 2 less than the NLRI Length.

NLRI Type:

1-octet field that indicates the type of the BGP CAR NLRI.

Type-Specific Key Fields:

The exact definition of these fields depends on the NLRI Type. They have length indicated by the Key Length.

Type-Specific Non-Key TLV Fields:

The fields are optional and can carry one or more non-key TLVs (of different types) depending on the NLRI Type. The NLRI definition allows for encoding of specific non-key information associated with the route as part of the NLRI for efficient packing of BGP updates.

The non-key TLVs portion of the NLRI MUST be omitted while carrying it within the MP_UNREACH_NLRI when withdrawing the route advertisement. Error handling for CAR SAFI NLRI and non-key TLVs is described in . The benefits of CAR NLRI design are:

• The indication of the key length enables BGP speakers to determine the key portion of the NLRI and use it along with the NLRI Type field in an opaque manner for the handling of unknown or unsupported NLRI types. This can help deployed Route Reflectors (RR) to propagate NLRI types introduced in the future in a transparent manner.
• The key length also helps error handling be more resilient and minimally disruptive. The use of key length in error handling is described in .
• The ability of a route (NLRI) to carry more than one non-key TLV (of different types) provides significant benefits such as signaling multiple encapsulations simultaneously for the same route, each with a different value (label/SID, etc.). This enables simpler and efficient migrations with low overhead:
  • avoids the need for duplicate routes to signal different encapsulations
  • avoids the need for separate control planes for distribution
  • preserves update packing (e.g., )

Type-Specific Non-Key TLV Format The generic format for Non-Key TLVs is shown below: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type | Length | Value (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ where:

Type:

1 octet that contains the type code and flags. It is encoded as shown below: 0 1 2 3 4 5 6 7 +-+-+-+-+-+-+-+-+ |R|T| Type code | +-+-+-+-+-+-+-+-+ where:

R:

Bit is reserved and MUST be set to 0 and ignored on receive.

T:

Transitive bit, applicable to speakers that change the BGP CAR next hop.

• The T bit is set to indicate TLV is transitive. An unrecognized transitive TLV MUST be propagated by a speaker that changes the next hop.
• The T bit is unset to indicate TLV is non-transitive. An unrecognized non-transitive TLV MUST NOT be propagated by a speaker that changes the next hop.

A speaker that does not change the next hop SHOULD propagate all received TLVs.

Type code:

Remaining 6 bits contain the type of the TLV.

Length:

1-octet field that contains the length of the value portion of the Non-Key TLV in terms of octets.

Value:

Variable-length field as indicated by the Length field and to be interpreted as per the Type field.

The following sub-sections specify non-key TLVs. Each NLRI Type MUST list the TLVs that can be associated with it.

Label TLV The Label TLV is used for the advertisement of CAR routes along with their MPLS labels. It has the following format as per : 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |R|T| Type | Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ It is followed by one (or more) labels encoded as below: +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Label |Rsrv |S| +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ where:

Type:

Type code is 1. The T bit MUST be unset.

Length:

Length is in octets, variable, and MUST be a multiple of 3.

Label Information:

Multiples of 3-octet fields to convey the MPLS label(s) associated with the advertised CAR route. It is used for encoding a single label or a stack of labels for usage as described in . The number of labels is derived from the Length field. The 3-bit Rsrv field and the 1-bit S field SHOULD be set to zero on transmission and MUST be ignored on reception.

If a BGP transport CAR speaker sets itself as the next hop while propagating a CAR route, it allocates a local label for the type-specific key, and updates the value in this TLV. It also MUST program a label cross-connect that would result in the label swap operation for the incoming label that it advertises with the label received from its best-path router(s).

Label-Index TLV The Label-Index TLV is used for the advertisement of Segment Routing over MPLS (SR-MPLS) Segment Identifier (SID) information associated with the labeled CAR routes. It has the following format as per : 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |R|T| Type | Length | Reserved | Flags ~ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ ~ | Label Index ~ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ ~ | +-+-+-+-+-+-+-+-+ where:

Type:

Type code is 2. The T bit MUST be set.

Length:

Length is in octets and is 7.

Reserved:

1-octet field that MUST be set to 0 and ignored on receipt.

Flags:

2-octet field that's defined as per the Flags field of the Label-Index TLV of the BGP Prefix-SID attribute ().

Label Index:

4-octet field that's defined as per the Label Index field of the Label-Index TLV of the BGP Prefix-SID attribute ().

This TLV provides the equivalent functionality as the Label-Index TLV of for Transport CAR route in SR-MPLS deployments. When a speaker allocates a local label for a received CAR route as per , it SHOULD use the received Label Index as a hint using procedures as specified in . The Label-Index TLV provides much better packing efficiency by carrying the Label Index in NLRI instead of in the BGP Prefix-SID attribute (). The Label-Index TLV MUST NOT be carried in the Prefix-SID attribute for BGP CAR routes. If a speaker receives a CAR route with the Label-Index TLV in the Prefix-SID attribute, it SHOULD ignore it. The BGP Prefix-SID attribute SHOULD NOT be sent with the labeled CAR routes if the attribute is being used only to convey the Label-Index TLV.

SRv6 SID TLV BGP Transport CAR can be also used to set up end-to-end color-aware connectivity using Segment Routing over IPv6 (SRv6) . specifies the SRv6 Endpoint behaviors (e.g., End Penultimate Segment Pop (PSP)), which can be leveraged for BGP CAR with SRv6. The SRv6 SID TLV is used for the advertisement of CAR routes along with their SRv6 SIDs. It has the following format as per : 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ |R|T| Type | Length | SRv6 SID Info (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ where:

Type:

Type code is 3. The T bit MUST be unset.

Length:

Length is in octets, variable, and MUST be either less than or equal to 16, or be a multiple of 16.

SRv6 SID Information:

Field of size as indicated by the length that either carries the SRv6 SID(s) for the advertised CAR route as one of the following:

• A single 128-bit SRv6 SID or an ordered list of 128-bit SRv6 SIDs.
• A transposed portion (refer to ) of the SRv6 SID that MUST be of size in multiples of one octet and less than 16.

BGP CAR SRv6 SID TLV definitions provide the following benefits:

• The explicit encoding of SIDs avoids robustness issues caused by the overloading of MPLS label fields.
• The encoding to include the entire 128 bits for unique SIDs (non-transposition) maintains BGP update prefix packing.
• The highly efficient transposition scheme (12-14 bytes saved per NLRI) also maintains BGP update prefix packing.

The BGP CAR route update for SRv6 encapsulation MUST include the BGP Prefix-SID attribute along with the SRv6 L3 Service TLV carrying the SRv6 SID information as specified in . When using the transposition scheme of encoding for packing efficiency of BGP updates , the transposed part of the SID is carried in the SRv6 SID TLV and is not limited by MPLS label field size. If a BGP transport CAR speaker sets itself as the next hop while propagating a CAR route and allocates an SRv6 SID that maps to the received SRv6 SID, it updates the value in this TLV. Received MPLS information can map to SRv6 and vice versa.

Color-Aware Route (E, C) NLRI Type The Color-Aware Route NLRI Type is used for the advertisement of BGP CAR color-aware routes (E, C). It has the following format: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | NLRI Length | Key Length | NLRI Type |Prefix Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | IP Prefix (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Color (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ It is followed by optional Non-Key TLVs encoded as per . Where:

NLRI Length:

Variable.

Key Length:

Variable. It indicates the total length comprised of the Prefix Length field, IP Prefix field, and the Color field, as described below. For IPv4 (AFI=1), the minimum length is 5 and the maximum length is 9. For IPv6 (AFI=2), the minimum length is 5 and the maximum length is 21.

NLRI Type:

1.

Type-Specific Key Fields:

These are as seen below:

Prefix Length:

1-octet field that carries the length of prefix in bits. Length MUST be less than or equal to 32 for IPv4 (AFI=1) and less than or equal to 128 for IPv6 (AFI=2).

IP Prefix:

IPv4 or IPv6 prefix (based on the AFI). A variable-size field that contains the most significant octets of the prefix. The format of this field for an IPv4 prefix is:

• 0 octet for prefix length 0
• 1 octet for prefix length 1 to 8
• 2 octets for prefix length 9 to 16
• 3 octets for prefix length 17 up to 24
• 4 octets for prefix length 25 up to 32

The format for this field for an IPv6 address follows the same pattern for prefix lengths of 1-128 (octets 1-16). The last octet has enough trailing bits to make the end of the field fall on an octet boundary. Note that the value of the trailing bits MUST be set to zero. The size of the field MUST be less than or equal to 4 for IPv4 (AFI=1) and less than or equal to 16 for IPv6 (AFI=2).

Color:

4 octets that contain non-zero color value associated with the prefix.

Type-Specific Non-Key TLVs:

The Label TLV, Label-Index TLV, and SRv6 SID TLV () may be associated with the color-aware route NLRI type.

The prefix is unique across the administrative domains where BGP transport CAR is deployed. It is possible that the same prefix is originated by multiple BGP CAR speakers in the case of anycast addressing or multihoming. The Color is introduced to enable multiple route advertisements for the same prefix. The color is associated with an intent (e.g., low latency) in originator color domain.

IP Prefix (E) NLRI Type The IP Prefix Route NLRI Type is used for the advertisement of BGP CAR IP Prefix routes (E). It has the following format: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | NLRI Length | Key Length | NLRI Type |Prefix Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | IP Prefix (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ It is followed by optional Non-Key TLVs encoded as per . Where:

NLRI Length:

Variable.

Key Length:

Variable. It indicates the total length comprised of the Prefix Length field and IP Prefix field as described below. For IPv4 (AFI=1), the minimum length is 1 and the maximum length is 5. For IPv6 (AFI=2), the minimum length is 1 and the maximum length is 17.

NLRI Type:

2.

Type-Specific Key Fields:

These are as seen below:

Prefix Length:

1-octet field that carries the length of prefix in bits. Length MUST be less than or equal to 32 for IPv4 (AFI=1) and less than or equal to 128 for IPv6 (AFI=2).

IP Prefix:

IPv4 or IPv6 prefix (based on the AFI). A variable-size field that contains the most significant octets of the prefix. The format of this field for an IPv4 prefix is:

• 0 octet for prefix length 0
• 1 octet for prefix length 1 to 8
• 2 octets for prefix length 9 to 16
• 3 octets for prefix length 17 up to 24
• 4 octets for prefix length 25 up to 32

The format for this field for an IPv6 address follows the same pattern for prefix lengths of 1-128 (octets 1-16). The last octet has enough trailing bits to make the end of the field fall on an octet boundary. Note that the value of the trailing bits MUST be set to zero. The size of the field MUST be less than or equal to 4 for IPv4 (AFI=1) and less than or equal to 16 for IPv6 (AFI=2).

Type-Specific Non-Key TLVs:

The Label TLV, Label-Index TLV, and SRv6 SID TLV () may be associated with the IP Prefix NLRI Type.

Local Color Mapping (LCM) Extended Community This document defines a new BGP Extended Community called "LCM". The LCM is a Transitive Opaque Extended Community with the following encoding: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Type=0x3 | Sub-Type=0x1b | Reserved | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Color | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ where:

Type:

0x3.

Sub-Type:

0x1b.

Reserved:

2-octet reserved field that MUST be set to zero on transmission and ignored on reception.

Color:

4-octet field that carries the non-zero 32-bit color value.

When a CAR route crosses the originator's color domain boundary, LCM-EC is added or updated, as specified in . LCM-EC conveys the local color mapping for the intent (e.g., low latency) in other (transit or destination) color domains. For CAR IP Prefix routes, LCM-EC may also be added in the originator color domain to indicate the color associated with the IP prefix. An implementation SHOULD NOT send more than one instance of the LCM-EC. However, if more than one instance is received, an implementation MUST disregard all instances other than the one with the numerically highest value. If a node receives multiple BGP CAR routes (paths) for a given destination endpoint and color that have different LCM values, it is a misconfiguration in color re-mapping for one of the routes. In this case, the LCM from the selected BGP best path SHOULD be chosen to be installed into the routing table. A warning message SHOULD also be logged for further operator intervention. If present, LCM-EC contains the intent of a BGP CAR route. LCM-EC Color is used instead of the Color in CAR route NLRI for procedures described in earlier sections such as route validation (), route resolution (), AIGP calculation () and steering (). The LCM-EC MAY be used for filtering of BGP CAR routes and/or for applying routing policies on the intent, when present.

LCM-EC and BGP Color-EC Usage There are 2 distinct requirements to be supported as stated in :

1. Domains with different intent granularity ()
2. Network domains under different administration (i.e., color domains; see )

Requirement 1 is the case where within the same administrative or color domain, BGP CAR routes for N end-to-end intents may need to traverse across an intermediate transit domain where only M intents are available, N >= M. For example, consider a multi-domain network is designed as Access-Core-Access. The core may have the most granular N intents, whereas the access only has fewer M intents. Therefore, the BGP next-hop resolution for a CAR route in the access domain must be via a color-aware path for one of these M intents. As the procedures in describe, and the example in illustrates, BGP Color-EC is used to automate the CAR route resolution in this case. For requirement 2, where CAR routes traverse across different color domains, LCM-EC is used to carry the local color mapping for the NLRI color in other color domains. The related procedures are described in , and an example is given in . Both LCM-EC and BGP Color-EC may be present at the same time with a BGP CAR route. For example, a BGP CAR route (E, C1) from color domain D1, with LCM-EC C2 in color domain D2, may also carry Color-EC C3 and next hop N in a transit network domain within D2 where C2 is being resolved via an available intra-domain intent C3 (see the detailed example in the combination of Appendices and ). In this case, as described in , the default order of processing for resolution in the presence of LCM-EC is local policy, then BGP Color-EC color, and finally LCM-EC color.

Error Handling The error handling actions as described in are applicable for the handling of BGP update messages for BGP CAR SAFI. In general, as indicated in , the goal is to minimize the disruption of a session reset or 'AFI/SAFI disable' to the extent possible. When the error determined allows for the router to skip the malformed NLRI(s) and continue processing of the rest of the update message, then it MUST handle such malformed NLRIs as 'treat-as-withdraw'. In other cases, where the error in the NLRI encoding results in the inability to process the BGP update message, then the router SHOULD handle such malformed NLRIs as 'AFI/SAFI disable' when other AFI/SAFI besides BGP CAR are being advertised over the same session. Alternately, the router MUST perform 'session reset' when the session is only being used for BGP CAR SAFI. The CAR NLRI definition encodes NLRI length and key length explicitly. The NLRI length MUST be relied upon to enable the beginning of the next NLRI field to be located. Key length MUST be relied upon to extract the key and perform 'treat-as-withdraw' for malformed information. A sender MUST ensure that the NLRI and key lengths are the number of actual bytes encoded in the NLRI and key fields, respectively, regardless of content being encoded. Given the NLRI length and Key length MUST be valid, failures in the following checks result in 'AFI/SAFI disable' or 'session reset':

• The minimum NLRI Length MUST be at least 2, as Key Length and NLRI Type are required fields.
• The Key Length MUST be at least 2 less than NLRI Length.

NLRI type-specific error handling:

• By default, a speaker SHOULD discard an unrecognized or unsupported NLRI type and move to the next NLRI.
• Key length and key errors of a known NLRI type SHOULD result in the discard of NLRI similar to an unrecognized NLRI type. (This MUST be logged for trouble shooting.)

Transparent propagation of unrecognized NLRI type:

• Key length allows unrecognized route types to transit through the RR transparently without a software upgrade. The RR receiving unrecognized route types does not need to interpret the key portion of an NLRI and handles the NLRI as an opaque value of a specific length. An implementation SHOULD provide configuration that controls the RR unrecognized route type propagation behavior, possibly at the granularity of route type values allowed. This configuration option gives the operator the ability to allow specific route types to be transparently passed through RRs based on client speaker support.
• In such a case, the RRs may reflect NLRIs with NLRI type-specific key length and field errors. Clients of such an RR that consume the route for installation will perform the key error handling of known NLRI type or discard the unrecognized type. This prevents propagation of routes with NLRI errors any further in network.

Type-specific Non-Key TLV handling:

• Either the length of a TLV would cause the NLRI length to be exceeded when parsing the TLV, or fewer than 2 bytes remain when beginning to parse the TLV. In either of these cases, an error condition exists, and the 'treat-as-withdraw' approach MUST be used.
• Type-specific length constraints should be verified. The TLV MUST be discarded if there is an error. When discarded, an error may be logged for further analysis.
• If multiple instances of same type are encountered, all but the first instance MUST be discarded. When discarded, an error may be logged for further analysis.
• If a speaker that performs encapsulation to the BGP next hop does not receive at least one recognized forwarding information TLV with the T bit unset (such as label or SRv6 SID), such NLRI is considered invalid and not eligible for best path selection. 'Treat-as-withdraw' may be used, though it is recommended to keep the NLRI for debugging purposes.

Service Route Automated Steering on Color-Aware Paths An ingress PE (or ASBR) E1 automatically steers a C-colored service route V/v from E2 onto an (E2, C) color-aware path, as illustrated in . If several such paths exist, a preference scheme is used to select the best path. The default preference scheme is IGP Flexible Algorithm first, then SR Policy, followed by BGP CAR. A configuration option may be used to adjust the default preference scheme. An egress PE may express its intent that traffic should be steered a certain way through the transport layer by including the BGP Color-EC with the relevant service routes. An ingress PE steers service traffic over a CAR (E, C) route using the service route's next hop and BGP Color-EC. This is consistent with the automated service route steering on SR Policy (a routing solution providing color-aware paths) defined in . All the steering variations described in are applicable to BGP CAR paths: on-demand steering, per-destination steering, per-flow steering, and color-only steering. For brevity, please refer to . provides illustrations of service route automated steering over BGP CAR (E, C) routes. An egress PE may express its intent that traffic should be steered a certain way through the transport layer by allocating the SRv6 Service SID from a routed intent-aware locator prefix (). Steering at an ingress PE is via resolution of the Service SID over a CAR Type-2 IP Prefix route. Service steering over BGP CAR SRv6 transport is described in . Service steering via BGP CAR routes is applicable to any BGP SAFI, including SAFIs for IPv4/IPv6 (SAFI 1), L3VPN (SAFI 128), pseudowire (PW), EVPN (SAFI 70), FlowSpec, and BGP-LU (SAFI 4).

Filtering PEs and BRs may support filtering of CAR routes. For instance, the filtering may only accept routes of locally configured colors. Techniques such as RT Constrain may also be applied to the CAR SAFI, where Route Target (RT) Extended Communities can be used to constrain distribution and automate filtering of CAR routes. RT assignment may be via user policy; for example, an RT value can be assigned to all routes of a specific color. A PE may support on-demand installation of a CAR route based on the presence of a service route whose next hop resolves via the CAR route. Similarly, a PE may dynamically subscribe to receive individual CAR routes from upstream routers or Route Reflectors (RRs) to limit the routes that it needs to learn. On-demand subscription and automated filtering procedures for individual CAR routes are outside the scope of this document.

Scaling This section analyzes the key scale requirement of , specifically:

• No intermediate node data plane should need to scale to (Colors * PEs).
• No node should learn and install a BGP CAR route to (E, C) if it does not install a colored service route to E.

While the requirements and design principles generally apply to any transport, the logical analysis based on the network design in this section focuses on MPLS/SR-MPLS transport since the scaling constraints are specifically relevant to these technologies. BGP CAR SAFI is used here, but the considerations can apply to or used with MPLS/SR-MPLS. Two key principles used to address the scaling requirements are a hierarchical network and routing design, and on-demand route subscription and filtering. in provides an ultra-scale reference topology. describes this topology. presents three design models to deploy BGP CAR in the reference topology, including hierarchical options. analyzes the logical scaling properties of each model. Filtering techniques described in the previous section allow a PE to limit the CAR routes that it needs to learn or install. Scaling benefits of on-demand BGP subscription and filtering will be described in a separate document.

Ultra-Scale Reference Topology

Ultra-Scale Reference Topology RD:V/v via E2 +-----+ +-----+ vpn label:30030 +-----+ ....... |S-RR1| <........... |S-RR2| <...............|S-RR3| <...... : +-----+ +-----+ Color C1 +-----+ : : : : : : : +:------------+--------------+--------------+--------------+--------:-+ |: | | | | : | |: | | | | : | |: +---+ +---+ +---+ +---+ : | |: |121| |231| |341| |451| : | |: +---+ +---+ +---+ +---+ : | |---+ | | | | +---| | E1| | | | | | E2| |---+ | | | | +---| | +---+ +---+ +---+ +---+ | | |122| |232| |342| |452| | | +---+ +---+ +---+ +---+ | | Access | Metro | Core | Metro | Access | | domain 1 | domain 2 | domain 3 | domain 4 | domain 5 | +-------------+--------------+--------------+--------------+----------+ iPE iBRM iBRC eBRC eBRM ePE

The following description applies to the reference topology above:

• Independent IS-IS/OSPF SR instance in each domain.
• Each domain has Flex-Algo 128. Prefix-SID for a node is Segment Routing Global Block (SRGB) 168000 plus node number.
• A BGP CAR route (E2, C1) is advertised by egress BRM node 451. The route is sourced locally from redistribution from IGP Flex-Algo 128.
• Not shown for simplicity, node 452 will also advertise (E2, C1).
• When a transport RR (T-RR) is used within the domain or across domains, ADD-PATH is enabled to advertise paths from both egress BRs to its clients.
• Egress PE E2 advertises a VPN route RD:V/v with BGP Color-EC C1 that propagates via service RRs to ingress PE E1.
• E1 steers V/v prefix via color-aware path (E2, C1) and VPN label 30030.

Deployment Model

Flat

Flat Transport Network Design RD:V/v via E2 +-----+ +-----+ vpn label:30030 +-----+ ....... |S-RR1| <........... |S-RR2| <...............|S-RR3| <...... : +-----+ +-----+ Color C1 +-----+ : : : : : : : +:------------+--------------+--------------+--------------+--------:-+ |: | | | | : | |: | (E2,C1) | (E2,C1) | (E2,C1) | : | |: +---+ via 231 +---+ via 341 +---+ via 451 +---+ : | |:(E2,C1) |121|<---------|231|<---------|341|<---------|451| : | |: via 121 /+---+ L=168002 +---+ L=168002 +---+ L=168002 +---+ : | |---+ / | | | | +---| | E1| <--/ | | | | | E2| |---+ L=168002| | | | +---| | +---+ +---+ +---+ +---+ | | |122| |232| |342| |452| | | +---+ +---+ +---+ +---+ | | Access | Metro | Core | Metro | Access | | domain 1 | domain 2 | domain 3 | domain 4 | domain 5 | +-------------+--------------+--------------+--------------+----------+ iPE iBRM iBRC eBRC eBRM ePE 168121 168231 168341 168451 168002 168002 168002 168002 168002 30030 30030 30030 30030 30030 30030

• Node 451 advertises BGP CAR route (E2, C1) to 341, from which it goes to 231, then to 121, and finally to E1.
• Each BGP hop allocates local label and programs swap entry in forwarding for (E2, C1).
• E1 receives BGP CAR route (E2, C1) via 121 with label 168002.
  • Let's assume E1 selects that path.
• E1 resolves BGP CAR route (E2, C1) via 121 on color-aware path (121, C1).
  • Color-aware path (121, C1) is Flex-Algo 128 path to 121 (label 168121).
• E1's imposition color-aware label stack for V/v is thus:
  • 30030 <=> V/v
  • 168002 <=> (E2, C1)
  • 168121 <=> (121, C1)
• Each BGP hop performs swap operation on 168002 bound to color-aware path (E2, C1).

Hierarchical Design with Next-Hop-Self at Ingress Domain BR

Hierarchical BGP Transport CAR, Next-Hop-Self (NHS) at iBR (E2,C1) +-----+ via 451 +-----+ |T-RR1| <-------------- |T-RR2| / +-----+ L=168002 +-----+\ / \ +-------------+---/----------+--------------+-----------\--+----------+ | | / | | \ | | | (E2,C1) | / (451,C1) | (451,C1) | \| | | via 121 +---+ via 231 +---+ via 341 +---+ +---+ | | L=168002 |121| <======= |231| <========|341| <======= |451| | | / +---+ L=168451 +---+ L=168451 +---+ +---+ | |---+ / | | | | +---| | E1|<--/ | | | | | E2| |---+ | | | | +---| | +---+ +---+ +---+ +---+ | | |122| |232| |342| |452| | | +---+ +---+ +---+ +---+ | | Access | Metro | Core | Metro | Access | | domain 1 | domain 2 | domain 3 | domain 4 | domain 5 | +-------------+--------------+--------------+--------------+----------+ iPE iBRM iBRC eBRC eBRM ePE 168231 168341 168121 168451 168451 168451 168002 168002 168002 168002 168002 30030 30030 30030 30030 30030 30030

• Node 451 advertises BGP CAR route (451, C1) to 341, from which it goes to 231, and finally to 121.
• Each BGP hop allocates local label and programs swap entry in forwarding for (451, C1).
• 121 resolves received BGP CAR route (451, C1) via 231 (label 168451) on color-aware path (231, C1).
  • Color-aware path (231, C1) is Flex-Algo 128 path to 231 (label 168231).
• 451 advertises BGP CAR route (E2, C1) via 451 to T-RR2, which reflects it to T-RR1, which reflects it to 121.
• 121 receives BGP CAR route (E2, C1) via 451 with label 168002.
  • Let's assume 121 selects that path.
• 121 resolves BGP CAR route (E2, C1) via 451 on color-aware path (451, C1).
  • Color-aware path (451, C1) is BGP CAR path to 451 (label 168451).
• 121 imposition of color-aware label stack for (E2, C1) is thus:
  • 168002 <=> (E2, C1)
  • 168451 <=> (451, C1)
  • 168231 <=> (231, C1)
• 121 advertises (E2, C1) to E1 with next-hop-self (121) and label 168002.
• E1 constructs same imposition color-aware label stack for V/v via (E2, C1) as in the flat model:
  • 30030 <=> V/v
  • 168002 <=> (E2, C1)
  • 168121 <=> (121, C1)
• 121 performs swap operation on 168002 with hierarchical color-aware label stack for (E2, C1) via 451 from step 7.
• Nodes 231 and 341 perform swap operation on 168451 bound to color-aware path (451, C1).
• 451 performs swap operation on 168002 bound to color-aware path (E2, C1).

Note: E1 does not need the BGP CAR route (451, C1) in this design.

Hierarchical Design with Next-Hop-Unchanged at Ingress Domain BR

Hierarchical BGP Transport CAR, Next-Hop-Unchanged (NHU) at iBR (E2,C1) +-----+ via 451 +-----+ |T-RR1| <-------------- |T-RR2| / +-----+ L=168002 +-----+\ / \ +-------------+---/----------+--------------+-----------\--+----------+ | | / | | \ | | | (E2,C1) | / (451,C1) | (451,C1) | \| | | via 451 +---+ via 231 +---+ via 341 +---+ +---+ | | L=168002/|121| <======= |231| <========|341| <======= |451| | | / +---+ L=168451 +---+ L=168451 +---+ +---+ | |---+ <--/ //| | | | +---| | E1| // | | | | | E2| |---+ <===// | | | | +---| | (451,C1) +---+ +---+ +---+ +---+ | | via 121 |122| |232| |342| |452| | | L=168451 +---+ +---+ +---+ +---+ | | | | | | | | Access | Metro | Core | Metro | Access | | domain 1 | domain 2 | domain 3 | domain 4 | domain 5 | +-------------+--------------+--------------+--------------+----------+ iPE iBRM iBRC eBRC eBRM ePE 168121 168231 168341 168451 168451 168451 168451 168002 168002 168002 168002 168002 30030 30030 30030 30030 30030 30030

• Nodes 341, 231, and 121 receive and resolve BGP CAR route (451, C1) the same as in the previous model.
• Node 121 allocates local label and programs swap entry in forwarding for (451, C1).
• 451 advertises BGP CAR route (E2, C1) to T-RR2, which reflects it to T-RR1, which reflects it to 121.
• Node 121 advertises (E2, C1) to E1 with next hop as 451 (i.e., next-hop-unchanged).
• 121 also advertises (451, C1) to E1 with next-hop-self (121) and label 168451.
• E1 resolves BGP CAR route (451, C1) via 121 on color-aware path (121, C1).
  • Color-aware path (121, C1) is Flex-Algo 128 path to 121 (label 168121).
• E1 receives BGP CAR route (E2, C1) via 451 with label 168002.
  • Let's assume E1 selects that path.
• E1 resolves BGP CAR route (E2, C1) via 451 on color-aware path (451, C1).
  • Color-aware path (451, C1) is BGP CAR path to 451 (label 168451).
• E1's imposition color-aware label stack for V/v is thus:
  • 30030 <=> V/v
  • 168002 <=> (E2, C1)
  • 168451 <=> (451, C1)
  • 168121 <=> (121, C1)
• Nodes 121, 231, and 341 perform swap operation on 168451 bound to (451, C1).
• 451 performs swap operation on 168002 bound to color-aware path (E2, C1).

Scale Analysis The following two tables summarize the logically analyzed scaling of the control plane and data plane for the previous three models:

	E1	121	231
FLAT	(E2,C) via (121,C)	(E2,C) via (231,C)	(E2,C) via (341,C)
H.NHS	(E2,C) via (121,C)	(E2,C) via (451,C) (451,C) via (231,C)	(451,C) via (341,C)
H.NHU	(E2,C) via (451,C) (451,C) via (121,C)	(451,C) via (231,C)	(451,C) via (341,C)

	E1	121	231
FLAT	V -> 30030 168002 168121	168002 -> 168002 168231	168002 -> 168002 168341
H.NHS	V -> 30030 168002 168121	168002 -> 168002 168451 168231	168451 -> 168451 168341
H.NHU	V -> 30030 168002 168451 168121	168451 -> 168451 168231	168451 -> 168451 168341

• The flat model is the simplest design, with a single BGP transport level. It results in the minimum label/SID stack at each BGP hop. However, it significantly increases the scale impact on the core BRs (e.g., 341), whose FIB capacity and even MPLS label space may be exceeded.
  • 341's data plane scales with (E2, C) where there may be 300k Es and 5 Cs, hence 1.5M entries > 1M MPLS data plane.
• The hierarchical models avoid the need for core BRs to learn routes and install label forwarding entries for (E, C) routes.
  • Whether next hop is set to self or left unchanged at 121, 341's data plane scales with (451, C) where there may be thousands of 451s and 5 Cs. Therefore, this scaling is well under the 1 million MPLS labels data plane limit.
  • They also aid faster convergence by allowing the PE routes to be distributed via out-of-band RRs that can be scaled independent of the transport BRs.
• The next-hop-self option at ingress BRM (e.g., 121) hides the hierarchical design from the ingress PE, keeping its outgoing label programming as simple as the flat model. However, the ingress BRM requires an additional BGP transport level recursion, which coupled with load-balancing adds data plane complexity. It needs to support a swap and push operation. It also needs to install label forwarding entries for the egress PEs that are of interest to its local ingress PEs.
• With the next-hop-unchanged option at ingress BRM (e.g., 121), only an ingress PE needs to learn and install output label entries for egress (E, C) routes. The ingress BRM only installs label forwarding entries for the egress ABR (e.g., 451). However, the ingress PE needs an additional BGP transport level recursion and pushes a BGP VPN label and two BGP transport labels. It may also need to handle load-balancing for the egress ABRs. This is the most complex data plane option for the ingress PE.

Anycast SID This section describes how Anycast SID complements and improves the scaling designs above.

Anycast SID for Transit Inter-Domain Nodes

• Redundant BRs (e.g., two egress BRMs, 451 and 452) advertise BGP CAR routes for a local PE (e.g., E2) with the same SID (based on label index). Such egress BRMs may be assigned a common Anycast SID, so that the BGP next hops for these routes will also resolve via a color-aware path to the Anycast SID.
• The use of Anycast SID naturally provides fast local convergence upon failure of an egress BRM node. In addition, it decreases the recursive resolution and load-balancing complexity at an ingress BRM or PE in the hierarchical designs above.

Anycast SID for Transport Color Endpoints The common Anycast SID technique may also be used for a redundant pair of PEs that share an identical set of service (VPN) attachments.

• For example, assume a node E2' is paired with E2 above (e.g., ). Both PEs should be configured with the same static label/SID for the services (e.g., per-VRF VPN label/SID), and will advertise associated service routes with the Anycast IP as BGP next hop.
• This design provides a convergence and recursive resolution benefit on an ingress PE or ABR similar to the egress ABR case in . However, its applicability is limited to cases where the above constraints can be met.

Routing Convergence BGP CAR leverages existing well-known design techniques to provide fast convergence. describes how BGP CAR provides localized convergence within a domain for BR failures, including originating BRs, without propagating failure churn into other domains. Anycast SID techniques described in can provide further convergence optimizations for BR and PE failures deployed in redundant designs.

CAR SRv6

Overview Steering services over SRv6-based intent-aware multi-domain transport paths may be categorized into two distinct cases that are described in . Both cases are supported by BGP CAR, as described below.

Routed Service SID The SRv6 Service SID that is advertised with a service route is allocated by an egress PE from a routed intent-aware locator prefix (). Service steering at an ingress PE is via resolution of the Service SID signaled with the service route as described in . The intent-aware transport path to the SRv6 locator of the egress PE is provided by underlay IP routing. Underlay IP routing can include IGP Flexible Algorithm within a domain, and BGP CAR (as defined in this document) across multiple IGP domains or BGP ASes. An SRv6 locator prefix is assigned for a given intent or color. The SRv6 locator may be shared with an IGP Flexible Algorithm, or it may be assigned specific to BGP CAR for a given intent. Distribution of SRv6 locators in BGP CAR SAFI:

• In a multi-domain network, the SRv6 locator prefix is distributed using BGP CAR SAFI to ingress PEs and ASBRs in a remote domain. The SRv6 locator prefix may be advertised in the BGP CAR SAFI from an egress PE, or redistributed into BGP CAR from an IGP Flex-Algo at a BR. The locator prefix may also be summarized on a border node along the path and a summary route distributed to ingress PEs.
• An IP Prefix CAR route (Type-2) is defined to distribute SRv6 locator prefixes and described in Sections and .
• A BGP CAR advertised SRv6 locator prefix may also be used for resolution of the SRv6 Service SID advertised for best-effort connectivity.

Appendices and illustrate the control, and forwarding behaviors for routed SRv6 Service SIDs. describes the deployment options. describes operational considerations of using BGP CAR SAFI versus BGP IPv6 SAFI for inter-domain route distribution of SRv6 locators.

Non-Routed Service SID The SRv6 Service SID allocated by an egress PE is not routed. The service route carrying the non-routed SRv6 Service SID is advertised by the egress PE with a Color-EC C (). An ingress PE in a remote domain steers traffic for the received service route with Color-EC C and this SRv6 Service SID as described below. BGP CAR distribution of (E, C) underlay route:

• The intent-aware path to the egress PE within the egress domain is provided by an SR-TE or similar policy (E, C) . This (E, C) policy is distributed into the multi-domain network from egress BRs using a BGP CAR (E, C) route towards ingress PEs in other domains. This signaling is the same as for SR-MPLS as described in earlier sections.
• The (E, C) BGP CAR Type-1 route is advertised from a BR with an SRv6 transport SID allocated from an SRv6 locator assigned for the intent C. An SR-PCE or local configuration may ensure multiple BRs in the egress domain that originate the (E, C) route advertise the same SRv6 transport SID.

BGP CAR distribution of SRv6 locator underlay route:

• BGP CAR MAY also provide the underlay intent-aware inter-domain route to resolve the intent-aware SRv6 transport SID advertised with the (E, C) BGP CAR route as follows:
  • An egress domain BR has an SRv6 locator prefix that covers the SRv6 transport SID allocated by the egress BR for the (E, C) BGP CAR route.
  • The egress domain BR advertises an IP Prefix Type-2 CAR route for the SRv6 locator prefix, and the route is distributed across BGP hops in the underlay towards ingress PEs. This distribution is the same as the previous case in . The route may also be summarized in another CAR Type-2 route prefix.

Service traffic steering and SRv6 transport SID resolution at ingress PE:

• An ingress PE in a remote domain resolves the received service route with color C via the (E, C) BGP CAR route above, as described in .
• Additionally, the ingress PE resolves the SRv6 transport SID received in the BGP CAR (E, C) route via the BGP CAR IP Prefix route, similar to the SRv6 Routed Service SID resolution in .
  • Multiple (E, C) routes may resolve via a single IP Prefix CAR route.
    • Resolution of (E, C) routes over IP Prefix CAR routes is the typical resolution order as the IP Prefix route provides intent-aware reachability to the BRs that advertise the (E, C) specific routes for each egress PE. However, there can be use cases where an IP Prefix CAR route may resolve via a (E, C) route.
• The ingress PE via the recursive resolution above builds the packet encapsulation that contains the SRv6 Service SID and the received (E, C) route's SRv6 transport SID in the SID list.

contains an example that illustrates the control plane distribution, recursive resolution and forwarding behaviors described above. Note: An SR Policy may also be defined for multi-domain end to end , independent of BGP CAR. In that case, both BGP CAR and SR-TE inter-domain paths may be available at an ingress PE for an (E, C) route ().

Deployment Options for CAR SRv6 Locator Reachability Distribution and Forwarding Since an SRv6 locator (or summary) is an IPv6 prefix, it will be installed into the IPv6 forwarding table on a BGP router (e.g., ABR or ASBR) for packet forwarding. With the use of IPv6 locator prefixes, there is no need to allocate and install per-PE SIDs on each BGP hop to forward packets. A few options to forward packets for BGP SRv6 prefixes described in also apply to BGP CAR. These options are described in Sections and .

Hop-by-Hop IPv6 Forwarding for BGP SRv6 Prefixes This option employs hop-by-hop IPv6 lookup and forwarding on both BRs and P nodes in a domain along the path of propagation of BGP CAR routes. This option's procedures include the following:

• In addition to BRs, P nodes within a domain also learn BGP CAR IP Prefix routes (for SRv6) and install them into the forwarding table.
• BGP routing is enabled on all internal nodes (iBGP) using full-mesh or an RR.
• BRs distribute external BGP SRv6 routes to internal peers including P routers, with the following conditions:
  • the external BGP next hop is advertised unchanged to the internal peers;
  • internal nodes use recursive resolution via IGP at each hop to forward IPv6 packets towards the external BGP next hop; and
  • resolution is per intent/color (e.g., via IGP IPv6 Flex-Algo).

This design is illustrated with an example in . The benefits of this scheme are:

• A simpler design, as no tunnel encapsulation is required between BRs in a domain.
• No per-PE SID allocation and installation on any BGP hop.
• This design is similar to the well-known Internet / BGP hop-by-hop IP routing model and can support large-scale route distribution.
• In addition, since SRv6 locator prefixes can be summarized, this minimizes the number of routes, and hence the scale requirements on P routers.

Encapsulation Between BRs for BGP SRv6 Prefixes In this design, IPv6 lookup and forwarding for BGP SRv6 prefixes are only done on BGP BRs. This option includes the following procedures:

• These nodes use SRv6 (or other) encapsulations to reach the BGP SRv6 next hop.
  • SRv6 outer encapsulation may be H.Encaps.Red.
  • Encapsulation is not needed for directly connected next hops, such as with eBGP single-hop sessions.
• BGP route distribution is enabled between BRs via RRs, or directly if single-hop BGP.
• An egress BR sets itself as BGP next hop, and selects and advertises an appropriate encapsulation towards itself.
  • If SRv6 encapsulation, then the SRv6 SID advertised from egress BR is from an SRv6 locator for the specific intent within the domain. Multiple BGP SRv6 prefixes may share a common SID, avoiding per-PE SID allocation and installation on any BGP hop.
  • If MPLS/SR-MPLS transport, the route will carry the label/Prefix-SID allocated by the next hop. The label/SID may be shared among multiple routes.
• An ingress BR encapsulates SRv6 egress PE destined packets with encapsulation to BGP next hop (i.e., the egress BR).

The benefits of this scheme are:

• P nodes do not need to learn or install BGP SRv6 prefixes in this (BGP-free core) design.
• No per-PE SID allocation and installation on any BGP hop.

This design is illustrated in .

Operational Benefits of Using CAR SAFI for SRv6 Locator Prefix Distribution When reachability to an SRv6 SID is provided by distribution of a locator prefix via underlay routing, BGP IPv6 SAFI (AFI/SAFI=2/1) may also be used for inter-domain distribution of these IPv6 prefixes as described in or . Using the BGP CAR SAFI provides the following operational benefits:

• CAR SAFI is a separate BGP SAFI used for underlay transport intent-aware routing. It avoids overloading of BGP IPv6 SAFI, which also carries Internet (service) prefixes. Using CAR SAFI provides:
  • Automatic separation of SRv6 locator (transport) routes from Internet (service) routes,
    • preventing inadvertent leaking of routes, and
    • avoiding the need to configure specific route filters for locator routes.
  • Priority handling of infrastructure routes over service (Internet) routes.
• CAR SAFI also supports inter-domain distribution of (E, C) routes sourced from SR Policy, in addition to SRv6 locator IPv6 prefixes.
• CAR SAFI may also be used for best-effort routes in addition to intent-aware routes as described in the next section.

Note: If infrastructure routes such as SRv6 locator routes are carried in both BGP-IP / BGP-LU , and BGP CAR, describes the path selection preference between them.

CAR IP Prefix Route An IP Prefix CAR route is a route type (Type-2) that carries a routable IP prefix whose processing follows the semantics of and . IP Prefix CAR routes are installed in the default routing and forwarding table and provide longest-prefix-match forwarding. This is unlike Type-1 (E, C) routes, where it is the signaled forwarding data such as labels/SIDs that are installed in the forwarding table to create end-to-end paths. IP Prefix CAR routes may be originated into BGP CAR SAFI either from an egress PE or from a BR in a domain. Type-2 routes carry infrastructure routes for both IPv4 and IPv6. As described in , it is used for cases where a unique routable IP prefix is assigned for a given intent or color. It may also be used for routes providing best-effort connectivity. A few applicable example use cases:

• SRv6 locator prefix with color for specific intents.
• SRv6 locator prefix without color for best-effort.
• Best-effort transport reachability to a PE/BR without color.

For specific intents, color may be signaled with the IP Prefix CAR route for purposes such as intent-aware SRv6 SID or BGP next hop selection at each transit BR, color-based routing policies and filtering, and intent-aware next-hop resolution (). These purposes are the same as with (E, C) routes. For such purposes, color associated with the CAR IP Prefix route is signaled using LCM-EC. Reminder: LCM-EC conveys end-to-end intent/color associated with route/NLRI. When traversing network domain(s) where a different intent/color is used for next-hop resolution, BGP Color-EC may additionally be used as in . A special case of intent is best-effort, which may be represented by a color and follow the above procedures. However, to be compatible with existing operational usage, the CAR IP Prefix route is allowed to be without color for best-effort. In this case, the routes will not carry an LCM-EC. Resolution is described in . As described in , infrastructure prefixes are intended to be carried in CAR SAFI instead of SAFIs that also carry service routes such as BGP-IP (SAFI 1, ) and BGP-LU (SAFI 4, ). However, if such infrastructure routes are also distributed in these SAFIs, a router may receive both BGP CAR SAFI paths and IP/LU SAFI paths. By default, the CAR SAFI transport path is preferred over the BGP-IP or BGP-LU SAFI path. A BGP transport CAR speaker that supports packet forwarding lookup based on the IPv6 prefix route (such as a BR) will set itself as next hop while advertising the route to peers. It will also install the IPv6 route into forwarding with the received next hop and/or encapsulation. If such a transit router does not support this route type, it will not install this route and will not set itself as next hop; hence, it will not propagate the route any further.

VPN CAR This section illustrates the extension of BGP CAR to address the VPN intent-aware routing requirement stated in . The examples use MPLS, but other transport types can also be used (e.g., SRv6). CE1 -------------- PE1 -------------------- PE2 -------------- CE2 - V

• BGP CAR SAFI is enabled on CE1-PE1 and PE2-CE2 sessions.
• BGP VPN CAR SAFI is enabled between PE1 and PE2.
• Provider publishes to customer that intent "low delay" is mapped to color CP ("Provider Color") on its inbound peering links.
• Within its infrastructure, provider maps intent "low delay" to color CPT ("Provider Transport Color").
• On CE1 and CE2, intent "low delay" is mapped to CC ("Customer Color").

(V, CC) is a color-aware route originated by CE2.

1. CE2 sends to PE2: [(V, CC), label L1] via CE2 with LCM-EC (CP) as per peering agreement.
2. PE2 installs in VRF A: [(V, CC), L1] via CE2, which resolves on (CE2, CP) or connected Outgoing Interface (OIF).
3. PE2 allocates VPN label L2 and programs swap entry for (V, CC).
4. PE2 sends to PE1: [(RD, V, CC), L2] via PE2, LCM-EC (CP) with regular Color-EC (CPT).
5. PE1 installs in VRF A: [(V, CC), L2] via (PE2, CPT) steered on (PE2, CPT).
6. PE1 allocates label L3 and programs swap entry for (V, CC).
7. PE1 sends to CE1: [(V, CC), L3] via PE1 after removing LCM-EC through route policy.
8. CE1 installs: [(V, CC), L3] via PE1, which resolves on (PE1, CC) or connected OIF.
9. Label L3 is installed as the imposition label for (V, CC).

VPN CAR distribution for (RD, V, CC) requires a new SAFI that follows the same VPN semantics as defined in and also supports the distribution of routes with the CAR NLRI and associated non-key TLVs defined in of this document. Procedures defined in and apply to VPN CAR SAFI. Further, all CAR SAFI procedures described in above apply to CAR SAFI enabled within a VRF. Since CE and PE are typically in different administrative domains, LCM-EC is attached to CAR routes. VPN CAR SAFI routes follow color-based steering techniques as described in and illustrated in the example above. VPN CAR SAFI routes may also be advertised with a specific BGP next hop per color, with a TEA or Tunnel Encapsulation EC, and follow the procedures of . CAR routes distributed in VPN CAR SAFI are infrastructure routes advertised by CEs in different customer VRFs on a PE. Example use cases are intent-aware L3VPN Carriers' Carriers () and SRv6 over a provider network. The VPN RD distinguishes CAR routes of different customers being advertised by the PE.

Format and Encoding BGP VPN CAR SAFI leverages BGP multiprotocol extensions and uses the MP_REACH_NLRI and MP_UNREACH_NLRI attributes for route updates within SAFI value 84 along with AFI 1 for IPv4 VPN CAR prefixes and AFI 2 for IPv6 VPN CAR prefixes. BGP speakers MUST use the BGP Capabilities Advertisement to ensure support for processing of BGP VPN CAR updates. This is done as specified in , by using capability code 1 (multiprotocol BGP), with AFI 1 and 2 (as required) and SAFI 84. The Next Hop network address field in the MP_REACH_NLRI may contain either a VPN-IPv4 or a VPN-IPv6 address with 8-octet RD set to zero, independent of AFI. If the next hop length is 12, then the next hop is a VPN-IPv4 address with an RD of 0 constructed as per . If the next hop length is 24 or 48, then the next hop is a VPN-IPv6 address constructed as per .

VPN CAR (E, C) NLRI Type VPN CAR Type-1 (E, C) NLRI with RD has the format shown below: 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | NLRI Length | Key Length | NLRI Type |Prefix Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Route Distinguisher | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Route Distinguisher | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | IP Prefix (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Color (4 octets) | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ It is followed by optional Non-Key TLVs encoded as per . where: all fields are encoded as per with the following changes:

Key Length:

This length indicates the total length comprised of the RD, Prefix Length field, IP Prefix field, and the Color field.

Route Distinguisher:

An 8-octet field encoded according to .

Type-Specific Non-Key TLVs:

The Label TLV, Label-Index TLV, and SRv6 SID TLV () may be associated with the VPN CAR (E, C) NLRI Type.

VPN CAR IP Prefix NLRI Type 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | NLRI Length | Key Length | NLRI Type |Prefix Length | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Route Distinguisher | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Route Distinguisher | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | IP Prefix (variable) // +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ It is followed by optional Non-Key TLVs encoded as per . where: all fields are encoded as per with the following changes:

Key Length:

This length indicates the total length comprised of the RD, Prefix Length field, and IP Prefix field.

Route Distinguisher:

An 8-octet field encoded according to .

Type-Specific Non-Key TLVs:

The Label TLV, Label-Index TLV, and SRv6 SID TLV () may be associated with the VPN CAR IP Prefix NLRI Type.

The error handling specified in also applies to VPN CAR SAFI.

IANA Considerations

BGP CAR SAFIs IANA has assigned SAFI value 83 (BGP CAR) and SAFI value 84 (BGP VPN CAR) from the "SAFI Values" registry in the "Subsequent Address Family Identifiers (SAFI) Parameters" registry group with this document as a reference.

"BGP CAR NLRI Types" Registry IANA has created a "BGP CAR NLRI Types" registry in the "Border Gateway Protocol (BGP) Parameters" registry group with this document as a reference. The registry is for assignment of the 1-octet code points for BGP CAR NLRI types and is populated with the values shown below:

Type	NLRI Type	Reference
0	Reserved	RFC 9871
1	Color-Aware Route	RFC 9871
2	IP Prefix	RFC 9871
3-255	Unassigned

Allocations within the registry are to be made with the "Specification Required" policy as specified in and in .

"BGP CAR NLRI TLV" Registry IANA has created a "BGP CAR NLRI TLV Types" registry in the "Border Gateway Protocol (BGP) Parameters" registry group with this document as a reference. The registry is for assignment of the 6-bit code points for BGP CAR NLRI non-key TLV types and is populated with the values shown below:

Type	NLRI TLV Type	Reference
0	Reserved	RFC 9871
1	Label	RFC 9871
2	Label-Index	RFC 9871
3	SRv6 SID	RFC 9871
4-64	Unassigned

Allocations within the registry are to be made with the "Specification Required" policy as specified in and in . For a new TLV to be used with existing NLRI types, documentation of the NLRI types must be updated.

Guidance for Designated Experts In all cases of review by the Designated Expert (DE) described here, the DE is expected to ascertain the existence of suitable documentation (a specification) as described in for the "BGP CAR NLRI Types" registry and the "BGP CAR NLRI TLV" registry. The DE is also expected to check the clarity of purpose and use of the requested code points. Additionally, the DE must verify that any request for one of these code points has been made available for review and comment within the IETF: the DE will post the request to the IDR Working Group mailing list (or a successor mailing list designated by the IESG). The DE must ensure that any request for a code point does not conflict with work that is active or already published within the IETF. The DE is expected to confirm that the specification satisfies the requirements for the "Specification Required" policy (). In particular, as a reminder, the specification is required to be "permanent and readily available". The DE may assume that any document in the Internet-Draft or RFC repository satisfies the requirement for permanence and availability. In other cases, and in particular for any document not hosted by another standards development organization, the burden of proof of permanence falls on the applicant.

Additional Evaluation Criteria for the "BGP CAR NLRI Types" Registry

• Check the interoperability between the new NLRI type and current NLRI types specified in this document for BGP CAR SAFIs (BGP CAR SAFI and VPN CAR SAFI), and any updates to this document.
• Check if the specification indicates which non-key TLVs are applicable for the new NLRI type.

Additional Evaluation Criteria for the "BGP CAR NLRI TLV" Registry

• Check the applicability of the new TLV for the BGP CAR NLRI types defined.
• Check the T bit setting for the new TLV.

"Border Gateway Protocol (BGP) Extended Communities" Registry IANA has assigned the sub-type 0x1b for "Local Color Mapping (LCM)" in the "Transitive Opaque Extended Community Sub-Types" registry in the "Border Gateway Protocol (BGP) Extended Communities" registry group.

Manageability and Operational Considerations Color assignments in a multi-domain network operating under a common or cooperating administrative control (i.e., a color domain) should be managed similar to transport layer IP addresses, and ensure a unique and non-conflicting color allocation across the different network domains in that color domain. This is a logical best practice in a single color or administrative domain, which is the most typical deployment scenario. When color-aware routes propagate across a color domain boundary, there is typically no need for color assignments to be identical in both color domains, since the IP prefix is unique in the inter-domain transport network. This unique IP prefix provides a unique and non-conflicting scope for the color in an (E, C) route. Coordination between the operators of the color domains is needed only to enable the color to be re-mapped into a local color (carried in the LCM-EC) assigned for the same intent in the receiving color domain. However, if networks under different administrative control establish a shared transport service between them, where the same transport service IP address is coordinated and shared among two (or more) color domain networks, then the color assignments associated with that shared IP address should also be coordinated to avoid any conflicts in either network (). It should be noted that the color assignments coordination is only necessary for routes specific to the shared service IP. Colors used for intra-domain or for inter-domain intents associated with unique IP addresses do not need any coordination. Extended communities (LCM-EC/Color-EC) carried in BGP CAR and service routes MUST NOT be filtered, otherwise the desired intent will not be achieved.

Security Considerations This document does not change the underlying security considerations and issues inherent in the existing BGP protocol, such as those described in and . This document defines a new BGP SAFI and related extensions to carry color-aware routes and their associated attributes. The separate SAFI is expected to be explicitly configured by an operator. It is also expected that the necessary BGP route policy filtering is configured on this new SAFI to filter routing information distributed by the routers participating in this network, at appropriate points within and at the boundaries of this network. Also, given that this SAFI and these mechanisms can only be enabled through configuration of routers within an operator's network, standard security measures should be taken to restrict access to the management interface(s) of routers that implement these mechanisms. Additionally, BGP sessions SHOULD be protected using the TCP Authentication Option and the Generalized TTL Security Mechanism . BGP origin validation and BGPsec could also be used with this SAFI. Since CAR SAFI is a separate BGP SAFI that carries transport or infrastructure routes for routers in the operator network, it provides automatic separation of infrastructure routes and the service routes that are carried in existing BGP SAFIs such as BGP IPv4/IPv6 (SAFI=1), and BGP-LU (SAFI=4) (e.g., 6PE ). Using CAR SAFI thus provides better security (such as protection against route leaking) than would be obtained by distributing the infrastructure routes in existing SAFIs that also carry service routes. BGP CAR distributes label binding similar to ; hence, its security considerations apply. In SR deployments, BGP CAR distributes infrastructure prefixes along with their SID information for both SR-MPLS and SRv6. These deployments are within an SR domain and the security considerations of apply. Additionally, security considerations related to SRv6 deployments that are discussed in also apply. As discusses, BGP is vulnerable to traffic-diversion attacks. This SAFI route adds a new means by which an attacker could cause the traffic to be diverted from its normal path. Potential consequences include "hijacking" of traffic (insertion of an undesired node in the path, which allows for inspection or modification of traffic, or avoidance of security controls) or denial of service (directing traffic to a node that doesn't desire to receive it). The restriction of the applicability of this SAFI to its intended well-defined scope and the use of techniques described above limit the likelihood of traffic diversions.

References Normative References In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. BGP-4 Multiprotocol Extensions (BGP-MP) defines the format of two BGP attributes (MP_REACH_NLRI and MP_UNREACH_NLRI) that can be used to announce and withdraw the announcement of reachability information. This document defines how compliant systems should make use of those attributes for the purpose of conveying IPv6 routing information. [STANDARDS-TRACK] This document describes the "extended community" BGP-4 attribute. This attribute provides a mechanism for labeling information carried in BGP-4. These labels can be used to control the distribution of this information, or for other applications. [STANDARDS-TRACK] This document defines Multi-Protocol BGP (MP-BGP) procedures that allow BGP speakers to exchange Route Target reachability information. This information can be used to build a route distribution graph in order to limit the propagation of Virtual Private Network (VPN) Network Layer Reachability Information (NLRI) between different autonomous systems or distinct clusters of the same autonomous system. This document updates RFC 4364. [STANDARDS-TRACK] This document defines extensions to BGP-4 to enable it to carry routing information for multiple Network Layer protocols (e.g., IPv6, IPX, L3VPN, etc.). The extensions are backward compatible - a router that supports the extensions can interoperate with a router that doesn't support the extensions. [STANDARDS-TRACK] Routing protocols that have been designed to run within a single administrative domain (IGPs) generally do so by assigning a metric to each link and then choosing, as the installed path between two nodes, the path for which the total distance (sum of the metric of each link along the path) is minimized. BGP, designed to provide routing over a large number of independent administrative domains (autonomous systems), does not make its path-selection decisions through the use of a metric. It is generally recognized that any attempt to do so would incur significant scalability problems as well as inter-administration coordination problems. However, there are deployments in which a single administration runs several contiguous BGP networks. In such cases, it can be desirable, within that single administrative domain, for BGP to select paths based on a metric, just as an IGP would do. The purpose of this document is to provide a specification for doing so. According to the base BGP specification, a BGP speaker that receives an UPDATE message containing a malformed attribute is required to reset the session over which the offending attribute was received. This behavior is undesirable because a session reset would impact not only routes with the offending attribute but also other valid routes exchanged over the session. This document partially revises the error handling for UPDATE messages and provides guidelines for the authors of documents defining new attributes. Finally, it revises the error handling procedures for a number of existing attributes. This document updates error handling for RFCs 1997, 4271, 4360, 4456, 4760, 5543, 5701, and 6368. Many protocols make use of points of extensibility that use constants to identify various protocol parameters. To ensure that the values in these fields do not have conflicting uses and to promote interoperability, their allocations are often coordinated by a central record keeper. For IETF protocols, that role is filled by the Internet Assigned Numbers Authority (IANA). To make assignments in a given registry prudently, guidance describing the conditions under which new values should be assigned, as well as when and how modifications to existing values can be made, is needed. This document defines a framework for the documentation of these guidelines by specification authors, in order to assure that the provided guidance for the IANA Considerations is clear and addresses the various issues that are likely in the operation of a registry. This is the third edition of this document; it obsoletes RFC 5226. RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. This document specifies a set of procedures for using BGP to advertise that a specified router has bound a specified MPLS label (or a specified sequence of MPLS labels organized as a contiguous part of a label stack) to a specified address prefix. This can be done by sending a BGP UPDATE message whose Network Layer Reachability Information field contains both the prefix and the MPLS label(s) and whose Next Hop field identifies the node at which said prefix is bound to said label(s). This document obsoletes RFC 3107. Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through an ordered list of instructions, called "segments". A segment can represent any instruction, topological or service based. A segment can have a semantic local to an SR node or global within an SR domain. SR provides a mechanism that allows a flow to be restricted to a specific topological path, while maintaining per-flow state only at the ingress node(s) to the SR domain. SR can be directly applied to the MPLS architecture with no change to the forwarding plane. A segment is encoded as an MPLS label. An ordered list of segments is encoded as a stack of labels. The segment to process is on the top of the stack. Upon completion of a segment, the related label is popped from the stack. SR can be applied to the IPv6 architecture, with a new type of routing header. A segment is encoded as an IPv6 address. An ordered list of segments is encoded as an ordered list of IPv6 addresses in the routing header. The active segment is indicated by the Destination Address (DA) of the packet. The next active segment is indicated by a pointer in the new routing header. Segment Routing (SR) leverages the source-routing paradigm. A node steers a packet through an ordered list of instructions called "segments". A segment can represent any instruction, topological or service based. The ingress node prepends an SR header to a packet containing a set of segment identifiers (SIDs). Each SID represents a topological or service-based instruction. Per-flow state is maintained only on the ingress node of the SR domain. An "SR domain" is defined as a single administrative domain for global SID assignment. This document defines an optional, transitive BGP attribute for announcing information about BGP Prefix Segment Identifiers (BGP Prefix-SIDs) and the specification for SR-MPLS SIDs. The Segment Routing over IPv6 (SRv6) Network Programming framework enables a network operator or an application to specify a packet processing program by encoding a sequence of instructions in the IPv6 packet header. Each instruction is implemented on one or several nodes in the network and identified by an SRv6 Segment Identifier in the packet. This document defines the SRv6 Network Programming concept and specifies the base set of SRv6 behaviors that enables the creation of interoperable overlays with underlay optimization. This document defines a BGP path attribute known as the "Tunnel Encapsulation attribute", which can be used with BGP UPDATEs of various Subsequent Address Family Identifiers (SAFIs) to provide information needed to create tunnels and their corresponding encapsulation headers. It provides encodings for a number of tunnel types, along with procedures for choosing between alternate tunnels and routing packets into tunnels. This document obsoletes RFC 5512, which provided an earlier definition of the Tunnel Encapsulation attribute. RFC 5512 was never deployed in production. Since RFC 5566 relies on RFC 5512, it is likewise obsoleted. This document updates RFC 5640 by indicating that the Load-Balancing Block sub-TLV may be included in any Tunnel Encapsulation attribute where load balancing is desired. This document defines procedures and messages for SRv6-based BGP services, including Layer 3 Virtual Private Network (L3VPN), Ethernet VPN (EVPN), and Internet services. It builds on "BGP/MPLS IP Virtual Private Networks (VPNs)" (RFC 4364) and "BGP MPLS-Based Ethernet VPN" (RFC 7432). Segment Routing (SR) allows a node to steer a packet flow along any path. Intermediate per-path states are eliminated thanks to source routing. SR Policy is an ordered list of segments (i.e., instructions) that represent a source-routed policy. Packet flows are steered into an SR Policy on a node where it is instantiated called a headend node. The packets steered into an SR Policy carry an ordered list of segments associated with that SR Policy. This document updates RFC 8402 as it details the concepts of SR Policy and steering into an SR Policy. IGP protocols historically compute the best paths over the network based on the IGP metric assigned to the links. Many network deployments use RSVP-TE or Segment Routing - Traffic Engineering (SR-TE) to steer traffic over a path that is computed using different metrics or constraints than the shortest IGP path. This document specifies a solution that allows IGPs themselves to compute constraint-based paths over the network. This document also specifies a way of using Segment Routing (SR) Prefix-SIDs and SRv6 locators to steer packets along the constraint-based paths. Informative References Juniper Networks Inc. Cisco Systems Independent Contributor BT Verizon This draft describes the scope, set of use-cases and requirements for a distributed routing based solution to establish end-to-end intent- aware paths spanning multi-domain packet networks. The document focuses on BGP given its predominant use in inter-domain routing deployments, however the requirements may also apply to other solutions. Work in Progress This document discusses the Border Gateway Protocol (BGP), which is an inter-Autonomous System routing protocol. The primary function of a BGP speaking system is to exchange network reachability information with other BGP systems. This network reachability information includes information on the list of Autonomous Systems (ASes) that reachability information traverses. This information is sufficient for constructing a graph of AS connectivity for this reachability from which routing loops may be pruned, and, at the AS level, some policy decisions may be enforced. BGP-4 provides a set of mechanisms for supporting Classless Inter-Domain Routing (CIDR). These mechanisms include support for advertising a set of destinations as an IP prefix, and eliminating the concept of network "class" within BGP. BGP-4 also introduces mechanisms that allow aggregation of routes, including aggregation of AS paths. This document obsoletes RFC 1771. [STANDARDS-TRACK] Border Gateway Protocol 4 (BGP-4), along with a host of other infrastructure protocols designed before the Internet environment became perilous, was originally designed with little consideration for protection of the information it carries. There are no mechanisms internal to BGP that protect against attacks that modify, delete, forge, or replay data, any of which has the potential to disrupt overall network routing behavior. This document discusses some of the security issues with BGP routing data dissemination. This document does not discuss security issues with forwarding of packets. This memo provides information for the Internet community. This document describes a method by which a Service Provider may use an IP backbone to provide IP Virtual Private Networks (VPNs) for its customers. This method uses a "peer model", in which the customers' edge routers (CE routers) send their routes to the Service Provider's edge routers (PE routers); there is no "overlay" visible to the customer's routing algorithm, and CE routers at different sites do not peer with each other. Data packets are tunneled through the backbone, so that the core routers do not need to know the VPN routes. [STANDARDS-TRACK] This document describes a method by which a Service Provider may use its packet-switched backbone to provide Virtual Private Network (VPN) services for its IPv6 customers. This method reuses, and extends where necessary, the "BGP/MPLS IP VPN" method for support of IPv6. In BGP/MPLS IP VPN, "Multiprotocol BGP" is used for distributing IPv4 VPN routes over the service provider backbone, and MPLS is used to forward IPv4 VPN packets over the backbone. This document defines an IPv6 VPN address family and describes the corresponding IPv6 VPN route distribution in "Multiprotocol BGP". This document defines support of the IPv6 VPN service over both an IPv4 and an IPv6 backbone, and for using various tunneling techniques over the core, including MPLS, IP-in-IP, Generic Routing Encapsulation (GRE) and IPsec protected tunnels. The inter-working between an IPv4 site and an IPv6 site is outside the scope of this document. [STANDARDS-TRACK] This document explains how to interconnect IPv6 islands over a Multiprotocol Label Switching (MPLS)-enabled IPv4 cloud. This approach relies on IPv6 Provider Edge routers (6PE), which are Dual Stack in order to connect to IPv6 islands and to the MPLS core, which is only required to run IPv4 MPLS. The 6PE routers exchange the IPv6 reachability information transparently over the core using the Multiprotocol Border Gateway Protocol (MP-BGP) over IPv4. In doing so, the BGP Next Hop field is used to convey the IPv4 address of the 6PE router so that dynamically established IPv4-signaled MPLS Label Switched Paths (LSPs) can be used without explicit tunnel configuration. [STANDARDS-TRACK] The use of a packet's Time to Live (TTL) (IPv4) or Hop Limit (IPv6) to verify whether the packet was originated by an adjacent node on a connected link has been used in many recent protocols. This document generalizes this technique. This document obsoletes Experimental RFC 3682. [STANDARDS-TRACK] The early Multiprotocol Label Switching (MPLS) documents defined the form of the MPLS label stack entry. This includes a three-bit field called the "EXP field". The exact use of this field was not defined by these documents, except to state that it was to be "reserved for experimental use". Although the intended use of the EXP field was as a "Class of Service" (CoS) field, it was not named a CoS field by these early documents because the use of such a CoS field was not considered to be sufficiently defined. Today a number of standards documents define its usage as a CoS field. To avoid misunderstanding about how this field may be used, it has become increasingly necessary to rename this field. This document changes the name of the field to the "Traffic Class field" ("TC field"). In doing so, it also updates documents that define the current use of the EXP field. [STANDARDS-TRACK] This document specifies the TCP Authentication Option (TCP-AO), which obsoletes the TCP MD5 Signature option of RFC 2385 (TCP MD5). TCP-AO specifies the use of stronger Message Authentication Codes (MACs), protects against replays even for long-lived TCP connections, and provides more details on the association of security with TCP connections than TCP MD5. TCP-AO is compatible with either a static Master Key Tuple (MKT) configuration or an external, out-of-band MKT management mechanism; in either case, TCP-AO also protects connections when using the same MKT across repeated instances of a connection, using traffic keys derived from the MKT, and coordinates MKT changes between endpoints. The result is intended to support current infrastructure uses of TCP MD5, such as to protect long-lived connections (as used, e.g., in BGP and LDP), and to support a larger set of MACs with minimal other system and operational changes. TCP-AO uses a different option identifier than TCP MD5, even though TCP-AO and TCP MD5 are never permitted to be used simultaneously. TCP-AO supports IPv6, and is fully compatible with the proposed requirements for the replacement of TCP MD5. [STANDARDS-TRACK] To help reduce well-known threats against BGP including prefix mis- announcing and monkey-in-the-middle attacks, one of the security requirements is the ability to validate the origination Autonomous System (AS) of BGP routes. More specifically, one needs to validate that the AS number claiming to originate an address prefix (as derived from the AS_PATH attribute of the BGP route) is in fact authorized by the prefix holder to do so. This document describes a simple validation mechanism to partially satisfy this requirement. [STANDARDS-TRACK] This document defines a BGP extension that allows the advertisement of multiple paths for the same address prefix without the new paths implicitly replacing any previous ones. The essence of the extension is that each path is identified by a Path Identifier in addition to the address prefix. This document describes BGPsec, an extension to the Border Gateway Protocol (BGP) that provides security for the path of Autonomous Systems (ASes) through which a BGP UPDATE message passes. BGPsec is implemented via an optional non-transitive BGP path attribute that carries digital signatures produced by each AS that propagates the UPDATE message. The digital signatures provide confidence that every AS on the path of ASes listed in the UPDATE message has explicitly authorized the advertisement of the route. Intent and Intent-Based Networking are taking the industry by storm. At the same time, terms related to Intent-Based Networking are often used loosely and inconsistently, in many cases overlapping and confused with other concepts such as "policy." This document clarifies the concept of "intent" and provides an overview of the functionality that is associated with it. The goal is to contribute towards a common and shared understanding of terms, concepts, and functionality that can be used as the foundation to guide further definition of associated research and engineering problems and their solutions. This document is a product of the IRTF Network Management Research Group (NMRG). It reflects the consensus of the research group, having received many detailed and positive reviews by research group participants. It is published for informational purposes. This document describes a mechanism to advertise IPv6 prefixes in BGP that are associated with Color Extended Communities to establish end-to-end intent-aware paths for Segment Routing over IPv6 (SRv6) services. Such IPv6 prefixes are called "Colored Prefixes", and this mechanism is called "Colored Prefix Routing" (CPR). In SRv6 networks, the Colored Prefixes are the SRv6 locators associated with different intents. SRv6 services (e.g., SRv6 VPN services) with a specific intent could be assigned with SRv6 Segment Identifiers (SIDs) under the corresponding SRv6 locators, which are advertised as Colored Prefixes. This operational methodology allows the SRv6 service traffic to be steered into end-to-end intent-aware paths based on the longest prefix matching of SRv6 Service SIDs to the Colored Prefixes. The existing IPv6 Address Family and Color Extended Community are reused to advertise IPv6 Colored Prefixes without new BGP extensions; thus, this mechanism is easy to interoperate and can be deployed incrementally in multi-Autonomous System (AS) networks that belong to the same trusted domain. Cisco Systems Cisco Systems Bell Canada LinkedIn Huawei Technologies Juniper Networks This document describes SRv6 and MPLS/SR-MPLS interworking procedures. Interworking problem is generalized into various interworking scenarios. These scenarios are stitched either by transport interworking or service interworking. New SRv6 behaviors are defined for the purpose. These new behaviors and MPLS labels stitch end to end path across different data plane. Work in Progress

Illustrations of Service Steering The following sub-sections illustrate example scenarios of colored service route steering over end-to-end (E2E) BGP CAR paths, resolving over different intra-domain mechanisms. The examples in this section use MPLS/SR for the transport data plane. Scenarios related to SRv6 encapsulation are in a section below.

E2E BGP Transport CAR Intent Realized Using IGP Flexible Algorithm

BGP Flexible Algorithm Aware Transport CAR Path RD:V/v via E2 +-----+ vpn label: 30030 +-----+ ...... |S-RR1| <..................................|S-RR2| <....... : +-----+ Color C1 +-----+ : : : : : : : +-:-----------------------+----------------------+------------------:--+ | : | | : | | : | | : | | : (E2,C1) via 121 | (E2,C1) via 231 | (E2,C1)via E2 : | | : L=168002,AIGP=110 +---+ L=168002,AIGP=10 +---+ L=0x3,LI=8002 : | | : |-------------------|121|<-----------------|231|<-------------| : | | : V LI=8002 +---+ LI=8002 +---+ | : | |----+ | | +-----| | E1 | | | | E2 | |----+(E2,C1) via 122 | (E2,C1) via 232 | (E2,C1)via E2+-----| | ^ L=168002,AIGP=210 +---+ L=168002,AIGP=20 +---+ L=0x3 | | | |---------------- |122|<-----------------|232|<-------------| | | LI=8002 +---+ LI=8002 +---+ LI=8002 | | | | | | IS-IS SR | IS-IS SR | IS-IS SR | | FA128 | FA128 | FA128 | +-------------------------+----------------------+---------------------+ iPE iABR eABR ePE ---------direction of traffic--------> +------+ +------+ |168121| |168231| +------+ +------+ +------+ +------+ +------+ |168002| |168002| |168002| +------+ +------+ +------+ +------+ +------+ +------+ |30030 | |30030 | |30030 | +------+ +------+ +------+

Use case: Provide end-to-end intent for service flows.

• The following description applies to the reference topology above:
  • IGP Flex-Algo 128 is running in each domain, and mapped to color C1.
  • Egress PE E2 advertises a VPN route RD:V/v colored with Color-EC C1 to steer traffic to BGP transport CAR (E2, C1). VPN route propagates via service RRs to ingress PE E1.
  • BGP CAR route (E2, C1) with next hop, label index, and label as shown above are advertised through BRs in each domain. When an RR is used in the domain, ADD-PATH is enabled to advertise multiple available paths.
  • On each BGP hop, the (E2, C1) route's next hop is resolved over IGP Flex-Algo 128 of the domain. The AIGP attribute influences the BGP CAR route best path decision as per . The BGP CAR label swap entry is installed that goes over Flex-Algo 128 LSP to next hop providing intent in each IGP domain. The AIGP metric should be updated to reflect Flex-Algo 128 metric to next hop.
  • Ingress PE E1 learns CAR route (E2, C1). It steers colored VPN route RD:V/v into (E2, C1).
• Important:
  • IGP Flex-Algo 128 top label provides intent within each domain.
  • BGP CAR label (e.g., 168002) carries end-to-end intent. Thus, it stitches intent over intra-domain Flex-Algo 128.

E2E BGP Transport CAR Intent Realized Using SR Policy

BGP SR Policy Aware Transport CAR Path RD:1/8 via E2 +-----+ vpn label: 30030 +-----+ ...... |S-RR1| <..................................|S-RR2| <...... : +-----+ Color C1 +-----+ : : : : : : : +-:-----------------------+----------------------+------------------:-+ | : | | : | | : | | : | | : <-(E2,C1) via 121 | <-(E2,C1) via 231 | <-(E2,C1)via E2 : | | : +---+ +---+ : | | : ------------------>|121|----------------->|231|--------------| : | | : | SR Policy(C1,121) +---+ SR Policy(C1,231)+---+ SR Policy v : | |----+ | | (C1,E2) +---| | E1 | | | |E2 | |----+ <-(E2,C1) via 122 | (E2,C1) via 232 | <-(E2,C1)via E2+---| | | +---+ +---+ ^ | | ------------------>|122|----------------->|232|---------------| | | SR Policy(C1,122) +---+ SR Policy(C1,232)+---+ SR Policy(C1,E2) | | | | | | | | | | IS-IS SR | IS-IS SR | IS-IS SR | +-------------------------+----------------------+--------------------+ iPE iABR eABR ePE ---------direction of traffic--------> +------+ +------+ | S1 | | S2 | +------+ +------+ +------+ +------+ +------+ |160121| |160231| | S3 | +------+ +------+ +------+ +------+ +------+ +------+ |168002| |168002| |168002| +------+ +------+ +------+ +------+ +------+ +------+ |30030 | |30030 | |30030 | +------+ +------+ +------+

Use case: Provide end-to-end intent for service flows.

• The following description applies to the reference topology above:
  • An SR Policy provides intra-domain intent. The following are the example SID lists that are realized from SR policies in each domain and correspond to the label stack shown in :
    • SR Policy (C1, 121) segments <S1, 121>,
    • SR Policy (C1, 231) segments <S2, 231>, and
    • SR Policy (C1, E2) segments <S3, E2>.
  • Egress PE E2 advertises a VPN route RD:V/v colored with Color-EC C1 to steer traffic to BGP transport CAR (E2, C1). VPN route propagates via service RRs to ingress PE E1.
  • BGP CAR route (E2, C1) with next hop, label index, and label as shown above are advertised through BRs in each domain. When an RR is used in the domain, ADD-PATH is enabled to advertise multiple available paths.
  • On each BGP hop, the CAR route (E2, C1) next hop is resolved over an SR Policy (C1, next hop). The BGP CAR label swap entry is installed that goes over SR Policy segment list.
  • Ingress PE E1 learns CAR route (E2, C1). It steers colored VPN route RD:V/v into (E2, C1).
• Important:
  • SR Policy provides intent within each domain.
  • BGP CAR label (e.g., 168002) carries end-to-end intent. Thus, it stitches intent over intra-domain SR policies.

BGP Transport CAR Intent Realized in a Section of the Network

Provide Intent for Service Flows Only in Core Domain Running IS-IS Flexible Algorithm

BGP Hybrid Flexible Algorithm Aware Transport CAR Path RD:1/8 via E2 +-----+ vpn label: 30030 +-----+ ...... |S-RR1| <..................................|S-RR2| <....... : +-----+ Color C1 +-----+ : : : : : : : +-:-----------------------+----------------------+------------------:--+ | : | | : | | : | | : | | : (E2,C1) via 121 | (E2,C1) via 231 | (E2,C1) via E2 : | | : L=168002,AIGP=1110+---+L=168002,AIGP=1010+---+ L=0x3 : | | : |-------------------|121|<-----------------|231|<-------------| : | | : V LI=8002 +---+ LI=8002 +---+ | : | |----+ | | +-----| | E1 | | | | E2 | |----+(E2,C1) via 122 | (E2,C1) via 232 | (E2,C1) via E2+-----| | ^ L=168002,AIGP=1210+---+L=168002,AIGP=1020+---+ L=0x3 | | | |---------------- |122|<-----------------|232|<-------------| | | LI=8002 +---+ LI=8002 +---+ | | | | | | IS-IS SR | IS-IS SR | IS-IS SR | | Algo 0 | Flex-Algo 128 | Algo 0 | | Access | Core | Access | +-------------------------+----------------------+---------------------+ iPE iABR eABR ePE ---------direction of traffic--------> +------+ +------+ |160121| |168231| +------+ +------+ +------+ +------+ +------+ |168002| |168002| |160002| +------+ +------+ +------+ +------+ +------+ +------+ |30030 | |30030 | |30030 | +------+ +------+ +------+

• The following description applies to the reference topology above:
  • IGP Flex-Algo 128 is only enabled in core (e.g., WAN network), mapped to C1. Access network domain only has Base Algo 0.
  • Egress PE E2 advertises a VPN route RD:V/v colored with Color-EC C1 to steer traffic via BGP transport CAR (E2, C1). VPN route propagates via service RRs to ingress PE E1.
  • BGP CAR route (E2, C1) with next hop, label index, and label as shown above are advertised through BRs in each domain. When an RR is used in the domain, ADD-PATH is enabled to advertise multiple available paths.
  • Local policy on 231 and 232 maps intent C1 to resolve CAR route next hop over IGP Base Algo 0 in right access domain. The BGP CAR label swap entry is installed that goes over Base Algo 0 LSP to next hop. AIGP metric is updated to reflect Base Algo 0 metric to next hop with an additional penalty (+1000).
  • On 121 and 122, CAR route (E2, C1) next hop learnt from Core domain is resolved over IGP Flex-Algo 128. The BGP CAR label swap entry is installed that goes over Flex-Algo 128 LSP to next hop providing intent in Core IGP domain.
  • Ingress PE E1 learns CAR route (E2, C1). It maps intent C1 to resolve CAR route next hop over IGP Base Algo 0. It steers colored VPN route RD:V/v via (E2, C1).
• Important:
  • IGP Flex-Algo 128 top label provides intent in Core domain.
  • BGP CAR label (e.g., 168002) carries intent from PEs, which is realized in Core domain.

Provide Intent for Service Flows Only in Core Domain over TE Tunnel Mesh

BGP CAR over TE Tunnel Mesh in Core Network RD:1/8 via E2 +-----+ vpn label: 30030 +-----+ ...... |S-RR1| <..................................|S-RR2| <....... : +-----+ Color C1 +-----+ : : : : : : : +-:-----------------------+----------------------+-----------------:-+ | : | | : | | : | | : | | : (E2,C1) via 121 | (E2,C1) via 231 | (E2,C1) via E2 : | | : L=242003,AIGP=1110+---+L=242002,AIGP=1010+---+ L=0x3 : | | : |-------------------|121|<-----------------|231|<-------------|: | | : V +---+ TE tunnel(231) +---+ |: | |----+ | | +---| | E1 | | | |E2 | |----+(E2,C1) via 122 | (E2,C1) via 232 | (E2,C1) via E2+---| | ^ L=242004,AIGP=1210+---+L=242001,AIGP=1020+---+ L=0x3 | | | |---------------- |122|<-----------------|232|<-------------| | | +---+ TE tunnel(232) +---+ | | | | | | | | | | IS-IS/LDP | IS-IS/RSVP-TE | IS-IS/LDP | | Access 0 | Core | Access 1 | +-------------------------+----------------------+-------------------+ iPE iABR eABR ePE ---------direction of traffic--------> +------+ +------+ |240121| |241231| +------+ +------+ +------+ +------+ +------+ |242003| |242002| |240002| +------+ +------+ +------+ +------+ +------+ +------+ |30030 | |30030 | |30030 | +------+ +------+ +------+

• The following description applies to the reference topology above:
  • RSVP-TE MPLS tunnel mesh is configured only in core (e.g., WAN network). Access only has IS-IS/LDP. (The figure does not show all TE tunnels.)
  • Egress PE E2 advertises a VPN route RD:V/v colored with Color-EC C1 to steer traffic via BGP transport CAR (E2, C1). VPN route propagates via service RRs to ingress PE E1.
  • BGP CAR route (E2, C1) with next hops and labels as shown above is advertised through BRs in each domain. When an RR is used in the domain, ADD-PATH is enabled to advertise multiple available paths.
  • Local policy on 231 and 232 maps intent C1 to resolve CAR route next hop over best-effort LDP LSP in access domain 1. The BGP CAR label swap entry is installed that goes over LDP LSP to next hop. AIGP metric is updated to reflect best-effort metric to next hop with an additional penalty (+1000).
  • Local policy on 121 and 122 maps intent C1 to resolve CAR route next hop in Core domain over RSVP-TE tunnels. The BGP CAR label swap entry is installed that goes over a TE tunnel to next hop providing intent in Core domain. AIGP metric is updated to reflect TE tunnel metric.
  • Ingress PE E1 learns CAR route (E2, C1). It maps intent C1 to resolve CAR route's next hop over best-effort LDP LSP in access domain 0. It steers colored VPN route RD:V/v via (E2, C1).
• Important:
  • RSVP-TE tunnel LSP provides intent in Core domain.
  • Dynamic BGP CAR label carries intent from PEs, which is realized in Core domain by resolution via RSVP-TE tunnel.

Transit Network Domains That Do Not Support CAR

• In a brownfield deployment, color-aware paths between two PEs may need to go through a transit domain that does not support CAR. Examples of such a brownfield network include an MPLS LDP network with IGP best-effort, or a multi-domain network based on BGP-LU. An MPLS LDP network with best-effort IGP can adopt the above scheme in . Below is the example scenario for BGP-LU.
• Reference topology:

  BGP CAR Not Supported in Transit Domain E1 --- BR1 --- BR2 ......... BR3 ---- BR4 --- E2 Ci <----LU----> Ci

  • Network between BR2 and BR3 comprises of multiple BGP-LU hops (over IGP-LDP domains).
  • E1, BR1, BR4, and E2 are enabled for BGP CAR, with Ci colors.
  • BR1 and BR2 are directly connected; BR3 and BR4 are directly connected.
• BR1 and BR4 form an over-the-top peering (via RRs as needed) to exchange BGP CAR routes.
• BR1 and BR4 also form direct BGP-LU sessions to BR2 and BR3, respectively, to establish labeled paths between each other through the BGP-LU network. The sessions may be eBGP or iBGP.
• BR1 recursively resolves the BGP CAR next hop for CAR routes learnt from BR4 via the BGP-LU path to BR4.
• BR1 signals the transport discontinuity to E1 via the AIGP TLV, so that E1 can prefer other paths if available.
• BR4 does the same in the reverse direction.
• Thus, the color awareness of the routes, and hence the paths in the data plane, are maintained between E1 and E2, even if the intent is not available within the BGP-LU island.
• A similar design can be used for going over network islands of other types.

Resource Avoidance Using BGP CAR and IGP Flexible Algorithm This example illustrates a case of resource avoidance within a domain for a multi-domain color-aware path.

BGP CAR Resolution over IGP Flexible Algorithm for Resource Avoidance in a Domain +-------------+ +-------------+ | | | | V/v with C1 |----+ |------| +----|/ | E1 | | | | E2 |\ |----+ | | +----| W/w with C2 | |------| IGP FA128 | | IGP FA128 | | IGP FA129 | | Domain 1 | | Domain 2 | +-------------+ +-------------+

• C1 and C2 represent the following two unique intents in the multi-domain network:
  • C1 is mapped to "minimize IGP metric", and
  • C2 is mapped to "minimize IGP metric and avoid resource R".
• Resource R represents link(s) or node(s) to be avoided.
• Flex-Algo 128 in Domain 2 is mapped to "minimize IGP metric", and hence to C1.
• Flex-Algo 129 in Domain 2 is mapped to "minimize IGP metric and avoid resource R", and hence to C2.
• Flex-Algo 128 in Domain 1 is mapped to "minimize IGP metric" (i.e., there is no resource R to be avoided in Domain 1, hence both C1 and C2 are mapped to Flex-Algo 128).
• E1 receives the following two service routes from E2:
  • V/v with BGP Color-EC C1, and
  • W/w with BGP Color-EC C2.
• E1 has the following color-aware paths:
  • (E2, C1) provided by BGP CAR with the following per-domain resolution:
    • Domain 1: over IGP Flex-Algo 128, and
    • Domain 2: over IGP Flex-Algo 128.
  • (E2, C2) provided by BGP CAR with the following per-domain resolution:
    • Domain 1: over IGP Flex-Algo 128, and
    • Domain 2: over IGP Flex-Algo 129 (avoiding resource R).
• E1 automatically steers the received service routes as follows:
  • V/v via (E2, C1) provided by BGP CAR.
  • W/w via (E2, C2) provided by BGP CAR.

Observations:

• C1 and C2 are realized over a common intra-domain intent (Flex-Algo 128) in one domain and distinct intents in another domain as required.
• 32-bit Color space provides flexibility in defining a large number of intents in a multi-domain network. They may be efficiently realized by mapping to a smaller number of intra-domain intents in different domains.

Per-Flow Steering over CAR Routes This section provides an example of ingress PE per-flow steering as defined in onto BGP CAR routes. The following description applies to the reference topology in :

• Ingress PE E1 learns best-effort BGP-LU route E2.
• Ingress PE E1 learns CAR route (E2, C1), C1 is mapped to "low delay".
• Ingress PE E1 learns CAR route (E2, C2), C2 is mapped to "low delay and avoid resource R".
• Ingress PE E1 is configured to instantiate an array of paths to E2 where entry 0 is the BGP-LU path to next hop, color C1 is the first entry, and color C2 is the second entry. The index into the array is called a Forwarding Class (FC). The index can have values 0 to 7, especially when derived from the MPLS TC bits .
• E1 is configured to match flows in its ingress interfaces (upon any field such as Ethernet destination/source/VLAN/TOS or IP destination/source/DSCP or transport ports, etc.) and color them with an internal per-packet FC variable (0, 1, or 2 in this example).
• This array is presented as a composite candidate path of SR Policy (E2, C100) and acts as a container for grouping constituent paths of different colors/best-effort. This representation provides automated steering for services colored with Color-EC C100 via paths of different colors. Note that Color-EC C100 is used as indirection to the composite policy configured on ingress PE.
• Egress PE E2 advertises a VPN route RD:V/v with Color-EC C100 to steer traffic via composite SR Policy (E2, C100) (i.e., FC array of paths).

E1 receives three packets K, K1, and K2 on its incoming interface. These three packets match on the VPN route that recurses on E2. E1 colors these 3 packets with forwarding class 0, 1, and 2, respectively. As a result:

• E1 forwards K along the best-effort path to E2 (i.e., for the MPLS data plane, it pushes the best-effort label of E2).
• E1 forwards K1 along the (E2, C1) BGP CAR route.
• E1 forwards K2 along the (E2, C2) BGP CAR route.

Advertising BGP CAR Routes for Shared IP Addresses

BGP CAR Advertisements for Shared IP Addresses +-------------+ +--------------+ | | | +----| | |------| | E2 |(IP1) |----+ | | +----| | E1 | | | Domain 2 | |----+ | +--------------+ | | +--------------+ | | | +----| | Domain 1 |------| | E3 |(IP1) +-------------+ | +----| | Domain 3 | +--------------+

This example describes a case where a route for the same transport IP address is originated from multiple nodes in different network domains. One use of this scenario is an anycast transport service, where packet encapsulation (e.g., LSP) may terminate on any one among a set of nodes. All the nodes are capable of forwarding the inner payload, typically via an IP lookup in the global table for Internet routes. A couple of variations of the use case are described in the example below. One node is shown in each domain, but there will be multiple nodes in practice for redundancy. Example 1: Anycast with forwarding to nearest egress:

• Both E2 (in egress domain 2) and E3 (in egress domain 3) advertise Anycast (shared) IP (IP1, C1) with same label L1.
• An ingress PE E1 receives by default the best path(s) for (IP1, C1) propagated through BGP hops across the network.
• The paths to (IP1, C1) from E2 and E3 may merge at a common node along the path to E1, forming equal cost multipaths or active-backup paths at that node.
• Service route V/v is advertised from egress domains D2 and D3 with color C1 and next hop IP1.
• Traffic for V/v steered at E1 via (IP1, C1) is forwarded to either E2 or E3 (or both) as determined by routing along the network (nodes in the path).

Example 2: Anycast with egress domain visibility at ingress PE:

• E2 advertises (IP1, C1) and E3 advertises (IP1, C2) CAR routes for the Anycast IP IP1. C1 and C2 are colors assigned to distinguish the egress domains originating the routes to IP1.
• An ingress PE E1 receives the best path(s) propagated through BGP hops across the network for both (IP1, C1) and (IP1, C2).
• The CAR routes (IP1, C1) and (IP1, C2) do not get merged at any intermediate node, providing E1 control over path selection and load-balancing of traffic across these two routes. Each route may itself provide multipathing or anycast to a set of egress nodes.
• Service route V/v advertised from egress domains D2 and D3 with colors C1 and C2, respectively, but with same next hop IP1.
• E1 will resolve and steer V/v path from D2 via (IP1, C1) and path from D3 via (IP2, C2). E1 will load-balance traffic to V/v across the two paths as determined by a local load-balancing policy.
• Traffic for colored service routes steered at E1 is forwarded to either E2 or E3 (or load-balanced across both) as determined by E1.

In above example, D2 and D3 belonged to the same color or administrative domain. If D2 and D3 belong to different color domains, the domains will coordinate the assignment of colors with shared IP IP1 so that they do not cause conflicts. For instance, in Example 1:

• D2 and D3 may both use C1 for the same intent when they originate CAR route for IP1.
  • In this case, neither D2 nor D3 will reuse C1 for some other intent.
• Alternatively, D2 may use C2 and D3 may use C3 for originating a CAR route for IP1 for the same intent.
  • In this case, D2 will not use C3 for originating CAR route for IP1 for some other intent. Similarly, D3 will not use C2 for originating CAR route for IP1 for some other intent.

Color Mapping Illustrations There are a variety of deployment scenarios that arise when different color mappings are used in an inter-domain environment. This section attempts to enumerate them and provide clarity into the usage of the color-related protocol constructs.

Single Color Domain Containing Network Domains with N:N Color Distribution

• All network domains (ingress, egress, and all transit domains) are enabled for the same N colors.
  • A color may of course be realized by different technologies in different domains as described above.
• The N intents are both signaled end-to-end via BGP CAR routes, as well as realized in the data plane.
• is an example of this case.

Single Color Domain Containing Network Domains with N:M Color Distribution

• Certain network domains may not be enabled for some of the colors used for end-to-end intents, but may still be required to provide transit for routes of those colors.
• When a (E, C1) route traverses a domain where color C1 is not available, the operator may decide to use a different intent of color C2 that is available in that domain to resolve the next hop and establish a path through the domain.
  • The next-hop resolution may occur via paths of any intra-domain protocol or even via paths provided by BGP CAR.
  • The next-hop resolution color C2 may be defined as a local policy at ingress or transit nodes of the domain.
  • It may also be automatically signaled from egress border nodes by attaching a Color-EC with value C2 to the BGP CAR routes.
• Hence, routes of N end-to-end colors may be resolved over paths from a smaller set of M colors in a transit domain, while preserving the original color awareness end-to-end.
• Any ingress PE that installs a service (VPN) route with a color C1 must have C1 enabled locally to install IP routes to (E, C1) and resolve the service route's next hop.
• A degenerate variation of this scenario is where a transit domain does not support any color. describes an example of this case.

Illustration for N end-to-end intents over fewer M intra-domain intents:

N:M Illustration RD:V/v via E2 Color-EC: 100 RD:W/w via E2 Color-EC: 200 +-----+ RD:X/x via E2 Color-EC: 300 +-----+ ...... |S-RR1| <..................................|S-RR2| <........ : +-----+ RD:Y/y via E2 Color-EC: 400 +-----+ : : : : : : : +-:---------------------+---------------------+----------------------:-+ | : | | : | | | | | | (E2,100) via 121 | (E2,100) via 231 | (E2,100) via E2 | | Color-EC: 1,10 | Color-EC: 1,10 | Color-EC: 1,10 | | | | | | (E2,200) via 121 | (E2,200) via 231 | (E2,200) via E2 | | Color-EC: 1,20 | Color-EC: 1,20 | Color-EC: 1,20 | | <--- <---- | | (E2,300) via 121 | (E2,300) via 231 | (E2,300) via E2 | | Color-EC: 2,30 | Color-EC: 2,30 | Color-EC: 2,30 | | | | | | (E2,400) via 121 | (E2,400) via 231 | (E2,400) via E2 | | Color-EC: 2,40 | Color-EC: 2,40 | Color-EC: 2,40 | | | | | | +===+ +===+ | |====+ | |-------C10-------| | +=====| | |-------C1-------| |-------C20-------| |-------C1-------| | | E1 | |121| |231| | E2 | | |-------C2-------| |-------C30-------| |-------C2-------| | |====+ | |-------C40-------| | +=====| | +===+ +===+ | | C1=FA132 | C10=FA128 | C1=FA132 | | C2=FA133 | C20=FA129 | C2=FA133 | | | C30=FA130 | | | | C40=FA131 | | | | | | | IS-IS SR | IS-IS SR | IS-IS SR | | ACCESS | CORE | ACCESS | +-----------------------+---------------------+------------------------+ iPE iABR eABR ePE

• The following description applies to the reference topology above:
  • Core domain provides 4 intra-domain intents as described below:
    • FA128 mapped to C10,
    • FA129 mapped to C20,
    • FA130 mapped to C30, and
    • FA131 mapped to C40.
  • Access domain provides the following 2 intra-domain intents:
    • FA132 mapped to C1, and
    • FA133 mapped to C2.
  • Operator defines the following 4 BGP CAR end-to-end intents as below:
    • CAR color C100 that resolves on C1 in access and C10 in Core domain,
    • CAR color C200 that resolves on C1 in access and C20 in Core domain,
    • CAR color C300 that resolves on C2 in access and C30 in Core domain, and
    • CAR color C400 that resolves on C2 in access and C40 in Core domain.
  • E2 may originate BGP CAR routes with multiple BGP Color-ECs as shown above. At each hop, CAR route's next hop is resolved over the available intra-domain color. For example (E2, C100) with BGP Color-ECs C1, C10 resolves over C1 at ABR 231, C10 at ABR 121, and C1 at E1.
  • Egress PE E2 advertises a VPN route RD:V/v colored with BGP Color-EC C100 to steer traffic through Flex-Algo 132 in access and Flex-Algo 128 in core. It also advertises another VPN route RD:W/w colored with BGP Color-EC C200 to steer traffic through Flex-Algo 132 in access and Flex-Algo 129 in core.
• Important:
  • End-to-end (BGP CAR) colors can be decoupled from intra-domain transport colors.
  • Each end-to-end BGP CAR color is a combination of various intra-domain colors or intents.
  • Combination can be expressed by local policy at ABRs or by attaching multiple BGP Color-ECs at origination point of BGP CAR route.
  • Service traffic is steered into suitable CAR color to use the most granular intent in a domain multiple hops away from ingress PE.
  • Consistent reuse of standard color-based resolution mechanism at both service and transport layers.

Multiple Color Domains When the routes are distributed between domains with different color-to-intent mapping schemes, both N:N and N:M cases are possible. Although an N:M mapping is more likely to occur. Reference topology:

Multiple Color Domains D1 ----- D2 ----- D3 C1 C2 C3

• C1 in D1 maps to C2 in D2 and to C3 in D3.
• BGP CAR is enabled in all three color domains.

The reference topology above is used to elaborate on the design described in When the route originates in color domain D1 and gets advertised to a different color domain D2, the following procedures apply:

• The NLRI of the BGP CAR route is preserved end to end (i.e., route is (E, C1)).
• A BR of D1 attaches LCM-EC with value C1 when advertising to a BR in D2.
• A BR in D2 receiving (E, C1) maps C1 in received LCM-EC to local color, say C2.
  • A BR in D2 may receive (E, C1) from multiple D1 BRs, which provide equal cost or primary/backup paths.
• Within D2, this LCM-EC value of C2 is used instead of the Color in CAR route NLRI (E, C1). This applies to all procedures described in the earlier section for a single color domain, such as next-hop resolution and service steering.
• A colored service route V/v originated in color domain D1 with next hop E and Color-EC C1 will also have its Color-EC value re-mapped to C2, typically at a service RR.
• On an ingress PE in D2, V/v will resolve via C2.
• When a BR in D2 advertises the route to a BR in D3, the same process repeats.

CAR SRv6 Illustrations

BGP CAR SRv6 Locator Reachability Hop-by-Hop Distribution

RD:V/v via E2 +-----+ SRv6SID=B:C11:2:DT4:: +-----+ ...... |S-RR1| <..................................|S-RR2| <..... : +-----+ +-----+ : : : : : : AS2 AS1 : +-:------------------------------------+ +--------------:--+ | : | | : | | : B:C11::/32 via IP1 | | : | | : +-----+ LCM=C1, AIGP=10 | | : | | : |T-RR |<.............. | | : | | : +-----+<.......... : | | : | | : : B:C11::/32 : : | | : | | : : via IP2 : : | | : | | : : LCM=C1,AIGP=10: : | | : | | : ......... : : : | B:C11::/32 | : | | : : : : : | via 231 | +-----| | : : : : : | LCM=C1 | | E2 | : : +---+ : +---+ : : | AIGP=10 | +-----| | : : |P11|<.:..>|P13| : +----+ +---+ : | | : : +---+ : +---+ : | 121|-----IP1|231| : | | V V : : +----+ eBGP +---+ : | |----+ : : | | +-----| | E1 | +---+ : +---+ : | | | En | |----+ |P12|<.:..>|P14| : | | +-----| | +---+ +---+ : +----+ eBGP +---+ | | IPv6 FIB: ...| 122|-----IP2|232| | | B:C11::/32 via IP1 +----+ +---+ | | via IP2 | B:C11::/32 | | | | via 232 | | | | LCM=C1 | | | | AIGP=10 | | | IS-ISv6 | | IS-ISv6 | | FA128 (B:C12::/32) | |FA128(B:C11::/32)| | FA0 (B:02::/32) | |FA0 (B:01::/32) | +--------------------------------------+ +-----------------+ iPE ASBR ASBR ePE

The topology above is an example to illustrate the BGP CAR SRv6 locator prefix route-based design () with hop-by-hop IPv6 routing within and between domains.

• Multi-AS network with eBGP CAR session between ASBRs.
• Transport RR (T-RR) peers with P, BR, and PE clients within an AS to propagate CAR prefixes. ADD-PATH is enabled to propagate multiple paths.
• IS-IS (IGP) Flex-Algo 128 for SRv6 is running in each AS (AS may consist of multiple IGP domains), where the following steps apply:
  • Prefix B:C11::/32 summarizes Flex-Algo 128 block in AS1 for the given intent. Node locators in the egress domain are sub-allocated from the block for the given intent.
  • Similarly, Prefix B:C12::/32 summarizes Flex-Algo 128 block in AS2.
  • Per Flex-Algo external subnets for eBGP next hops IP1 and IP2 are distributed in IS-IS within AS2.
• BGP CAR prefix route B:C11::/32 with LCM C1 is originated by AS1 BRs 231 and 232 on eBGP sessions to AS2 BRs 121 and 122.
• ASBR 121 and 122 propagate the route in AS2 to all the P, ABRs, and PEs through T-RR.
• Every router in AS2 resolves BGP CAR prefix B:C11::/32 next hops IP1 and IP2 in IS-ISv6 Flex-Algo 128 and programs B:C11::/32 prefix in global IPv6 forwarding table.
• AIGP attribute influences BGP CAR route best path decision.
• Egress PE E2 advertises a VPN route RD:V/v with SRv6 Service SID B:C11:2:DT4::. Service SID is allocated by E2 from its locator of color C1 intent.
• Ingress PE E1 learns (via service RRs S-RR1 and S-RR2) VPN route RD:V/v with SRv6 SID B:C11:2:DT4::.
• Service traffic encapsulated with SRv6 Service SID B:C11:2:DT4:: is inherently steered hop by hop along IPv6 routed path to B:C11::/32 provided by BGP CAR in AS2.
• Encapsulated service traffic is inherently steered along IPv6 routed path to B:C11::/32 provided by IS-ISv6 Flex-Algo 128 in AS1.
• Design applies to multiple ASNs. BGP next hop is rewritten across an eBGP hop.

Important:

• No tunneling/encapsulation on ingress PE and BRs for BGP CAR provided transport.
• Uses longest prefix match of SRv6 Service SID to BGP CAR IP prefix. No mapping to labels/SIDs, instead use of simple IP-based forwarding.

Packet forwarding: @E1: IPv4 VRF V/v => H.Encaps.red <B:C11:2:DT4::> => Forward based on B:C11::/32 @P*: IPv6 table: B:C11::/32 => Forward to interface, NH @121: IPv6 Table: B:C11::/32 => Forward to interface, NH @231: IPv6 table: B:C11:2::/48 :: => Forward via IS-ISv6 Flex-Algo path to E2 @231: IPv6 Table B:C11:2::/48 => Forward via IS-ISv6 Flex-Algo path to E2 @E2: My SID table B:C11:2:DT4:: => Pop the outer header and look up the inner DA in the VRF

BGP CAR SRv6 Locator Reachability Distribution with Encapsulation

RD:V/v via E2 +-----+ SRv6SID=B:C11:2:DT4:: +-----+ ...... |S-RR1| <..................................|S-RR2| <....... : +-----+ +-----+ : : : : : : : +-:-----------------------+----------------------+------------------:--+ | : | | : | | : | | : | | : B:C11::/32 via 121 | B:C11::/32 via 231 | : | | : SID=B:C13:121:END:: | SID=B:C12:231:END:: | : | | : LCM=C1,AIGP=110 +---+LCM=C1 AIGP=10 +---+ : | | : |-------------------|121|<-----------------|231|<-------------| : | | : V +---+ +---+ | : | |----+ | | +-----| | E1 | | | | E2 | |----+ | | +-----| | ^ | | : | | | | | : | | | | | +-----| | | | | | En | | | | | +-----| | | +---+ +---+ | | | |---------------- |122|<-----------------|232|<-------------| | | +---+ +---+ | | B:C11::/32 via 122 | B:C11::/32 via 232 | | | SID=B:C13:122:END:: | SID=B:C12:232:END:: | | | LCM=C1 AIGP=120 | LCM=C1 AIGP=20 | | | | | | | IS-ISv6 | IS-ISv6 | IS-ISv6 | | FA128 (B:C13::/32) | FA128 (B:C12::/32) | FA128 (B:C11::/32) | | FA0 (B:03::/32) | FA0 (B:02::/32) | FA0 (B:01::/32) | +-------------------------+----------------------+---------------------+ iPE iABR eABR ePE

The topology above is an example to illustrate the BGP CAR SRv6 locator prefix route-based design () with intra-domain encapsulation. The example shown is iBGP, but also applies to eBGP (multi-AS).

• IGP Flex-Algo 128 is running in each domain, where:
  • Prefix B:C11::/32 summarizes Flex-Algo 128 block in egress domain for the given intent. Node locators in the egress domain are sub-allocated from the block.
  • Prefix B:C12::/32 summarizes Flex-Algo 128 block in transit domain.
  • Prefix B:C13::/32 summarizes Flex-Algo 128 block in ingress domain.
• BGP CAR route B:C11::/32 is originated by ABRs 231 and 232 with LCM C1. Along the propagation path, BRs set next-hop-self and appropriately update the intra-domain encapsulation information for the C1 intent. For example, 231 and 121 signal SRv6 SID of End behavior allocated from their respective locators for the C1 intent. (Note: IGP Flexible Algorithm is shown for intra-domain path, but SR Policy may also provide the path as shown in .)
• AIGP attribute influences BGP CAR route best path decision.
• Egress PE E2 advertises a VPN route RD:V/v with SRv6 Service SID B:C11:2:DT4::. Service SID is allocated by E2 from its locator of color C1 intent.
• Ingress PE E1 learns CAR route B:C11::/32 and VPN route RD:V/v with SRv6 SID B:C11:2:DT4::.
• Traffic encapsulated with SRv6 Service SID B:C11:2:DT4:: is steered along IPv6 routed path provided by BGP CAR IP Prefix route to locator B:C11::/32.

Important:

• Uses longest prefix match of SRv6 Service SID to BGP CAR prefix. There is no mapping labels/SIDs; there is simple IP-based forwarding instead.
• Originating domain PE locators of the given intent can be summarized on transit BGP hops eliminating per PE state on BRs.

Packet forwarding: @E1: IPv4 VRF V/v => H.Encaps.red <B:C13:121:END::, B:C11:2:DT4::> @121: My SID table: B:C13:121:END:: => Update DA with B:C11:2:DT4:: @121: IPv6 Table: B:C11::/32 => H.Encaps.red <B:C12:231:END::> @231: My SID table: B:C12:231:END:: => Remove IPv6 header; Inner DA B:C11:2:DT4:: @231: IPv6 Table B:C11:2::/48 => Forward via IS-ISv6 Flex-Algo path to E2 @E2: My SID table B:C11:2:DT4:: => Pop the outer header and look up the inner DA in the VRF

BGP CAR (E, C) Route Distribution for Steering Non-Routed Service SID

RD:V/v via E2 +-----+ SRv6SID: B:01:2:DT4:: +-----+ ...... |S-RR1| <..................................|S-RR2| <....... : +-----+ Color C2 +-----+ : : : : +-----+ (E2,C2) via 231 : : -----------------|T-RR |-------------------| : :| +-----+ SID=B:C21:2:B6:: | : +-:|---------------------+---------------------|+------------------:--+ | :| | || : | | :| | || : | | :| B:C21::/32 via 121 | B:C21::/32 via 231 ||SR Policy(E2,C2) : | | :| LCM=C2,AIGP=110 | LCM=C2 AIGP=10 ||BSID=B:C21:2:B6:: : | | :| +---+ +---+ : | | :|-------------------|121|<-----------------|231|<-------------| : | | :V SR Policy(121,C2) +---+SR Policy(231,C2) +---+ | : | |----+ | | +-----| | E1 | | | | E2 | |----+ | | +-----| | ^ SR Policy(122,C2) +---+SR Policy(232,C2) +---+ | | | |---------------- |122|<-----------------|232|<-------------| | | B:C21::/32 via 121+---+B:C21::/32 via 232+---+ SR Policy(E2,C2) | | LCM=C2,AIGP=120 | LCM=C2 AIGP=20 | BSID=B:C21:2:B6:: | | | | | | IS-ISv6 | IS-ISv6 | IS-ISv6 | | FA0 (B:03::/32) | FA0 (B:02::/32) | FA0(B:01::/32) | +------------------------+----------------------+---------------------+ iPE iABR eABR ePE

The topology above is an example to illustrate the BGP CAR (E, C) route-based design (). The example is iBGP, but the design also applies to eBGP (multi-AS).

• SR Policy (E2, C2) provides given intent in egress domain.
  • SR Policy (E2, C2) with segments <B:01:z:END::, B:01:2:END::>, where z is the node id in egress domain.
• Egress ABRs 231 and 232 redistribute SR Policy into BGP CAR Type-1 NLRI (E2, C2) to other domains, with SRv6 SID of End.B6 behavior. This route is propagated to ingress PEs through T-RR or inline through BRs (121 and 122) with next-hop-unchanged.
• The ABRs also advertise BGP CAR prefix route (B:C21::/32) summarizing locator part of SRv6 SIDs for SR policies of given intent to different PEs in egress domain. BGP CAR prefix route propagates through BRs. At each BGP hop, BGP CAR prefix next-hop resolution triggers intra-domain transit SR Policy (C2, CAR next hop). For example:
  • SR Policy (231, C2) with segments <B:02:y:END::, B:02:231:END::>, and
  • SR Policy (121, C2) with segments <B:03:x:END::, B:03:121:END::>,
  • where x and y are node ids within the respective domains.
• Egress PE E2 advertises a VPN route RD:V/v with Color-EC C2.
• Ingress PE E1 steers VPN route from E2 onto BGP CAR route (E2, C2) that results in H.Encaps.red of SRv6 transport SID B:C21:2:B6:: and SRv6 Service SID as last segment in IPv6 header.
• IPv6 destination B:C21:2:B6:: match on CAR prefix B:C21::/32 that steers the packet into intra-domain (intent-aware) SR Policy on ingress PE E1 and ABR 121.
• IPv6 packet destination B:C21:2:B6:: lookup in mySID table on ABR 231 or 232 results in END.B6 behavior (i.e., push of policy segments to E2).

Important:

• Ingress PE steers services via (E, C) CAR route as per .
• In data plane (E, C), resolution results in IPv6 header destination being SRv6 SID of END.B6 behavior whose locator is of given intent on originating ABRs.
• CAR IP Prefix route along the transit path provides simple Longest Prefix Match (LPM) IPv6 forwarding along the transit BGP hops.
• CAR NLRI Type-2 prefix summarizes binding SIDs of all SR policies on originating ABR of a given intent to different PEs in egress domain. This eliminates per PE state on transit routers.

Packet forwarding: @E1: IPv4 VRF V/v => H.Encaps.red <B:C21:2:B6::, B:0:E2:DT4::> H.Encaps.red <SR Policy (C2,121) sid list> @121: My SID table: B:03:121:END:: => Remove outer IPv6 header; Inner DA B:C21:2:B6:: @121: IPv6 Table: B:C21::/32 => H.Encaps.red <SR Policy (C2,231) sid list> @231: My SID table: B:02:231:END:: => Remove outer IPv6 header; Inner DA B:C21:2:B6:: @231: MySIDtable B:C21:2:B6:: => H.Encaps.red <SR Policy (C2,E2) sid list> @E2: IPv6 Table B:0:2:DT4:: => Pop the outer header and look up the inner DA in the VRF

CAR SAFI NLRI Update Packing Efficiency Calculation CAR SAFI NLRI encoding is optimized for update packing. It allows per-route information (for example, label, label index, and SRv6 SID encapsulation data) to be carried in the non-key TLV part of NLRI. This allows multiple NLRIs to be packed in a single update message when other attributes (including LCM-EC, when present) are shared. The table below shows a theoretical analysis calculated from observed BGP update message size in operational networks. It compares total BGP data on the wire for CAR SAFI against encoding as specified in [RFC8277] in the following cases: an MPLS label (CASE A), an SR extension with MPLS (per-prefix label index in Prefix-SID attribute; see [RFC8669]) (CASE B), and an SRv6 SID (CASE C). The packing scenarios considered are as follows:

• the ideal case (where the maximum number of routes are packed to the update message limit of 4k bytes),
• the practical case of average packing (where 5 routes share a set of BGP path attributes, and hence are packed in a single update message), and
• the worst case of no packing (where each route is in a separate update message).

Summary of the Ideal, Practical, and Worst Cases of Packing BGP Data

Encoding	BGP CAR NLRI	NLRI as per	Result
CASE A: Label
(Ideal)	27.5 MB	26 MB	No degradation compared to encoding as specified in .
(Practical)	86 MB	84 MB
(Worst; no packing)	325 MB	324 MB
CASE B: Label & Label-Index
(Ideal)	42 MB	339 MB Packing not possible	CAR SAFI encoding is more efficient by 88% in the best case and 71% in the average case over the encoding as specified in (which precludes packing).
(Practical)	99 MB	339 MB Packing not possible
(Worst; no packing)	339 MB	339 MB
CASE C: SRv6 SID
(Ideal)	49 MB	378 MB Packing not possible	Results are similar to the SR-MPLS case. Transposition provides a further 20% reduction in BGP data.
(Practical)	115 MB	378 MB Packing not possible
(Worst; no packing)	378 MB	378 MB

This analysis considers 1.5 million routes (5 colors across 300k endpoints). CASE A: BGP data exchanged for MPLS (non-SR): Consider 200 bytes of shared attributes CAR SAFI signals label in non-key TLV part of NLRI Each NLRI size for AFI 1 = 12(key) + 5(label) = 17 bytes Ideal packing: Number of NLRIs in 4k update size = 223 (4k-200/17) Number of update messages of 4k size = 1.5 million/223 = 6726 Total BGP data on wire = 6726 * 4k = ~27.5 MB Practical packing (5 routes in update message): Size of update message = (17 * 5) + 200 = 285 Total BGP data on wire = 285 * 300k = ~86 MB No-packing case (1 route per update message): Size of update message = 17 + 200 = 217 Total BGP data on wire = 217 * 1.5 million = ~325 MB SAFI 128 using encoding specified in RFC 8277 with label in NLRI Each NLRI size for AFI 1 = 13(key) + 3(label) = 16 bytes Ideal packing: Number of NLRIs in 4k update size = 237 (4k-200/16) Number of update messages of 4k size = 1.5 million/237 = ~6330 Total BGP data on wire = 6330 * 4k = ~25.9 MB Practical packing (5 routes in update message): Size of update message = (16 * 5) + 200 = 280 Total BGP data on wire = 280 * 300k = ~84 MB No-packing case (1 route per update message): Size of update message = 16 + 200 = 216 Total BGP data on wire = 216 * 1.5 million = ~324 MB CASE B: BGP data exchanged for SR-MPLS label index: Consider 200 bytes of shared attributes CAR SAFI signals label index in non-key TLV part of NLRI Each NLRI size for AFI 1 = 12(key) + 5(label) + 9(Index) = 26 bytes Ideal packing: Number of NLRIs in 4k update size = 146 (4k-200/26) Number of update messages of 4k size = 1.5 million/146 = 6726 Total BGP data on wire = 10274 * 4k = ~42 MB Practical packing (5 routes in update message) Size of update message = (26 * 5) + 200 = 330 Total BGP data on wire = 330 * 300k = ~99 MB No-packing case (1 route per update message) Size of update message = 26 + 200 = 226 Total BGP data on wire = 226 * 1.5 million = ~339 MB SAFI 128 using encoding specified in RFC 8277 with label in NLRI Each NLRI size for AFI 1 = 13(key) + 3(label) = 16 bytes Ideal packing: Not supported as label index is encoded in Prefix-SID attribute Practical packing (5 routes in update message): Not supported as label index is encoded in Prefix-SID attribute No-packing case (1 route per update message): Size of update message = 16 + 210 = 226 Total BGP data on wire = 216 * 1.5 million = ~339 MB CASE C: BGP data exchanged with 128 bit single SRv6 SID: Consider 200 bytes of shared attributes CAR SAFI signals SRv6 SID in non-key TLV part of NLRI Each NLRI size for AFI 1 = 12(key) + 18(SRv6 SID) = 30 bytes Ideal packing: Number of NLRIs in 4k update size = 126 (4k-200/30) Number of update messages of 4k size = 1.5 million/126 = ~12k Total BGP data on wire = 12k * 4k = ~49 MB Practical packing (5 routes in update message): Size of update message = (30 * 5) + 236 (including Prefix-SID) = 386 Total BGP data on wire = 386 * 300k = ~115 MB No-packing case (1 route per update message): Size of update message = 12 + 236 (SID in Prefix-SID) = 252 Total BGP data on wire = 252 * 1.5 million = ~378 MB SAFI 128 using encoding specified in RFC 8277 with label in NLRI (No transposition) Each NLRI size for AFI 1 = 13(key) + 3(label) = 16 bytes Ideal packing: Not supported as SRv6 SID is encoded in Prefix-SID attribute Practical packing (5 routes in update message): Not supported as SRv6 SID is encoded in Prefix-SID attribute No-packing case (1 route per update message): Size of update message = 16 + 236 = 252 Total BGP data on wire = 252 * 1.5 million = ~378 MB BGP data exchanged with transposition of 4 bytes from SRv6 SID into SRv6 SID TLV: Consider 200 bytes of shared attributes CAR SAFI signals SRv6 SID in non-key TLV part of NLRI Each NLRI size for AFI 1 = 12(key) + 6(SRv6 SID) = 18 bytes Ideal packing: Number of NLRIs in 4k update size = 211 (4k-200/18) Number of update messages of 4k size = 1.5 million/211 = ~7110 Total BGP data on wire = 7110 * 4k = ~29 MB Practical packing (5 routes in update message): Size of update message = (18 * 5) + 236 (including Prefix-SID) = 326 Total BGP data on wire = 326 * 300k = ~98 MB No-packing case (1 route per update message): Size of update message = 12 + 236 (SID in Prefix-SID attribute) = 252 Total BGP data on wire = 252 * 1.5 million = ~378 MB

Acknowledgements The authors would like to acknowledge the invaluable contributions of many collaborators towards the BGP CAR solution and this document in providing input about use cases, participating in brainstorming and mailing list discussions and in reviews of the solution and draft revisions. In addition to the contributors listed in the Contributors section, the authors would like to thank , , , , , , , , , , , , , , , , , , , , , , , , , and . The authors also appreciate the detailed reviews and astute suggestions provided by (as document shepherd), , , and that have greatly improved the document.

Contributors The following people gave substantial contributions to the content of this document and should be considered as coauthors: Cisco Systems

Belgium cfilsfil@cisco.com

Orange

France bruno.decraene@orange.com

Verizon

United States of America luay.jalil@verizon.com

Alibaba, Inc

yitai.syc@alibaba-inc.com

Individual

United States of America juttaro@ieee.org

Futurewei

United States of America james.n.guichard@futurewei.com

Cisco Systems

India ketant.ietf@gmail.com

Arrcus, Inc

United States of America keyur@arrcus.com

Huawei Technologies

China rainsword.wang@huawei.com

Huawei Technologies

China jie.dong@huawei.com

Additional contributors: Lapishills Consulting Limited

Germany dirk@lapishills.com

AT&T

United States of America im8327@att.com

Ciena

United States of America rrokui@ciena.com

Authors' Addresses Cisco Systems

United States of America dhrao@cisco.com

Cisco Systems

United States of America swaagraw@cisco.com