<?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" ?>
<!-- generated by https://github.com/cabo/kramdown-rfc2629 version 1.5.16 -->
<?rfc toc="yes"?>
<?rfc sortrefs="yes"?>
<?rfc symrefs="yes"?>
<rfc xmlns:xi="http://www.w3.org/2001/XInclude" ipr="trust200902" docName="draft-irtf-panrg-questions-11" category="info" obsoletes="" updates="" submissionType="IETF" xml:lang="en" tocInclude="true" sortRefs="true" symRefs="true" version="3">
  <!-- xml2rfc v2v3 conversion 3.11.1 -->
  <front>
    <title abbrev="PAN questions">Current Open Questions in Path Aware Networking</title>
    <seriesInfo name="Internet-Draft" value="draft-irtf-panrg-questions-11"/>
    <author initials="B." surname="Trammell" fullname="Brian Trammell">
      <organization>Google Switzerland GmbH</organization>
      <address>
        <postal>
          <street>Gustav-Gull-Platz 1</street>
          <city>8004 Zurich</city>
          <country>Switzerland</country>
        </postal>
        <email>ietf@trammell.ch</email>
      </address>
    </author>
    <date year="2021" month="November" day="11"/>
    <workgroup>Path Aware Networking RG</workgroup>
    <keyword>Internet-Draft</keyword>
    <abstract>
      <t>In contrast to the present Internet architecture, a path-aware internetworking
architecture has two important properties: it exposes the properties of
available Internet paths to endpoints, and provides for endpoints and
applications to use these properties to select paths through the Internet for
their traffic. While this property of "path awareness" already exists in many
Internet-connected networks within single domains and via administrative
interfaces to the network layer, a fully path-aware internetwork expands these
concepts across layers and across the Internet.</t>
      <t>This document poses questions in path-aware networking open as of 2021, that
must be answered in the design, development, and deployment of path-aware
internetworks. It was originally written to frame discussions in the Path Aware
Networking proposed Research Group (PANRG), and has been published to snapshot
current thinking in this space.</t>
    </abstract>
    <note removeInRFC="true">
      <name>Discussion Venues</name>
      <t>Source for this draft and an issue tracker can be found at
  <eref target="https://github.com/panrg/questions"/>.</t>
    </note>
  </front>
  <middle>
    <section anchor="intro" numbered="true" toc="default">
      <name>Introduction to Path-Aware Networking</name>
      <t>In the current Internet architecture, the network layer provides an
unverifiable, best-effort service to the endpoints using it. While there are
technologies that attempt better-than-best-effort delivery, the interfaces to
these are generally administrative as opposed to endpoint-exposed (e.g. Path 
Computation Element (PCE) <xref target="RFC4655" format="default"/> and Software-Defined Wide Area Network 
(SD-WAN) approaches), and they are often restricted to single
administrative domains. In this environment, an application can assume that a
packet with a given destination address will eventually be forwarded toward that
destination, but little else.</t>
      <t>A transport layer protocol such as TCP can provide reliability over this
best-effort service, and a protocol above the network layer such as IPsec 
Authentication Header (AH) <xref target="RFC4302" format="default"/> or Transport Layer Security (TLS)
<xref target="RFC8446" format="default"/> can authenticate the remote endpoint. However,
little, if any, explicit information about the path is available to the
endpoint, and assumptions about that path often do not hold, sometimes with
serious impacts on the application, as in the case with BGP hijacking attacks.</t>
      <t>By contrast, in a path-aware internetworking architecture, endpoints have the
ability to select or influence the path through the network used by any given
packet or flow. The network and transport layers explicitly expose information
about the path or paths available from one endpoint to another, and to those
endpoints and the applications running on them, so that they can make this
selection. The Application Layer Traffic Optimization (ALTO) protocol <xref target="RFC7285" format="default"/>
can be seen as an example of a path-awareness approach implemented in 
transport-layer terms on the present Internet protocol stack.</t>
      <t>Path selection provides explicit visibility and control of network treatment to
applications and users of the network. This selection is available to the
application, transport, and/or network layer entities at each endpoint. Path
control at the flow and subflow level enables the design of new transport
protocols that can leverage multipath connectivity across disjoint paths through
the Internet, even over a single physical interface.  When exposed to
applications, or to end-users through a system configuration interface, path
control allows the specification of constraints on the paths that traffic should
traverse, for instance to confound passive surveillance in the network core
<xref target="RFC7624" format="default"/>.</t>
      <t>We note that this property of "path awareness" already exists in many
Internet-connected networks within single domains. Indeed, much of the practice
of network engineering using encapsulation at layer 3 can be said to be "path
aware", in that it explicitly assigns traffic at tunnel endpoints to a given
path within the network. Path-aware internetworking seeks to extend this
awareness across domain boundaries without resorting to overlays, except as a
transition technology.</t>
      <t>This document presents a snapshot of open questions in this space that will need
to be answered in order to realize a path-aware internetworking architecture; it
is published to further frame discussions within and outside the Path Aware
Networking Research Group, and is published with the rough consensus of that
group.</t>
      <section anchor="definition" numbered="true" toc="default">
        <name>Definition</name>
        <t>For purposes of this document, "path aware networking" describes endpoint
discovery of the properties of paths they use for communication across an
internetwork, and endpoint  reaction to these properties that affects routing
and/or data transfer. Note that this can and already does happen to some extent
in the current Internet architecture; this definition expands current techniques
of path discovery and manipulation to cross administrative domain boundaries and
up to the transport and application layers at the endpoints.</t>
        <t>Expanding on this definition, a "path aware internetwork" is one in which
endpoint discovery of path properties and endpoint selection of paths used by
traffic exchanged by the endpoint are explicitly supported, regardless of the
specific design of the protocol features which enable this discovery and
selection.</t>
        <t>A "path", for the purposes of these definitions, is abstractly defined as a
sequence of adjacent path elements over which a packet can be transmitted,
where the definition of "path element" is technology-dependent. As this document
is intended to pose questions rather than answer them, it assumes that this
definition will be refined as part of the answer the first two questions it
poses, about the vocabulary of path properties and how they are disseminated.</t>
        <t>Research into path aware networking covers any and all aspects of
designing, building, and operating path aware internetworks or the networks
and endpoints attached to them. This document presents a collection of
research questions to address in order to make a path aware Internet a
reality.</t>
      </section>
    </section>
    <section anchor="questions" numbered="true" toc="default">
      <name>Questions</name>
      <t>Realizing path-aware networking requires answers to a set of open research
questions. This document poses these questions, as a starting point for
discussions about how to realize path awareness in the Internet, and to direct
future research efforts within the Path Aware Networking Research Group.</t>
      <section anchor="a-vocabulary-of-path-properties" numbered="true" toc="default">
        <name>A Vocabulary of Path Properties</name>
        <t>The first question: how are paths and path properties defined and represented?</t>
        <t>In order for information about paths to be exposed to an endpoint, and for the
endpoint to make use of that information, it is necessary to define a common
vocabulary for paths through an internetwork, and properties of those paths. The
elements of this vocabulary could include terminology for components of a path
and properties defined for these components, for the entire path, or for
subpaths of a path. These properties may be relatively static, such as the
presence of a given node or service function on the path; as well as relatively
dynamic, such as the current values of metrics such as loss and latency.</t>
        <t>This vocabulary must be defined carefully, as its design will have impacts on
the expressiveness of a given path-aware internetworking architecture. This
expressiveness also exhibits tradeoffs. For example, a system that exposes
node-level information for the topology through each network would maximize
information about the individual components of the path at the endpoints, at
the expense of making internal network topology universally public, which may
be in conflict with the business goals of each network's operator. Furthermore,
properties related to individual components of the path may change frequently
and may quickly become outdated. However, aggregating the properties of
individual components to distill end-to-end properties for the entire path is
not trivial.</t>
      </section>
      <section anchor="discovery-distribution-and-trustworthiness-of-path-properties" numbered="true" toc="default">
        <name>Discovery, Distribution, and Trustworthiness of Path Properties</name>
        <t>The second question: how do endpoints and applications get access to accurate,
useful, and trustworthy path properties?</t>
        <t>Once endpoints and networks have a shared vocabulary for expressing path
properties, the network must have some method for distributing those path
properties to the endpoint. Regardless of how path property information is
distributed to the endpoints, the endpoints require a method to authenticate
the properties -- to determine that they originated from and pertain to the
path that they purport to.</t>
        <t>Choices in distribution and authentication methods will have impacts on the
scalability of a path-aware architecture. Possible dimensions in the space of
distribution methods include in-band versus out-of-band, push versus pull
versus publish-subscribe, and so on. There are temporal issues with path
property dissemination as well, especially with dynamic properties, since the
measurement or elicitation of dynamic properties may be outdated by the time
that information is available at the endpoints, and interactions between the
measurement and dissemination delay may exhibit pathological behavior for
unlucky points in the parameter space.</t>
      </section>
      <section anchor="supporting-path-selection" numbered="true" toc="default">
        <name>Supporting Path Selection</name>
        <t>The third question: how can endpoints select paths to use for traffic in a way
that can be trusted by the network, the endpoints, and the applications using them?</t>
        <t>Access to trustworthy path properties is only half of the challenge in
establishing a path-aware architecture. Endpoints must be able to use this
information in order to select paths for specific traffic they send. As with the
dissemination of path properties, choices made in path selection methods will
also have an impact on the tradeoff between scalability and expressiveness of a
path-aware architecture. One key choice here is between in-band and
out-of-band control of path selection. Another is granularity of path selection
(whether per packet, per flow, or per larger aggregate), which also has a large
impact on the scalabilty/expressiveness tradeoff. Path selection must, like
path property information, be trustworthy, such that the result of a path
selection at an endpoint is predictable. Moreover, any path selection mechanism
should aim to provide an outcome that is not worse than using a single path, or
selecting paths at random.</t>
        <t>Path selection may be exposed in terms of the properties of the path or the identity
of elements of the path. In the latter case, a path may be identified at any of
multiple layers (e.g. routing domain identifier, network layer address, higher-layer
identifier or name, and so on). In this case, care must be taken to present
semantically useful information to those making decisions about which path(s)
to trust.</t>
      </section>
      <section anchor="interfaces-for-path-awareness" numbered="true" toc="default">
        <name>Interfaces for Path Awareness</name>
        <t>The fourth question: how can interfaces among the network, transport, and
application layers support the use of path awareness?</t>
        <t>In order for applications to make effective use of a path-aware networking
architecture, the control interfaces presented by the network and transport
layers must also expose path properties to the application in a useful way, and
provide a useful set of paths among which the application can select. Path
selection must be possible based not only on the preferences and policies of the
application developer, but of end-users as well. Also, the path selection
interfaces presented to applications and end users will need to support multiple
levels of granularity. Most applications' requirements can be satisfied with the
expression of path selection policies in terms of properties of the paths, while
some applications may need finer-grained, per-path control. These interfaces
will need to support incremental development and deployment of applications, and
provide sensible defaults, to avoid hindering their adoption.</t>
      </section>
      <section anchor="implications-of-path-awareness-for-the-transport-and-application-layers" numbered="true" toc="default">
        <name>Implications of Path Awareness for the Transport and Application Layers</name>
        <t>The fifth question: how should transport-layer and higher layer protocols be
redesigned to work most effectively over a path-aware networking layer?</t>
        <t>In the current Internet, the basic assumption that at a given time all
traffic for a given flow will receive the same network treatment and traverse
the same path or equivalend paths often holds. In a path aware network,
this assumption is more easily violated. The weakening of this assumption
has implications for the design of protocols above any path-aware network layer.</t>
        <t>For example, one advantage of multipath communication is that a given
end-to-end flow can be "sprayed" along multiple paths in order to confound
attempts to collect data or metadata from those flows for pervasive
surveillance purposes <xref target="RFC7624" format="default"/>. However, the benefits of this approach are
reduced if the upper-layer protocols use linkable identifiers on packets
belonging to the same flow across different paths. Clients may mitigate
linkability by opting to not re-use cleartext connection identifiers, such as
TLS session IDs or tickets, on separate paths. The privacy-conscious
strategies required for effective privacy in a path-aware Internet are only
possible if higher-layer protocols such as TLS permit clients to obtain
unlinkable identifiers.</t>
      </section>
      <section anchor="what-is-an-endpoint" numbered="true" toc="default">
        <name>What is an Endpoint?</name>
        <t>The sixth question: how is path awareness (in terms of vocabulary and
interfaces) different when applied to tunnel and overlay endpoints?</t>
        <t>The vision of path-aware networking articulated so far makes an assumption
that path properties will be disseminated to endpoints on which applications
are running (terminals with user agents, servers, and so on). However,
incremental deployment may require that a path-aware network "core" be used to
interconnect islands of legacy protocol networks. In these cases, it is the
gateways, not the application endpoints, that receive path properties and make
path selections for that traffic. The interfaces provided by this gateway are
necessarily different than those a path-aware networking layer provides to its
transport and application layers, and the path property information the
gateway needs and makes available over those interfaces may also be different.</t>
      </section>
      <section anchor="operating-a-path-aware-network" numbered="true" toc="default">
        <name>Operating a Path Aware Network</name>
        <t>The seventh question: how can a path aware network in a path aware internetwork
be effectively operated, given control inputs from network administrators,
application designers, and end users?</t>
        <t>The network operations model in the current Internet architecture assumes that
traffic flows are controlled by the decisions and policies made by network
operators, as expressed in interdomain and intradomain routing protocols. In
a network providing path selection to the endpoints, however, this assumption
no longer holds, as endpoints may react to path properties by selecting
alternate paths. Competing control inputs from path-aware endpoints and the routing
control plane may lead to more difficult traffic engineering or nonconvergent
forwarding, especially if the endpoints' and operators' notion of the "best" path
for given traffic diverges significantly. The degree of difficulty may depend on
the fidelity of information made available to path selection algorithms at
the endpoints. Explicit path selection can also specify
outbound paths, while BGP policies are expressed in terms of inbound traffic.</t>
        <t>A concept for path aware network operations will need to have clear methods
for the resolution of apparent (if not actual) conflicts of intent between the
network's operator and the path selection at an endpoint. It will also need
set of safety principles to ensure that increasing path control does not lead
to decreasing connectivity; one such safety principle could be "the existence
of at least one path between two endpoints guarantees the selection of at
least one path between those endpoints."</t>
      </section>
      <section anchor="deploying-a-path-aware-network" numbered="true" toc="default">
        <name>Deploying a Path Aware Network</name>
        <t>The eighth question: how can the incentives of network operators and end-users
be aligned to realize the vision of path aware networking, and how can the
transition from current ("path-oblivious") to path-aware networking be managed?</t>
        <t>The vision presented in the introduction discusses path aware networking from
the point of view of the benefits accruing at the endpoints, to designers of
transport protocols and applications as well as to the end users of those
applications. However, this vision requires action not only at the endpoints but
also within the interconnected networks offering path aware connectivity. While
the specific actions required are a matter of the design and implementation of a
specific realization of a path aware protocol stack, it is clear than any path
aware architecture will require network operators to give up some control of
their networks over to endpoint-driven control inputs.</t>
        <t>Here the question of apparent versus actual conflicts of intent arises again:
certain network operations requirements may appear essential, but are merely
accidents of the interfaces provided by current routing and management
protocols. For example, related (but adjacent) to path aware networking, the
widespread use of the TCP wire image <xref target="RFC8546" format="default"/> in network monitoring for DDoS
prevention appears in conflict with the deployment of encrypted transports, only
because path signaling <xref target="RFC8558" format="default"/> has been implicit in the deployment of past
transport protocols.</t>
        <t>Similarly, incentives for deployment must show how existing network operations
requirements are met through new path selection and property dissemination
mechanisms.</t>
        <t>The incentives for network operators and equipment vendors need to be made
clear, in terms of a plan to transition <xref target="RFC8170" format="default"/> an internetwork to
path-aware operation, one network and facility at a time. This plan to
transition must also take into account that the dynamics of path aware
networking early in this transition (when few endpoints and flows in the
Internet use path selection) may be different than those later in the
transition.</t>
        <t>Aspects of data security and information management in a network that explicitly
radiates more information about the network's deployment and configuration, and
implicitly radiates information about endpoint configuration and preference
through path selection, must also be addressed.</t>
      </section>
    </section>
    <section anchor="acknowledgments" numbered="true" toc="default">
      <name>Acknowledgments</name>
      <t>Many thanks to Adrian Perrig, Jean-Pierre Smith, Mirja Kuehlewind, Olivier
Bonaventure, Martin Thomson, Shwetha Bhandari, Chris Wood, Lee Howard, Mohamed
Boucadair, Thorben Krueger, Gorry Fairhurst, Spencer Dawkins, Theresa Enghardt,
Laurent Ciavaglia, and Stephen Farrell, for discussions leading to questions
in this document, and for feedback on the document itself.</t>
      <t>This work is partially supported by the European Commission under Horizon 2020
grant agreement no. 688421 Measurement and Architecture for a Middleboxed
Internet (MAMI), and by the Swiss State Secretariat for Education, Research, and
Innovation under contract no. 15.0268. This support does not imply endorsement.</t>
    </section>
  </middle>
  <back>
    <references>
      <name>Informative References</name>
      <reference anchor="RFC4655">
        <front>
          <title>A Path Computation Element (PCE)-Based Architecture</title>
          <author fullname="A. Farrel" initials="A." surname="Farrel">
            <organization/>
          </author>
          <author fullname="J.-P. Vasseur" initials="J.-P." surname="Vasseur">
            <organization/>
          </author>
          <author fullname="J. Ash" initials="J." surname="Ash">
            <organization/>
          </author>
          <date month="August" year="2006"/>
          <abstract>
            <t>Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks.  Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domains.</t>
            <t>This document specifies the architecture for a Path Computation Element (PCE)-based model to address this problem space.  This document does not attempt to provide a detailed description of all the architectural components, but rather it describes a set of building blocks for the PCE architecture from which solutions may be constructed.  This memo provides information for the Internet community.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="4655"/>
        <seriesInfo name="DOI" value="10.17487/RFC4655"/>
      </reference>
      <reference anchor="RFC4302">
        <front>
          <title>IP Authentication Header</title>
          <author fullname="S. Kent" initials="S." surname="Kent">
            <organization/>
          </author>
          <date month="December" year="2005"/>
          <abstract>
            <t>This document describes an updated version of the IP Authentication Header (AH), which is designed to provide authentication services in IPv4 and IPv6.  This document obsoletes RFC 2402 (November 1998).  [STANDARDS-TRACK]</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="4302"/>
        <seriesInfo name="DOI" value="10.17487/RFC4302"/>
      </reference>
      <reference anchor="RFC8446">
        <front>
          <title>The Transport Layer Security (TLS) Protocol Version 1.3</title>
          <author fullname="E. Rescorla" initials="E." surname="Rescorla">
            <organization/>
          </author>
          <date month="August" year="2018"/>
          <abstract>
            <t>This document specifies version 1.3 of the Transport Layer Security (TLS) protocol.  TLS allows client/server applications to communicate over the Internet in a way that is designed to prevent eavesdropping, tampering, and message forgery.</t>
            <t>This document updates RFCs 5705 and 6066, and obsoletes RFCs 5077, 5246, and 6961.  This document also specifies new requirements for TLS 1.2 implementations.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="8446"/>
        <seriesInfo name="DOI" value="10.17487/RFC8446"/>
      </reference>
      <reference anchor="RFC7285">
        <front>
          <title>Application-Layer Traffic Optimization (ALTO) Protocol</title>
          <author fullname="R. Alimi" initials="R." role="editor" surname="Alimi">
            <organization/>
          </author>
          <author fullname="R. Penno" initials="R." role="editor" surname="Penno">
            <organization/>
          </author>
          <author fullname="Y. Yang" initials="Y." role="editor" surname="Yang">
            <organization/>
          </author>
          <author fullname="S. Kiesel" initials="S." surname="Kiesel">
            <organization/>
          </author>
          <author fullname="S. Previdi" initials="S." surname="Previdi">
            <organization/>
          </author>
          <author fullname="W. Roome" initials="W." surname="Roome">
            <organization/>
          </author>
          <author fullname="S. Shalunov" initials="S." surname="Shalunov">
            <organization/>
          </author>
          <author fullname="R. Woundy" initials="R." surname="Woundy">
            <organization/>
          </author>
          <date month="September" year="2014"/>
          <abstract>
            <t>Applications using the Internet already have access to some topology information of Internet Service Provider (ISP) networks.  For example, views to Internet routing tables at Looking Glass servers are available and can be practically downloaded to many network application clients.  What is missing is knowledge of the underlying network topologies from the point of view of ISPs.  In other words, what an ISP prefers in terms of traffic optimization -- and a way to distribute it.</t>
            <t>The Application-Layer Traffic Optimization (ALTO) services defined in this document provide network information (e.g., basic network location structure and preferences of network paths) with the goal of modifying network resource consumption patterns while maintaining or improving application performance.  The basic information of ALTO is based on abstract maps of a network.  These maps provide a simplified view, yet enough information about a network for applications to effectively utilize them.  Additional services are built on top of the maps.</t>
            <t>This document describes a protocol implementing the ALTO services. Although the ALTO services would primarily be provided by ISPs, other entities, such as content service providers, could also provide ALTO services.  Applications that could use the ALTO services are those that have a choice to which end points to connect.  Examples of such applications are peer-to-peer (P2P) and content delivery networks.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="7285"/>
        <seriesInfo name="DOI" value="10.17487/RFC7285"/>
      </reference>
      <reference anchor="RFC7624">
        <front>
          <title>Confidentiality in the Face of Pervasive Surveillance: A Threat Model and Problem Statement</title>
          <author fullname="R. Barnes" initials="R." surname="Barnes">
            <organization/>
          </author>
          <author fullname="B. Schneier" initials="B." surname="Schneier">
            <organization/>
          </author>
          <author fullname="C. Jennings" initials="C." surname="Jennings">
            <organization/>
          </author>
          <author fullname="T. Hardie" initials="T." surname="Hardie">
            <organization/>
          </author>
          <author fullname="B. Trammell" initials="B." surname="Trammell">
            <organization/>
          </author>
          <author fullname="C. Huitema" initials="C." surname="Huitema">
            <organization/>
          </author>
          <author fullname="D. Borkmann" initials="D." surname="Borkmann">
            <organization/>
          </author>
          <date month="August" year="2015"/>
          <abstract>
            <t>Since the initial revelations of pervasive surveillance in 2013, several classes of attacks on Internet communications have been discovered.  In this document, we develop a threat model that describes these attacks on Internet confidentiality.  We assume an attacker that is interested in undetected, indiscriminate eavesdropping.  The threat model is based on published, verified attacks.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="7624"/>
        <seriesInfo name="DOI" value="10.17487/RFC7624"/>
      </reference>
      <reference anchor="RFC8546">
        <front>
          <title>The Wire Image of a Network Protocol</title>
          <author fullname="B. Trammell" initials="B." surname="Trammell">
            <organization/>
          </author>
          <author fullname="M. Kuehlewind" initials="M." surname="Kuehlewind">
            <organization/>
          </author>
          <date month="April" year="2019"/>
          <abstract>
            <t>This document defines the wire image, an abstraction of the information available to an on-path non-participant in a networking protocol.  This abstraction is intended to shed light on the implications that increased encryption has for network functions that use the wire image.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="8546"/>
        <seriesInfo name="DOI" value="10.17487/RFC8546"/>
      </reference>
      <reference anchor="RFC8558">
        <front>
          <title>Transport Protocol Path Signals</title>
          <author fullname="T. Hardie" initials="T." role="editor" surname="Hardie">
            <organization/>
          </author>
          <date month="April" year="2019"/>
          <abstract>
            <t>This document discusses the nature of signals seen by on-path elements examining transport protocols, contrasting implicit and explicit signals.  For example, TCP's state machine uses a series of well-known messages that are exchanged in the clear.  Because these are visible to network elements on the path between the two nodes setting up the transport connection, they are often used as signals by those network elements.  In transports that do not exchange these messages in the clear, on-path network elements lack those signals. Often, the removal of those signals is intended by those moving the messages to confidential channels.  Where the endpoints desire that network elements along the path receive these signals, this document recommends explicit signals be used.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="8558"/>
        <seriesInfo name="DOI" value="10.17487/RFC8558"/>
      </reference>
      <reference anchor="RFC8170">
        <front>
          <title>Planning for Protocol Adoption and Subsequent Transitions</title>
          <author fullname="D. Thaler" initials="D." role="editor" surname="Thaler">
            <organization/>
          </author>
          <date month="May" year="2017"/>
          <abstract>
            <t>Over the many years since the introduction of the Internet Protocol, we have seen a number of transitions throughout the protocol stack, such as deploying a new protocol, or updating or replacing an existing protocol.  Many protocols and technologies were not designed to enable smooth transition to alternatives or to easily deploy extensions; thus, some transitions, such as the introduction of IPv6, have been difficult.  This document attempts to summarize some basic principles to enable future transitions, and it also summarizes what makes for a good transition plan.</t>
          </abstract>
        </front>
        <seriesInfo name="RFC" value="8170"/>
        <seriesInfo name="DOI" value="10.17487/RFC8170"/>
      </reference>
    </references>
  </back>
  <!-- ##markdown-source:
H4sIAFJTjWEAA71c23IbR5J9r6+ooB9MRQAcSWN7tPSDl5JlWTOWrTUV64jd
2NgodBeAGvXNXd2E4An/+57MrFsDoGee9sEzpICuS15Onrw01+u1mtzU2Fv9
ah5H2036p8F2+j9m6yfXd167Tr83017fHcxo9Y92OvTjR9ftlNlsRvtwq9/f
/ah/jV9XdV91psVy9Wi209qN03Y9mG7crdN31s+eqdpM9lZV+N9dPx5vscu2
V8oN462extlPz58+/benzxXttRv7ebi9fAj98xv10R7xW32r33aTHTs7rb+l
rZXyk+nq/zVN3+E4R+vV4G71f099tdK+H6fRbj1+Orb0w/8oZeZp34+3Sus1
/tM4kr/VL2/0h9G0rW0a/ke528vRmW75QT/ubvWbvt81Vt8f3PSbHRtsr9+0
m+/5C7Y1rsFF7bT99yk8eVPt+TOPw9gJz+Pm5mH9Zm6a9fvGTL/pZ/x55SbI
6MXTp1/o/5pHF56q+rmbSHjFfkp1/diayT1AvIqkmn9br9fabLCXqSCdtx0W
wPPGT3rq9bS3ehitJwuIgtRmrPZustU0j3aljR6gg7VhHbjwnWQNxVf13niN
T7RrBwjaYMlh7Ac7Ts5Cpm7S9tPQe+vDrvEj3W+VeYCYzAZSTKegXT2d0Xb1
0GNjqI1EiwcfXI3HcMn8GX2kzDA0DtbFFownZ29pL7/YDf/ubYMjxx32sLTd
ng+VNsfaCv/gRtil2W5ddaN/2buGlnM+rnbEyfUVraJZOp31/kqbZrSmPuKy
zk/sSK3pjiqZKcTfYXdb6yBHr6HIPb7nIVFsUfewmY5vpB+c0aZuXedIgaRR
xSrYmkquQqcO6+jGHO1ICtvCko6PqY20gKW9SEbhOJUdSIDV2Hsvi8jm4V9K
wdwo9YEkAH+fWzIaUeivJW4U+2ZL0T3hiyFl6+dPnz9bYVkzqRamrzcW2/mD
HSETPE/7Qb9u163w/w+26QfaSrRf26Hpj7w1VspbqfKK/ka/nfSBdhvdznWG
xHEY3TThDBDaFo6IPZyvZu/jsWnbjDaqQBtSN65Z658hMLJ4/YbASV8DA39+
80QORsa/sVh/mDeN83t8nSytM4Pf95OqAsySonlR3hGS9ANUeSNu2rq6bqxS
n5G8x76eKxIqrUMHW5/B4D8+c/S939mt6fxxl0dc+cxYsjOZTs3dgx3d1pEb
rnAXP63tFo4wwV/GB1fZaG/Z6WbPV5myd0CJmsSHPfdd3/Q7djmoWhtIvx1I
2/hhXOPfunW5SW0bmPd4lGMurFyJE9Ptd/CykfW5dAs2rUHUVGDGWiCn1tf2
Zncj+lWv+naYJ4YJ/bqxbEzX71+9fqL/8Y9vfv7u1Rdfffnl77+zVu/77URS
X39rt67DOr9AWvoOHh71oNX1/bfrX+5+fKIBP2NvKpw12ASOfeRTYxVYBnB2
AoxPwTTY29XJNYLzw4CDfdjuwY19Fz1AFxinK/rde3hiELGCMX2E2glQgAM7
rNiRL03wAX7C1DVOQYjTNBq+1U0zCxMuCCXgpjUfjn4QBy0ehk3Mk27gRdC0
bTxZ7R3hY+cJ77NFIdb2jfYzHAVa+fDqPR80mBqk0MDEHNYBfkLhfE11wdxE
hiavaDb4/gUjjju9fe9tpdUdIjouFoX0PdAYX7q++z7p989Pn0O/CB8f0uF/
4JXuLTyIDnb94Yf7J0q+/uKLL77C11nYeWk5yGjbfsoecaO/7w8Q67hSIqeV
dltcA0YNQ4TeEARTdCZ1bPp5knBIlgl150Aozqbi0kEapO1BoDY+bCSSBSOr
e931k973TU2Ep7WTa62EGAXBun72FKBBBuAwghqFSa1IjgEMKwOfY0t6+ea9
3ru/w7bI3eHI+MlD+y+PiUys6Kk/ogonUJQxZG9EqSoaRQ7Q0BCk1cy2q2yW
UhmwoyHM5OObI4larD56ApbYNv0BfK74Nvvm0m59UlBzDDyl1JQ60RSWFfaQ
9bUd+xYSzcZAFzHQxZ6DcleLRrGwWrCWUxV4Pc5dxyGT9dCSGkXNjCdkh635
KFREiaTwmNzwrkAHMekPwl/A72EI7jf56Pruhw8/PcmeJYb+l+cvgHuKNgAe
eCsBG7/ZT6YdGoKxhYqJ7yTQI6MSLJUorpKA1+KlsIY2mdwZ58ywQcYF22Ko
TrfLgSr50YPzLlgMSZENEc/jjFHNoNdmYnRHCFlImB6AyYxMRwo7IiFSTE7b
XvLIhbukW7KK/wS7WGIToQXTTqjPkpgyVNANVTy2aJdtlU/n5w3/3BABwkN0
AF9QI7nnIe+vogRDuCUt0sOj2Vndzs3k2HAD+3QPLDcheCBCf2eDXRBiVfK+
FQcLwWsTieqwP3oIosnB+kaDCNhOx6h7IvcV+Y1E57WIP/oy1jx68AM639bt
5lHsNC284rNlaTWQjYjDD7YCaQk2D6ngOxRN2b2itYV7kZCDO4CUzU1NRoor
eay/ZbCh5FGIDh0EmRbyDWAuRWY/jw8WYZO/ECAy6rrqQXmCE331/Ivff4cB
/2IJiG303P+vtIGYQ20twL+lsBjse6DsDzFVFe5hO1Bji5AAqBEiB5wFXZ2b
EJxiSP+zjpBgHKMYfuTzKz7/1UrEge9LjhdhlAS3o0wsyJzkAGhje44ASBiZ
EBsSCXda+OT7x4MKQOqjJImfEPxqwcQCnIKBs2j0hvRpRhfCIQE6YAi+Qyth
DbJu3NhTsKaciNFPcMwJEY+k9nieBwmgebLkwPlJ9pz1LLKjTPpFZMzEoAbY
Yn+aCfUjMRf8O0yjcb/Zfz3Afg1VKDK5MhnZziMFowvpT5A6AQ+k4ommPZ4O
LbMgCW2LrZgzMDti3yaHtJ2fA9iCVHJtByL87DPNvJqlq9R3FFXnUVJK/m4h
4VXpMkVieUWAWI1uQ7EhmJWiu5E2j9n+i2pDwgNEUyoRkOtXfdvOXYSRYDdI
ikohy1VTeCetpATtvMzAhHy7tUS0cN+JyyUSImozGUHurR1v9I9LmGCiSVwv
IELdW2JJwyDJK3E6MXdo+F9I+74OckyCTgWAlJOSWTuyUhWEo7MA6SRAIjdE
WCBsFOlcylxKJ6OSDNLkkDVmwsWXK4hKLDlMy+wSBvKaT5q40OIaVOgoTaLU
1BUZJHExHOiwp8pZ0trCNPjxQmkL/WYWkEwm0EwVEQ04gTR2J9yzPDxnfQUU
+nmgqxMsj3aH7KoheBLjVDGEFaE92KxQoi1oDBTp5SqBDARxlHoqyCBlZiyc
K4lsvN7CtchcszCBeUR1QpkQB65DvssQ6O2vwsGJANbIA2wgC0gDmfJ5YQZy
PgIp5t4harDiWyq+1Ct14AqB8JhkkCkehuVYfRls17WF7deWSNOdX8ICgRxp
vpPEletRBeDCNvecYrJPEbIGSu2mkDn77HmqOBLD8oYSvCSHwYxT1E1eS2/d
SLXUQ1/iPOgYiXpVZHgPfWU2cKLHLW8PvpdKBtCsty2l3raGOhPo4rK9voiE
mi3Bcw4k+AGiRLY1cYlVjAvfozzeNTX/xIiPMxiOgY94k9fBguLvqvQTLwlh
iDEk3cCiL8VGmHN2KjXGS2XJER8INYoyAHLCY8oDZqxTHB0nismf5Q4GiYyC
ZrzXeUVyhFW7kWVPygxcxNscuOP5VDrf2dViPbu0Ok6iDWUyQi0EEaikXMZc
sQzWeQ7wS1YYaWZm4SGNrHHualLbmevuSYxSP/EliXqkf7II4RKJ7/R/LiyU
n3yfLJQITzT2eNNbPj6tHZJhpstLw05Ags9GG0zB1t9wzVL0K9T7tCqS6v8b
W+QTnI4uSiIB3lSZdrO5UGgPjKNcnn0fOgSbhojpsiRQPiUbaNuCixTOuk25
fkpWOn1OC5YMg/N8eYwTc5WBMvCaYoeKUhEsWTUzES/kyU6ALzKTAaEsPCs+
oE52jEIOssDW+akcACgXDbriTIwsEnmmXC6tzeddcpnWHAULGw71FM+ofEod
tVB6IwWIbkOUCLXHrseNsFWsIG/nLnh/zsy+pgUOltGq2EPVx860J5skzvJg
mllE3Voqqvr0rUaYWw1agbBQJapeCDx2HaLYKpgw90yk/DX5GIk5CnCBKpfM
OC+GQRJG0R1DII83/hcJugCJOlnHNJ5Smb3b0CEQOGvbb7cwIaLGoQqzysky
m3ZoqikS9VrKBaUzReVP/SA2Fa2YqxExFzywCbbmE9WIrLpco3SgYg+unpHx
L40ylcVOKRzOOkV5IQVg04BvSv+DhGOaXK2JBwQNpzjGdWlOKmACwixgh2rD
pI6yc3ww5VxjQyksyXDXQ4q0UXnBz30Icz349neSB7VI2leqMHO2PUGZf35V
8gkhf8inmB+BNilhy0cgpKs+cl29IroOCdYcyFN9WJvdjpig5J5n/dDL+zPy
A3kbzqDXU7+2Sxy44OmAOkUFYTjJgzNNyLoibVzRj/hoMwdKjfU+UCceQqMY
Eoz7YizwuBu+vgwGdb/syS4rmzuK1xXhLkN5VVGhB0oAVMP/QnhL2x9PgwmC
xk8EMMsdEkthR4Vz7A3lzycQHj0t0IFC78u+GGMDr8SJFtBl3wuw1klSrLII
8GrZWy7t/waBtiT7JKDySseFpxIBjVskMlX60rL3FugLLhzOSBIt+hPqxKrW
awl0El9Swgm6GZqktCkXsTm44ClK50LNMxTe4xOcSowUamFPr/a9oz4dvl0X
xiTaX/Zi5KT+Iq5KKlSZJjWHltXmE/h8D5h3lAfVDoF10cWV6gpR3vI4ce8Y
Z1233nCLHVhDtYl5Wvdb/qcV7uf38QMkvo1KP3ONY42oKTUHMVmAdijAS/dT
U6ezH6kyihwjlJsWxnIs+D3LSiLgSltOBqVhTQ+FIKhLc4URSz9EtdZ4SEPa
4bBxTjdTJfT82RjJIx7FtJV6ROqUKC2L3xegneo+hOJSBaH293SgpsHpybhv
v7huDaQ98mFCsGPhcLuY6skbC9twgaHMXTNXH486mL2LxIGKWBN1/0IDHbB2
L1k2+Scj1n3MhwWwAGjjKV5VBZ/0J4MhfaoOxXyfe1wHRKFUYuf8FpCRZZlY
4QVxnbV6pO5KSROw7S4h4x9goFQ2YB5702xjREIgQl5Fsch1CtczbKbMOR73
oNfp2mkKI3Q5ZG4GeLSwhiIdW8iJBJRKGFFSDBOggzWn7DFKq6UZnOfBK1xF
0KQ17KPyhVyKKRFEMV0S1O8CkkRiGblTMsoSWTh9PWdw6lFR/QS8/Ei9Nz6c
Zj932eAjlFANpsCRsie1vAaEIo1BWmU3mo7iVMC85TfV9WFv+ZsD/ceFlRX/
TO0hpvH0Cx7fUWsmkAr7JFKmICLKR/k7aimmKJXp+KcTgUQBhqGJQgMzdXsb
9zFEhUuxbJX8Qow4cPgYQChjnZupyGfy8lQ1zS7JhWVEc1A9Ms4b/Q6krRcC
1R3PjYMYmfOtkvaONq7lolAYPcDCUA8zMgE7z71ynJENHh+LP+YOV0iV4vkC
eeBaJbRW9+15pzJAbExZCa+k83mpEl02lJli19wwPFIhdpky2pCchUmfhsZp
Ru7RxxG9uLOssXWUdE8sJoRC6QA2NhZbZR4m1KVj7TY9CfEu25ihJrPSe7eD
MUpLV+Xv0/lpSLKIh0/yDIuckrKsBDUTMvROdMMVAUi4NUwUKPQJH1wEo9g8
j/lDDcApCyli7iSHa/9ERQyVuPA2DxMRWOWaCFl6KGz0lBRcCA7FIJJp+0DW
M8Yv2r/qQlU7VH75sVCRWBZ5Tishp0OMXMuw3EigMntYY4HrjwxkSgiKIFRc
JFVhTmLWcjBChRuwykJmOkTWq89Zb3l5DpRBi4iXIp3khvGTUGsLLsXSFTWe
LkeKEA8LbfMlHJFBDZEPbgy5Hfk1h8k8cLAFandVqLUi1wRXSk640FwYOiQv
oIkncsXUsA5EDQAOgayy/2bAvihn4uanAwg2DSGkHiDH1mAw0WMV5/R80CJS
EBKSWopFP48pgaBG6tlOzjMYpCAckb6IwMWgRRRMCVyXQctzkMEJOVNa3I+g
iC9EBZZxvaN+PDU/sMo6ziGQVcZiUxaauigMMF65F9hhMRN6YSR0OW9Qmh01
ISVjsFsD4VJGBbU89K4GrHW1dMInnvo1dT+ERgrhR1tcLabDCUBS1v1h0eE6
G8VJJdTtGdCEcHU6MsNNAQbck+E6oh4KYZGrVCIpSV7JJhJWNMc4sHG5AM5r
fvPo8KhYN9yJWvdp7iw0NqdU8KLcgXoNqSnGIBY+5BkW1uhoK+vC+J6n/vP5
lE5AHx7IUOl7MTySbT+YxoYasw/zbjToJuOSi/ZARGjFAag4Pn6jwo9GfuIg
IKQZjVRmSDcHS2GJ+42hTJufVMSiXGkJUe+5bZf1I7OKkaMsZS+Cv5GGd6rq
UbvS1A8IgjSxQ4WyYminbE672FwOcxNFKYjFHRz/yg8j9qlptISQNTEAkV5J
5+Osiwozul7+kVs10qzGQcG8Df/MNQKJxVsew9kKCX0wRB7VYk4m9RwXwzG5
CsYWBi/auqI0nkbKaPAAVj5XxKMEd4AHkX4U0qag2LjuIycwmZVwWUE4M02Y
khjCqEeyLhm4inNQW44RUyzcv2ocQymhWesmR8xayT6SSCB8Ek7ImhRyRktx
QleNNeNkP01p3qov2ZVPNW314Yd7AJOA8dtvpdPm+MBkEfiIEt2pbCXg2vCD
6kgTQb6ieU7FPXi7kxomhwCpWGXWEJ45G9IsJgYsx0uV4igEXpK9Qtppshdn
H6iahGsGSdEUzYYKR5S2X1CI4OkvgXzDUGMS+k2oKbpPZ+BIKcCyLXZdxqai
zkdonyPJk0KhB5pK49AQKmsyh8TtT5n6yal6OMqDKyPkOXpSc6+apWIMbrQ1
I1M1vlWBGnk+twiisbtcNnkXr7qQ7kMCV8QzRUeI06HXUsijYjdHdqISSACl
5UP9Frazko6n2eRlNE3Rk8w8VhUDwlwArysadrui089hxI9FHgwd2mp4uARy
a5CKwubSHEPxdkYX21SGu+TSkSNuQi524BksLlqf8MBFMZRysBBULnXTSRlq
SW4iZOc5QPGoBWVjshCYMWXnciDGotgypMCRbYsTR8HDP4y0eYaVGgxApH82
EZNrRo8XjQuZMWnKdy+Ld2HOvl8wLdY383q2xHAd8dCf0kyAudBCjvV/en/g
Us50KRJn6LkwYUBdnQVt4e2JMAqNyDnMMMM5OAKlnCWPISGPX50weSZIUZSJ
cQcXj0uECQgmrn3NDbR/Ple1mB/J5IcjIt0vnLnJWVaRspYZCFe6Nsd4GhUb
VTJHEMi6VBJYZiFZD+XX0YTfYy6fcJrcTJl0SbG+NOaRGf95o2Gfw/OSAnW9
piAKY2LaJQfMZUTGD6ouxRGVwiU3R52KKMo03PzLcY1eybGTDLGcq7pwqvPR
+ThbFx8cgD+Wz4IgzKjKfI8MnPA6jwCX869Uvug7LIFrE4Sq8DYMD8kUNfnA
QtIpPi8maKCxzwm1QtSg713Ray1XUuIi6AmMORygdrwbAioN5tAMM/UQBZJq
uxst08B0cCmYyyxU7ENvHb02JYXDEhbYphaT6ydKN82uRx65b31q0aa5O/06
ztifPMS+TYAh5d4jFTs3YUg6p4P8ukiy7jAIl204BW7XybMRimlmLbyNmIYu
TjCkcNRFmsg1YCZdsUCsIjmnCd9mjkoBOBh26WtokiIMrHU2zZPUUA4no+nK
RT/jvI+8BOfHCpjyJiKdlQXHg76h7OHN1k4UHhGOiZiHl12pbRKHVhCmTWpZ
JtfggVA6PBm44qZe+mI53/815xTM1k73CjMnlCZIex4ASsURqjsaXthP/DRv
nARxKCnKbgY1haTCewmLcUnY1GNrcBTKxnYVxoCJhfxxvLFgoxfDjcwm0FAi
HMqXb4Akx4zwL1UcCjemSalzHL6azljf2YzdKg3qhY3L8XDGqhgzrnmicd1v
GugCJP3qSfTCc3qwIbzqwN3qJffM9SMXb1m8FhqGyay/fFQ+jjSBuZJOVNnZ
Q4SmlHWZqhpnea/rrOHc5whKReRMWIpE97THXwzz5MhSvm1Db0CVTyzSQRrU
kcvn8Ty5bqronZ6TinTSCirm3kpOWr4z0RPNOZl1LH0mvMkq5YfY1IoNzpRc
Gem7Sw0+CDRUATgsx1ehUpvL5CFfsbb8SXmS5VtQkRcLsIUZ1qPOb14s+Ugo
swh/P/cAKGPHBeRBJhtycyq86Z5l9GDHMhtZ1+MFFga8/j7O8kafXEBs6JkL
wl4EWDBpMl+zA3+5VVUYObgA9ovCJtPWYSCZUFCB15tGKrXcYMCZaBCnqjjt
TAXLRzh+dNfInsK4O3yRp4sLMrUo1sRRoWveNoxEJw+/ABsEFQci/wMN9efZ
RMvvxx5IZa6lwk945/RLfue0kEbbdw56ZMfGSb79tr+niTui4Bx1WCD+8mzU
skIKnB+PA2ec0Z+52NDQcFVl5ljhJ3OGqdJ75uFMX77AmdKL7lIL4zdaL+wy
AP0vAQbM5t614CUjjdsVsM0jNkUySnV9T0hL/3GAoqOcG4daGIeYwJSm3Ogd
udMAnWemTsYwVGog+hsB4pPzPRJXsL+Uo6GNmv418hIG9toq9uDVgv0YJqrS
7E8RJAj62V+e8vvny7/bgEy7CB9JAFI5LDs4sPLQ56YUnuqzYWw57FjGrNzc
oY6cTJfDd+hvjOR2bRgk8cuwqIpYY0md6fWmYv1rrrxsoYUlc5c8SSwnveSm
s+1FbT2JXc2L+TY54RhXybsSlUyD71LA9PHNbkmbSqYcnV0y1CTtMFsZ3uBQ
yLMcdgvV48sDkpkkFoYcBgHyW43SlYjeA7Glpc9XTX3w5XuRYsKxo6WisS9F
tyqUS4RHWrj8NsFn+q762PUHJKc79hul3lFoIdHK+3R3Nf+xm/d2HB3g66/W
dOv3Dr9Zfd866oq/c+Pfjf7bbPeNPTiamvqJqI4d1cu+M/ynBagF+Y6H4GF/
fevpTPf7Axi60S+xFb0ntNKv9ggD+pe+xxI/IOf5nv/8AJ7s96YFXX7Zz5Wp
jYMDYZURxEX/bZztjgjDm34cj/o7fLifR5pLuB9IIsBHc4Bh+pUMZXmjX3e7
PZadVuoHM7MdvXJIkHaNM0Lq7ic7kK1+Z3BJGsUKM39pYJ/Ydij15j98FE0+
v6YWZ9K3wIANonjsQKZ3BkC6bLONY8lSG5G3SyTHTO8KxbrB65nQCtpAltw6
qRXP1K+CqEb3G357/vT5U0XdQaib8kbep+tv9FcvXnzx/Jl+dzKNdVfyBunX
vOO/PbLpP0HiyR+v3929exv+mEU4zP0BJ4CwKHm/p7xjghKNZGyvQU2Dicc3
DMTY33Zd/yCmKweXPxtQySGffXnz9PlXL+LL16Hll7Ic8hQuz9KYRsslqv8D
bzNpxMBKAAA=

-->

</rfc>
