< draft-irtf-panrg-questions-09.txt   draft-irtf-panrg-questions-10.txt >
Path Aware Networking RG B. Trammell Path Aware Networking RG B. Trammell
Internet-Draft Google Switzerland GmbH Internet-Draft Google Switzerland GmbH
Intended status: Informational 16 April 2021 Intended status: Informational 11 October 2021
Expires: 18 October 2021 Expires: 14 April 2022
Current Open Questions in Path Aware Networking Current Open Questions in Path Aware Networking
draft-irtf-panrg-questions-09 draft-irtf-panrg-questions-10
Abstract Abstract
In contrast to the present Internet architecture, a path-aware In contrast to the present Internet architecture, a path-aware
internetworking architecture has two important properties: it exposes internetworking architecture has two important properties: it exposes
the properties of available Internet paths to endpoints, and provides the properties of available Internet paths to endpoints, and provides
for endpoints and applications to use these properties to select for endpoints and applications to use these properties to select
paths through the Internet for their traffic. While this property of paths through the Internet for their traffic. While this property of
"path awareness" already exists in many Internet-connected networks "path awareness" already exists in many Internet-connected networks
within single domains and via administrative interfaces to the within single domains and via administrative interfaces to the
skipping to change at page 2, line 10 skipping to change at page 2, line 10
Internet-Drafts are working documents of the Internet Engineering Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet- working documents as Internet-Drafts. The list of current Internet-
Drafts is at https://datatracker.ietf.org/drafts/current/. Drafts is at https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress." material or to cite them other than as "work in progress."
This Internet-Draft will expire on 18 October 2021. This Internet-Draft will expire on 14 April 2022.
Copyright Notice Copyright Notice
Copyright (c) 2021 IETF Trust and the persons identified as the Copyright (c) 2021 IETF Trust and the persons identified as the
document authors. All rights reserved. document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents (https://trustee.ietf.org/ Provisions Relating to IETF Documents (https://trustee.ietf.org/
license-info) in effect on the date of publication of this document. license-info) in effect on the date of publication of this document.
Please review these documents carefully, as they describe your rights Please review these documents carefully, as they describe your rights
skipping to change at page 6, line 23 skipping to change at page 6, line 23
architecture. One key choice here is between in-band and out-of-band architecture. One key choice here is between in-band and out-of-band
control of path selection. Another is granularity of path selection control of path selection. Another is granularity of path selection
(whether per packet, per flow, or per larger aggregate), which also (whether per packet, per flow, or per larger aggregate), which also
has a large impact on the scalabilty/expressiveness tradeoff. Path has a large impact on the scalabilty/expressiveness tradeoff. Path
selection must, like path property information, be trustworthy, such selection must, like path property information, be trustworthy, such
that the result of a path selection at an endpoint is predictable. that the result of a path selection at an endpoint is predictable.
Moreover, any path selection mechanism should aim to provide an Moreover, any path selection mechanism should aim to provide an
outcome that is not worse than using a single path, or selecting outcome that is not worse than using a single path, or selecting
paths at random. paths at random.
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. control plane
address, 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.
The third question: how can endpoints select paths to use for traffic 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 in a way that can be trusted by the network, the endpoints, and the
applications using them? applications using them?
2.4. Interfaces for Path Awareness 2.4. Interfaces for Path Awareness
In order for applications to make effective use of a path-aware In order for applications to make effective use of a path-aware
networking architecture, the control interfaces presented by the networking architecture, the control interfaces presented by the
network and transport layers must also expose path properties to 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 application in a useful way, and provide a useful set of paths among
 End of changes. 4 change blocks. 
4 lines changed or deleted 12 lines changed or added

This html diff was produced by rfcdiff 1.48. The latest version is available from http://tools.ietf.org/tools/rfcdiff/