BGP Entropy Label Characteristic

Introduction provides a way for a BGP speaker to advertise certain characteristics of routes. In particular, it is useful to advertise forwarding plane features. This specification defines an NHC characteristic, called "ELCv3", to advertise the ability to process the Multiprotocol Label Switching (MPLS) Entropy Label as an egress Label Switching Router (LSR) for all NLRI advertised in the BGP UPDATE. It updates and with regard to this BGP signaling; this is further discussed in . ELCv3 is only relevant to NLRI of labeled address families. (The term "labeled address family" is defined in the first paragraph of Section 3.5 of . In this document, we use the term "labeled NLRI" as a short form of "NLRI of a labeled address family.")

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.

Entropy Label Characteristic (ELCv3) defines the NHC as a container for characteristic TLVs. The Entropy Label Characteristic is one such characteristic. When BGP is used for distributing labeled NLRI as described in, for example, , the route may include the ELCv3 as part of the NHC. The inclusion of this characteristic with a route indicates that the egress of the associated Label Switched Path (LSP) can process entropy labels as an egress LSR for that route -- see Section 4.1 of . Below, we refer to this for brevity as being "EL-capable." For historical reasons, this characteristic is referred to as "ELCv3", to distinguish it from the prior Entropy Label Capability (ELC) defined in and deprecated in , and the ELCv2 described in . This section (and its subsections) replaces Section 5.2 of , which was previously deprecated by .

Encoding The ELCv3 has characteristic code 1, characteristic length 0, and carries no value:

ELCv3 TLV Format

Sending the ELCv3 When a BGP speaker S has a route R it wishes to advertise with next hop N to its peer, it MAY include the ELCv3 characteristic if it knows that the egress of the associated LSP L is EL-capable; otherwise, it MUST NOT include the ELCv3 characteristic. Specific conditions where S would know that the egress is EL-capable are if S:

Is itself the egress, and knows itself to be EL-capable, or
Is re-advertising a BGP route it received with a valid ELCv3 characteristic, and is preserving the value of N as received, or
Is re-advertising a BGP route it received with a valid ELCv3 characteristic, and is changing the next hop that it has received to N, and knows that this new next hop (normally itself) is EL-capable, or
Is re-advertising a BGP route it received with a valid ELCv3 characteristic, and is changing the next hop that it has received to N, and knows (for example, through configuration) that the new next hop (normally itself) even if not EL-capable will simply swap labels without popping the BGP-advertised label stack and processing the label below, as with a transit LSR, or
Knows by implementation-specific means that the egress is EL-capable, or
Is redistributing a route learned from another protocol, and that other protocol conveyed the knowledge that the egress of L was EL-capable. (For example, this might be known through the Label Distribution Protocol (LDP) ELC TLV, Section 5.1 of .)

The ELCv3 MAY be advertised with routes that are labeled, such as those using SAFI 4 . It MUST NOT be advertised with unlabeled routes.

Aggregation When forming an aggregate (see Section 2.2.2 of ), the aggregate route thus formed MUST NOT include the ELCv3 unless each constituent route would be eligible to include the ELCv3 according to the criteria given above.

Receiving the ELCv3 (Below, we assume that "includes the ELCv3" implies that the containing NHC has passed the checks specified in Section 2.3 of . If it had not passed, then the NHC would have been discarded and the ELCv3 would be deemed not to have been included.) When a BGP speaker receives an unlabeled route that includes the ELCv3, it MUST discard the ELCv3. When a BGP speaker receives a labeled route, if it includes the ELCv3, that indicates it can safely insert an entropy label into the label stack of the associated LSP. This implies that the receiving BGP speaker, if acting as ingress, MAY insert an entropy label as per Section 4.2 of .

ELCv3 Error Handling The ELCv3 is considered malformed and must be disregarded if its length is other than zero. If more than one instance of the ELCv3 is included in an NHC, instances beyond the first MUST be disregarded.

Legacy ELC The ELCv3 functionality introduced in this document replaces the "BGP Entropy Label Capability Attribute" (ELC attribute) that was introduced by , and deprecated by . The latter RFC specifies that the ELC attribute, BGP path attribute 28, "MUST be treated as any other unrecognized optional, transitive attribute". This specification revises that requirement. As the current specification was developed, it became clear that due to incompatibilities between how the ELC attribute is processed by different fielded implementations, the most prudent handling of attribute 28 is not to propagate it as an unrecognized optional, transitive attribute, but to discard it. Therefore, this specification updates by instead requiring that an implementation that receives the ELC attribute MUST discard any received ELC attribute.

Value	Description	Reference	Change Controller
1	ELCv3	(this doc)	IETF

Value

Description

Reference

Change Controller

ELCv3

(this doc)

IETF

Security Considerations Insertion of an ELCv3 by an attacker could cause forwarding to fail. Deletion of an ELCv3 by an attacker could cause one path in the network to be overutilized and another to be underutilized. However, we note that an attacker able to accomplish either of these (below, an "on-path attacker") could equally insert or remove any other BGP path attribute or message. The former attack described above denies service for a given route, which can be accomplished by an on-path attacker in any number of ways, even absent ELCv3. The latter attack defeats an optimization but nothing more; it seems dubious that an attacker would go to the trouble of doing so rather than launching some more damaging attack.