<?xml version='1.0' encoding='utf-8'?>
<!DOCTYPE rfc [
  <!ENTITY nbsp    "&#160;">
  <!ENTITY zwsp   "&#8203;">
  <!ENTITY nbhy   "&#8209;">
  <!ENTITY wj     "&#8288;">
]>
<?xml-stylesheet type='text/xsl' href='rfc2629.xslt' ?>
<?rfc strict="yes" ?>
<!-- ><?rfc toc="no"?> -->
<?rfc tocdepth="4"?>
<?rfc symrefs="yes"?>
<?rfc sortrefs="yes" ?>
<?rfc compact="yes" ?>
<?rfc subcompact="no" ?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" category="std" docName="draft-scudder-idr-entropy-label-01" ipr="trust200902" obsoletes="" updates="" submissionType="IETF" xml:lang="en" tocDepth="4" symRefs="true" sortRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.14.0 -->
  <front>
    <title abbrev="ELCv3">BGP Entropy Label Capability, Version 3</title>
    <seriesInfo name="Internet-Draft" value="draft-scudder-idr-entropy-label-01"/>
    <author fullname="John G. Scudder" initials="J. G." surname="Scudder" role="editor">
      <organization>Juniper Networks</organization>
      <address>
        <email>jgs@juniper.net</email>
      </address>
    </author>
    <author fullname="Kireeti Kompella" initials="K." surname="Kompella">
      <organization>Juniper Networks</organization>
      <address>
        <email>kireeti@juniper.net</email>
      </address>
    </author>
    <author fullname="Satya Mohanty" initials="S." surname="Mohanty">
      <organization>Cisco Systems</organization>
      <address>
        <email>satyamoh@cisco.com</email>
      </address>
    </author>
    <author fullname="James Uttaro" initials="J." surname="Uttaro">
      <organization>AT&amp;T</organization>
      <address>
        <email>ju1738@att.com</email>
      </address>
    </author>
    <author fullname="Bin Wen" initials="B." surname="Wen">
      <organization>Comcast</organization>
      <address>
        <email>Bin_Wen@comcast.com</email>
      </address>
    </author>
    <date/>
    <area>General</area>
    <workgroup>Internet Engineering Task Force</workgroup>
    <keyword>BGP</keyword>
    <keyword>MPLS</keyword>
    <abstract>
      <t>
This specification defines the Entropy Label Capability Attribute
version 3 (ELCv3), a BGP attribute that can be used to inform an
LSP ingress router about an LSP egress router's ability to 
process entropy labels. This version of the attribute corrects
a specification error in the first version, and an improper code
point reuse in the second.
      </t>
    </abstract>
  </front>
  <middle>
    <section anchor="intro" numbered="true" toc="default">
      <name>Introduction</name>
      <t>
<xref target="RFC6790" format="default"/> defines the Entropy Label Capability attribute
(ELC), an optional, transitive BGP path attribute. For correct
operation, it is necessary that any intermediate node modifying the next
hop of a route must remove the ELC unless the node so doing is able to
process entropy labels. Sadly, these requirements cannot be fulfilled
with the ELC as specified, because it is an optional, transitive
attribute: by definition, a node that does not support the ELC will
propagate the attribute. But such a node might be exactly the one that
we desire to remove it. For this reason, <xref target="RFC7447" format="default"/>
deprecated the attribute.
      </t>
      <t>
Roughly concurrently with the development and advancement of RFC 7447,
Juniper Networks began shipping routing code that implements what is
documented in <xref target="I-D.scudder-bgp-entropy-label" format="default"/> and dubbed
Entropy Label Capability version 2 (ELCv2). That implementation uses the
code point that was assigned by RFC 6790 and deprecated by RFC 7447. At
time of writing, the functionality is in use in operational networks.
      </t>
      <t>
The present specification is based on ELCv2 but moves to a new, previously
unallocated, code point.
      </t>
      <t>
A related solution to the problem of signaling entropy label capability
is <xref target="I-D.ietf-idr-next-hop-capability" format="default"/>. That specification
is based on an optional, non-transitive path attribute. In contrast,
ELCv3 (and ELCv2) is based on an optional, transitive path attribute.
This expands the deployment options available -- in many cases (for
example, route reflectors) it's fine that an intermediate node does
propagate an ELCv3 even if it doesn't itself have the ability to process
entropy labels. 
      </t>
      <t>
In order to prevent use of the signaled information beyond the intended
perimeter (the problem that led to the deprecation of ELC, and which is
inherently solved by <xref target="I-D.ietf-idr-next-hop-capability" format="default"/>'s
use of a non-transitive attribute), in this specification we take the
approach of carrying a copy of the next hop information in the ELCv3.
This allows the node processing it to know if it can rely on the
information carried therein, while still allowing it to be propagated by
all intermediate nodes.
      </t>
      <section numbered="true" toc="default">
        <name>Requirements Language</name>
        <t>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 <xref target="RFC2119" format="default">BCP 14</xref> <xref target="RFC8174" format="default"/> when, and only when, they appear in all
		capitals, as shown here.</t>
      </section>
    </section>
    <section anchor="ELCv3" numbered="true" toc="default">
      <name>Entropy Label Capability Path Attribute, Version 3</name>
      <t>
The Entropy Label Capability Path Attribute, Version 3 (ELCv3) is an
optional, transitive BGP attribute with type code TBD1. The ELCv3 has as
its data a network layer address, representing the next hop of the route
the ELCv3 accompanies. The ELCv3 signals a useful optimization, so it is
desirable to make it transitive; the next hop data is to ensure
correctness if it traverses BGP speakers that do not understand the ELCv3.   
      </t>
      <t>
The Attribute Data field of the ELCv3 path attribute is encoded as
shown below:
      </t>
      <artwork align="left" name="" type="" alt=""><![CDATA[
   +---------------------------------------------------------+
   | Address Family Identifier (2 octets)                    |
   +---------------------------------------------------------+
   | Subsequent Address Family Identifier (1 octet)          |
   +---------------------------------------------------------+
   | Length of Next Hop Network Address (1 octet)            |
   +---------------------------------------------------------+
   | Network Address of Next Hop (variable)                  |
   +---------------------------------------------------------+
			]]></artwork>
      <t>
The meanings of the fields are as given in Section 3 of <xref target="RFC4760" format="default"/>.
      </t>
      <t>
When BGP <xref target="RFC4271" format="default"/> is used for distributing labeled
Network Layer Reachability Information (NLRI) as described in, for
example, <xref target="RFC8277" format="default"/>, the route may include the ELCv3 as
part of the Path Attributes.  The inclusion of this attribute with a
route indicates that the egress of the associated Label Switched Path
(LSP) can process entropy labels as an egress Label Switched Router
(LSR) for that route -- see <xref target="RFC6790" section="4.2" format="default"/>. 
Below, we refer to this for brevity as being "EL-capable."
      </t>
      <section anchor="sending" numbered="true" toc="default">
        <name>Sending the ELCv3</name>
        <t>
When a BGP speaker S has a route R it wishes to advertise with next hop
N to its peer, it MUST NOT include the ELCv3 attribute except if it
knows that the egress of the associated LSP L is EL-capable.
Specifically, this will be true if S:
        </t>
        <ul spacing="normal">
          <li>
	Is itself the egress, and knows itself to be EL-capable, or
		</li>
          <li>
	Is re-advertising a BGP route it received with a valid
	ELCv3 attribute, and is not changing the value of N, or
		</li>
          <li>
	Is re-advertising a BGP route it received with a valid ELCv3
	attribute, and is changing the value of N, and knows (for example,
	through configuration) that the router represented by N is either
	the LSP egress and is EL-capable, or that it will process the
	outer label(s) without processing the entropy label below, as 
	with a transit LSR, or
		</li>
          <li>
	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 LDP
	ELC TLV, <xref target="RFC6790" section="5.1" format="default"/>).
		</li>
        </ul>
        <t>
In any event, when sending an ELCv3, S MUST set the data portion of the
ELCv3 to be equal to N, using the encoding given in <xref target="ELCv3" format="default"/>.
        </t>
        <t>
The ELCv3 MAY be advertised with routes that are labeled,
such as those using SAFI 4 <xref target="RFC8277" format="default"/>. It MUST NOT
be advertised with unlabeled routes.
        </t>
        <t>
We note that due to the nature of BGP optional transitive path attributes,
any BGP speaker that does not implement this specification will propagate
the ELCv3, the requirements of this section notwithstanding. However,
such a speaker will not update the data part of the ELCv3.
        </t>
      </section>
      <section anchor="receiving" numbered="true" toc="default">
        <name>Receiving the ELCv3</name>
        <t>
When a BGP speaker receives an unlabeled route that includes the ELCv3,
it MUST discard the ELCv3.
        </t>
        <t>
When a BGP speaker receives a labeled route that includes the ELCv3, it
MUST compare the address given in the ELCv3's data portion to the next
hop of the route. If the two are equal, the egress of the LSP supports
entropy labels, which implies that the receiving BGP speaker, if acting
as ingress, MAY insert an entropy label below the advertised label, as
per <xref target="RFC6790" section="4.2" format="default"/>. If the two are not equal,
either some intermediate router that does not implement this
specification modified the next hop, or some router on the path had an
incorrect implementation. In either case, the action taken is the same:
the ELCv3 MUST be discarded. The Partial bit MAY be inspected -- if it
is equal to zero, then the mismatch must have been caused by an
incorrect implementation, and the error MAY be logged.
        </t>
        <t>
When a BGP speaker receives a route that includes an ELCv3 whose
Attribute Length is less than 4, whose Attribute Length is not greater
than or equal to 4 plus the value encoded in the Length of Next Hop
Network Address carried in the Attribute Data, or whose Attribute Data
is otherwise inconsistent with the encoding specified in <xref target="ELCv3" format="default"/>, it MUST discard the ELCv3.
        </t>
        <t>
If an ELCv3 includes data beyond the Network Address of Next Hop field,
such data MUST be disregarded. If the ELCv3 is propagated, the unknown
data MUST be included with it.
        </t>
      </section>
    </section>
    <section anchor="iana" numbered="true" toc="default">
      <name>IANA Considerations</name>
      <t>
IANA is requested to make a new allocation in the BGP Path Attributes
registry:
      </t>
      <ul spacing="normal">
        <li>Value = TBD1</li>
        <li>Code = ELCv3</li>
        <li>Reference = (this document)</li>
      </ul>
    </section>
    <section numbered="true" toc="default">
      <name>Security Considerations</name>
      <t>
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.
      </t>
      <t>
The Attribute Data portion of the ELCv3 contains the next hop the
attribute's originator included when sending it. This will typically be
an IP address of the router in question. This may be an infrastructure
address the network operator does not intend to announce beyond the
border of its Autonomous System, and it may even be considered in some
weak sense, confidential information. Although the desired operation of
the protocol is for the attribute's propagation scope to be limited to
the network operator's own Autonomous System, it will not always be so
-- indeed, that is the reason this specification had to be written. So,
sometimes this information could leak beyond its intended scope. (Note
that it will only propagate as far as the first router that does support
this specification, at which point it will be discarded per <xref target="receiving" format="default"/>.)
      </t>
    </section>
  </middle>
  <back>
    <references>
      <name>References</name>
      <references>
        <name>Normative References</name>
        <reference anchor="RFC2119" target="https://www.rfc-editor.org/info/rfc2119" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.2119.xml">
          <front>
            <title>Key words for use in RFCs to Indicate Requirement Levels</title>
            <author fullname="S. Bradner" initials="S" surname="Bradner"/>
            <date month="March" year="1997"/>
            <abstract>
              <t>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.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="2119"/>
          <seriesInfo name="DOI" value="10.17487/RFC2119"/>
        </reference>
        <reference anchor="RFC4271" target="https://www.rfc-editor.org/info/rfc4271" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4271.xml">
          <front>
            <title>A Border Gateway Protocol 4 (BGP-4)</title>
            <author fullname="Y. Rekhter" initials="Y" role="editor" surname="Rekhter"/>
            <author fullname="T. Li" initials="T" role="editor" surname="Li"/>
            <author fullname="S. Hares" initials="S" role="editor" surname="Hares"/>
            <date month="January" year="2006"/>
            <abstract>
              <t>This document discusses the Border Gateway Protocol (BGP), which is an inter-Autonomous System routing protocol.</t>
              <t>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.</t>
              <t>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.</t>
              <t>This document obsoletes RFC 1771. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4271"/>
          <seriesInfo name="DOI" value="10.17487/RFC4271"/>
        </reference>
        <reference anchor="RFC4760" target="https://www.rfc-editor.org/info/rfc4760" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4760.xml">
          <front>
            <title>Multiprotocol Extensions for BGP-4</title>
            <author fullname="T. Bates" initials="T" surname="Bates"/>
            <author fullname="R. Chandra" initials="R" surname="Chandra"/>
            <author fullname="D. Katz" initials="D" surname="Katz"/>
            <author fullname="Y. Rekhter" initials="Y" surname="Rekhter"/>
            <date month="January" year="2007"/>
            <abstract>
              <t>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]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4760"/>
          <seriesInfo name="DOI" value="10.17487/RFC4760"/>
        </reference>
        <reference anchor="RFC6790" target="https://www.rfc-editor.org/info/rfc6790" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.6790.xml">
          <front>
            <title>The Use of Entropy Labels in MPLS Forwarding</title>
            <author fullname="K. Kompella" initials="K" surname="Kompella"/>
            <author fullname="J. Drake" initials="J" surname="Drake"/>
            <author fullname="S. Amante" initials="S" surname="Amante"/>
            <author fullname="W. Henderickx" initials="W" surname="Henderickx"/>
            <author fullname="L. Yong" initials="L" surname="Yong"/>
            <date month="November" year="2012"/>
            <abstract>
              <t>Load balancing is a powerful tool for engineering traffic across a network.  This memo suggests ways of improving load balancing across MPLS networks using the concept of "entropy labels".  It defines the concept, describes why entropy labels are useful, enumerates properties of entropy labels that allow maximal benefit, and shows how they can be signaled and used for various applications.  This document updates RFCs 3031, 3107, 3209, and 5036. [STANDARDS-TRACK]</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="6790"/>
          <seriesInfo name="DOI" value="10.17487/RFC6790"/>
        </reference>
        <reference anchor="RFC8174" target="https://www.rfc-editor.org/info/rfc8174" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8174.xml">
          <front>
            <title>Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words</title>
            <author fullname="B. Leiba" initials="B" surname="Leiba"/>
            <date month="May" year="2017"/>
            <abstract>
              <t>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.</t>
            </abstract>
          </front>
          <seriesInfo name="BCP" value="14"/>
          <seriesInfo name="RFC" value="8174"/>
          <seriesInfo name="DOI" value="10.17487/RFC8174"/>
        </reference>
      </references>
      <references>
        <name>Informative References</name>
        <reference anchor="RFC4272" target="https://www.rfc-editor.org/info/rfc4272" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.4272.xml">
          <front>
            <title>BGP Security Vulnerabilities Analysis</title>
            <author fullname="S. Murphy" initials="S" surname="Murphy"/>
            <date month="January" year="2006"/>
            <abstract>
              <t>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.</t>
              <t>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.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="4272"/>
          <seriesInfo name="DOI" value="10.17487/RFC4272"/>
        </reference>
        <reference anchor="RFC7447" target="https://www.rfc-editor.org/info/rfc7447" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.7447.xml">
          <front>
            <title>Deprecation of BGP Entropy Label Capability Attribute</title>
            <author fullname="J. Scudder" initials="J" surname="Scudder"/>
            <author fullname="K. Kompella" initials="K" surname="Kompella"/>
            <date month="February" year="2015"/>
            <abstract>
              <t>The BGP Entropy Label Capability attribute is defined in RFC 6790.  Regrettably, it has a bug: although RFC 6790 mandates that routers incapable of processing Entropy Labels must remove the attribute, fulfillment of this requirement cannot be guaranteed in practice.  This specification deprecates the attribute.  A forthcoming document will propose a replacement.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="7447"/>
          <seriesInfo name="DOI" value="10.17487/RFC7447"/>
        </reference>
        <reference anchor="RFC8277" target="https://www.rfc-editor.org/info/rfc8277" xml:base="https://bib.ietf.org/public/rfc/bibxml/reference.RFC.8277.xml">
          <front>
            <title>Using BGP to Bind MPLS Labels to Address Prefixes</title>
            <author fullname="E. Rosen" initials="E" surname="Rosen"/>
            <date month="October" year="2017"/>
            <abstract>
              <t>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.</t>
            </abstract>
          </front>
          <seriesInfo name="RFC" value="8277"/>
          <seriesInfo name="DOI" value="10.17487/RFC8277"/>
        </reference>
        <reference anchor="I-D.ietf-idr-next-hop-capability" target="https://www.ietf.org/archive/id/draft-ietf-idr-next-hop-capability-08.txt" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.ietf-idr-next-hop-capability.xml">
          <front>
            <title>BGP Next-Hop dependent capabilities</title>
            <author fullname="Bruno Decraene">
              <organization>Orange</organization>
            </author>
            <author fullname="Kireeti Kompella">
              <organization>Juniper Networks, Inc.</organization>
            </author>
            <author fullname="Wim Henderickx">
              <organization>Nokia</organization>
            </author>
            <date day="8" month="June" year="2022"/>
            <abstract>
              <t>RFC 5492 advertises the capabilities of the BGP peer. When the BGP peer is not the same as the BGP Next-Hop, it is useful to also be able to advertise the capability of the BGP Next-Hop, in particular to advertise forwarding plane features. This document defines a mechanism to advertise such BGP Next Hop dependent Capabilities. This document defines a new BGP non-transitive attribute to carry Next-Hop Capabilities. This attribute is guaranteed to be deleted or updated when the BGP Next Hop is changed, in order to reflect the capabilities of the new BGP Next-Hop. This document also defines a Next-Hop capability to advertise the ability to process the MPLS Entropy Label as an egress LSR for all NLRI advertised in the BGP UPDATE. It updates RFC 6790 with regard to this BGP signaling.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-ietf-idr-next-hop-capability-08"/>
        </reference>
        <reference anchor="I-D.scudder-bgp-entropy-label" target="https://www.ietf.org/archive/id/draft-scudder-bgp-entropy-label-00.txt" xml:base="https://bib.ietf.org/public/rfc/bibxml3/reference.I-D.scudder-bgp-entropy-label.xml">
          <front>
            <title>BGP Entropy Label Capability, Version 2</title>
            <author fullname="John G. Scudder">
              <organization>Juniper Networks</organization>
            </author>
            <author fullname="Kireeti Kompella">
              <organization>Juniper Networks</organization>
            </author>
            <date day="28" month="April" year="2022"/>
            <abstract>
              <t>RFC 6790 defined the Entropy Label Capability Attribute (ELC); RFC 7447 deprecated that attribute. This specification, dubbed "Entropy Label Capability Attribute version 2" (ELCv2), was intended to be offered for standardization, to replace the ELC as a way to signal that a BGP protocol speaker is capable of processing entropy labels. Although ultimately a different specification was chosen for that purpose, at least one implementation of ELCv2 was shipped by Juniper Networks and is currently in use in service provider networks. This document is published in order to document what was implemented.</t>
            </abstract>
          </front>
          <seriesInfo name="Internet-Draft" value="draft-scudder-bgp-entropy-label-00"/>
        </reference>
      </references>
    </references>
    <section numbered="true" toc="default">
      <name>Other Means of Signaling EL Capability</name>
      <t>
A router that supports this specification could also have other means to
know that an egress is EL-capable, for example it could support <xref target="I-D.scudder-bgp-entropy-label" format="default">ELCv2</xref>, or it could know
through configuration. If a router learns through any means that an
egress is EL-capable, it MAY treat the egress as EL-capable. For
example, reception of a valid ELCv2 would be sufficient (even if a valid
ELCv3 is not received), and similarly reception of a valid ELCv3 would
be sufficient (even if a valid ELCv2 is not received). The details of
which methods are accepted for signaling EL capability are beyond the
scope of this specification, but SHOULD be configurable by the user.
      </t>
      <section numbered="true" toc="default">
        <name>Backward Compatibility with ELCv2</name>
        <t>
As was noted in <xref target="intro" format="default"/>, there are networks in which
ELCv2 (documented in <xref target="I-D.scudder-bgp-entropy-label" format="default"/>) is
already in use. 
        </t>
        <t>
Any node that sends the ELCv2 format may also include an ELCv3
per <xref target="sending" format="default"/>, so that both formats are sent. The 
exact set of formats to send SHOULD be user-configurable.
        </t>
        <t>
As discussed above, a route received with either a valid ELCv2 or ELCv3 
may be considered EL-capable.
        </t>
      </section>
    </section>
    <section anchor="Contributors" numbered="true" toc="default">
      <name>Contributors</name>
      <contact fullname="Serge Krier" initials="S" surname="Krier">
        <!-- https://authors.ietf.org/en/rfcxml-vocabulary#contact-->
	<!-- including contact information for contributors is optional -->
	<organization>Cisco Systems</organization>
        <address>
          <email>sekrier@cisco.com</email>
        </address>
      </contact>
    </section>
    <section numbered="true" toc="default">
      <name>Acknowledgements</name>
      <t>
Thanks to Swadesh Agrawal, Alia Atlas, Bruno Decraene, Martin Djernaes, John Drake,
Adrian Farrell, Keyur Patel, Toby Rees, and Ravi Singh, for
their discussion of this issue. Particular thanks to Kevin Wang for his
many valuable contributions.
      </t>
    </section>
  </back>
</rfc>
