]>

christian@amsuess.com

Internet CoRE CoRE, Web Linking, Resource Discovery, Resource Directory, Proxy A collection of extensions to the Resource Directory that can stand on their own, and have no clear future in specification yet. Discussion Venues Discussion of this document takes place on the Constrained RESTful Environments Working Group mailing list (core@ietf.org), which is archived at . Source for this draft and an issue tracker can be found at .

Introduction This document pools some extensions to the Resource Directory that might be useful but have no place in the original document. They might become individual documents for IETF submission, simple registrations in the RD Parameter Registry at IANA, or grow into a shape where they can be submitted as a collection of tools. At its current state, this draft is a collection of ideas.

Reverse Proxy requests When a registrant registers at a Resource Directory, it might not have a suitable address it can use as a base address. Typical reasons include being inside a NAT without control over port forwarding, or only being able to open outgoing connections (as program running inside a web browser utilizing CoAP over WebSocket might be). suggests (in the Cellular M2M use case) that proxy access to such endpoints can be provided, it gives no concrete mechanism to do that; this is such a mechanism. This mechanism is intended to be a last-resort option to provide connectivity. Where possible, direct connections are preferred. Before registering for proxying, the registrant should attempt to obtain a publicly available port, for example using PCP (). The same mechanism can also be employed by registrants that want to conceal their network address from its clients. A deployed application where this is implicitly done is LwM2M [citation missing]. Notable differences are that the protocol used between the client and the proxying RD is not CoAP but application specific, and that the RD (depending on some configuration) eagerly populates its proxy caches by sending requests and starting observations at registration time.

Discovery An RD that provides proxying functionality advertises it by announcing the additional resource type "TBD1" on its directory resource.

Registration A client passes the "proxy=yes" or "proxy=ondemand" query parameter in addition to (but typically instead of) a "base" query parameter. A server that receives a "proxy=yes" query parameter in a registration (or receives "proxy=ondemand" and decides it needs to proxy) MUST come up with a "Proxy URL" on which it accepts requests, and which it uses as a Registration Base URI for lookups on the present registration. The Proxy URL SHOULD have no path component, as acting as a reverse proxy in such a scenario means that any relative references in all representations that are proxied must be recognized and possibly rewritten. The RD MAY accept connections also on alternative Registration Base URIs using different protocols; it can advertise them using the mechanisms of . The registrant is not informed of the chosen public name by the RD. This mechanism is applicable to all transports that can be used to register. If proxying is active, the restrictions on when the base parameter needs to be present ( Registration template) are relaxed: The base parameter may also be absent if the connection originates from an ephemeral port, as long as the underlying protocol supports role reversal, and link-local IPv6 addresses may be used without any concerns of expressibility. If the client uses the role reversal rule relaxation, both it and the server keep that connection open for as long as it wants to be reachable. When the connection terminates, the RD SHOULD treat the registration as having timed out (even if its lifetime has not been exceeded) and MAY eventually remove the registration. It is yet to be decided whether the RD's announced ability to do proxying should imply that infinite lifetimes are necessarily supported for such registrations; at least, it is RECOMMENDED.

Registration updates The "proxy" query parameter can not be changed or repeated in a registration update; RD servers MUST answer 4.00 Bad Request to any registration update that has a "proxy" query parameter. As always, registration updates can explicitly or implicitly update the Registration Base URI. In proxied registrations, those changes are not propagated to lookup, but do change the forwarding address of the proxy. For example, if a registration is established over TCP, an update can come along in a new TCP connection. Starting then, proxied requests are forwarded along that new connection.

Proxy behavior The RD operates as a reverse-proxy as described in Section 5.7.3 at the announced Proxy URL(s), where it decides based on the requested host and port to which registrant endpoint to forward the request. The address the incoming request are forwarded to is the base address of the registration. If an explicit "base" paremter is given, the RD will forward requests to that location. Otherwise, it forwards to the registration's source address (which is the implied base parameter). When an implicit base is used, the requests forwarded by the RD to the EP contain no Uri-Host option. EPs that want to run multiple parallel registrations (especially gateway-like devices) can either open up separate connections, or use an additional (to-be-specified) mechanism to set the "virtual host name" for that registration in a separate argument.

Limitations from using a reverse proxy The registrant requesting the reverse proxying needs to ensure that all services it provides are compatible with being operated behind a reverse proxy with an unknown name. In particular, this rules out all applications that refer to local resources by a full URI (as opposed to relative references without scheme and host). Applications behind a reverse proxy can not use role reversal. Some of these limitations can be mitigated if the application knows its advertised address.

On-Demand proxying If an endpoint is deployed in an unknown network, it might not know whether it is behind a NAT that would require it to configure an explicit base address, and ask the RD to assist by proxying if necessary by registering with the "proxy=ondemand" query parameter. A server receiving that SHOULD use a different IP address to try to access the registrant's .well-known/core file using a GET request under the Registration Base URI. If that succeeds, it may assume that no NAT is present, and ignore the proxying request. Otherwise, it configures proxying as if "proxy=yes" were requested. Note that this is only a heuristic [ and not tested in deployments yet ].

Multiple upstreams When a proxying RD is operating behind a router that has uplinks with multiple provisioning domains (see ) or a similar setup, it MAY mint multiple addresses that are reachable on the respective provisioning domains. When possible, it is preferred to keep the number of URIs handed out low (avoiding URI aliasing); this can be achieved by announcing both the proxy's public addresses under the same wildcard name. If RDs are announced by the uplinks using RDAO, the proxy may use the methods of to distribute its registrations to all the announced upstream RDs. In such setups, the router can forward the upstream RDs using the PvD option () to PvD-aware hosts and only announce the local RD to PvD-unaware ones (which then forwards their registrations). It can be expected that PvD-aware endpoints are capable of registering with multiple RDs simultaneously.

Examples

Registration through a firewall ;rt="example.x" Req from other-address.rd.example.net: GET coap://[2001:db8:42::9876]/.well-known/core Request blocked by stateful firewall around [2001:db8:42::] RD decides that proxying is necessary Res: 2.04 Created Location: /reg/abcd ]]> Later, lookup of that registration might say: ;rt="example.x ]]> A request to that resource will end up at an IP address of the RD, which will forward it using its the IP and port on which the registrant had registered as source port, thus reaching the registrant through the stateful firewall.

Registration from a browser context ;rt="core.s" Res: 2.04 Created Location: /reg/123 ]]> The gyroscope can now not only be looked up in the RD, but also be reached: ;rt="core.s" ]]> In this example, the RD has chosen to do port-based rather than host-based virtual hosting and announces its literal IP address as that allows clients to not send the lengthy Uri-Host option with all requests.

Notes on stability and maturity Using this with UDP can be quite fragile; the author only draws on own experience that this can work across cell-phone NATs and does not claim that this will work over generic firewalls. [ It may make sense to have the example as TCP right away. ]

Security considerations An RD MAY impose additional restrictions on which endpoints can register for proxying, and thus respond 4.01 Unauthorized to request that would pass had they not requested proxying. Attackers could do third party registrations with an attacked device's address as base URI, though the RD would probably not amplify any attacks in that case. The RD MUST NOT reveal the address at which it reaches the registrant except for adaequately authenticated and authorized debugging purposes, as that address could reveal sensitive location data the registrant may wish to hide by using a proxy. Usual caveats for proxies apply.

Alternatives to be explored With the mechanisms of , an RD could also operate as a forward proxy, and indicate its availability for that purpose in a has-proxy link it creates on its own, and which it makes discoverable through its lookup interfaces. How a registrant opts in to that behavior, how it selects a suitable public address (using the base attribute is tempting, but conflicts with the currently prescribed proxy behavior) and for which scenarios this is preferable is a topic being explored.

Infinite lifetime An RD can indicate support for infinite lifetimes by adding the resoruce type "TBD2" to its list of resource types. A registrant that wishes to keep its registration alive indefinitely can set the lifetime value as "lt=inf". Registrations with infinite lifetimes never time out. Unlike regular registrations, they are not "soft state"; the registrant can expect the RD to persist the registrations across network changes, reboots, softare updates and that like. Typical use cases for infinite life times are:

• Commissioning tools (CTs) that do not return to the deployment site, and thus can not refresh the soft state
• Proxy registrations whose lifetime is limited by a connection that is kept alive

Example Had the example of discovered support for infinite lifetimes during lookup like this: ;rt="core.rd TBD1 TBD2";ct=40 ]]> it could register like that: ;rt="core.s" Res: 2.04 Created Location: /reg/123 ]]> and never need to update the registration for as long as the websocket connection is open. (When it gets terminated, it could try renewing the registration, but needs to be prepared for the RD to already have removed the original registration.)

Limited lifetimes Even if an RD supports infinite lifetimes, it may not accept them from just any registrant. Even more, an RD may have policies in place that require a certain frequency of updates and thus place an upper limit on lt lower than the technical limit of 136 years. This document does not define any means of communicating lifetime limits, but explores a few options:

• Administrative channels. An RD that sees registrations with unreasonably long lifetimes can flag them for its operator to take further measures. While sounding tediously manual, this captures the observation that different components are configured in a softly incompatible way, and need operator intervention (because if there were automatic means, they obviously failed).
• General advertisement of preferred lifetimes. When the limitations on the lifetimes are not from authorization but from general setup, an RD could advertise that property in a to-be-created link target attribute of its registration resource. Different attributes could express preference or hard limits. This information is also available easily for registrants, which may then heed the advice if supported, and may notify their operators that they just started spending more resources than they were configured to. It is also available to tools that provision endpoints with their RD address (and parameters), as they can use the same lookup interface.
• Per-registration information. For soft limits, the RD can offer the endpoint additional metadata if it queries them post-registration. That query can use the endpoint lookup interface (where the endpoint would see additional metadata to its own registration resource) or special media types for GETting the registration resource itself. Either way, this requires additional round-trips on the part of endpoint.
• Hard limits informed by error codes. An RD can reject registrations with overly long lifetimes if the endpoint is not authorized to use such long lifetimes with a 4.01 Unauthorized error. The mechanisms outlined in , with a to-be-defined error detail on the permissible lifetime, can be used to propagate information back to then endpoint. This behavior is explicitly NOT RECOMMENDED, because devices may crucially depend on the RD's services -- this rejection may even be the reason why the device is not configured with the new settings that would contain a shorter lifetime.

Lookup across link relations Resource lookup occasionally needs execute multiple queries to follow links. An RD server (or any other server that supports compatible lookup), can announce support for following links in resource lookups by announcing support for the TBD3 interface type on its resource lookup. A client can the query that server to not only provide the matched links, but also links that are reachable over relations given in "follow" query parameters.

Example Assume a node presents the following data in its <.well-known/core> resource (and submitted the same to the RD): ;if="core.s";rt="example.temperature", ;rel="calibration-protocol";anchor="/temp", ;rel="describedby";anchor="/temp", ;if="core.s";rt="example.humidity", ;rel="calibration-protocol";anchor="/hum", ]]> A lookup client can, in one query, find the temperature sensor and its relevant metadata: ;if="core.s";rt="example.temperature";anchor="coap://node1", ;rel="calibration-protocol";anchor="coap://node1/temp", ;rel="describedby";anchor="coap://node1/temp", ]]> [ There is a better example in an earlier stage of ] Given the likelihood of a CoRAL based successor to , this lookup variant might easily be superseeded by a CoRAL FETCH format; it might look like this there: #using reef = <...> reef:content ?x { core:rt "example.temperature" calibration-protocol ?y { core:describedby ?z } } Res: 2.01 Content Content-Format: aplication/coral+cbor Payload: reef:content { core:rt "example.temperature" calibration-protocol { core:describedby } } ]]>

Lifetime Age This extension is described in Section 5.2. The "provenance" extension in Section 5.1 of the same document should probably be expressed differently to avoid using non-target link attributes.

Zone identifier introspection The 'split-horizon' mechanism of (that registrations with link-local bases can only be read from the zone they registered on) reduces the usability of the endpoint lookup interface for debugging purposes. To allow an administrator to read out the "show-zone-id" query parameter for endpoint and resource lookup is introduced. A Resource Directory that understands this parameter MUST NOT limit lookup results to registrations from the lookup's zone, and MUST use zone identifiers to annotate which zone those registrations are valid on. The RD MUST limit such requests to authenticated and authorized debugging requests, as registrants may rely on the RD to keep their presence secret from other links.

Example ;base="coap://[2001:db8::1]";et=printer;ep="bigprinter", ;base="coap://[fe80::99%wlan0]";et=printer;ep="localprinter-1234", ;base="coap://[fe80::99%eth2]";et=printer;ep="localprinter-5678", ]]>

Proxying multicast requests Multicast requests are hard to forward at a proxy: Even if a media type is used in which multiple responses can be aggregated transparently, the proxy can not reliably know when all responses have come in. Section 2.9 describes the difficulties in more detail. Note that provides a mechanism that does allow the forwarding of multicast requests. It is yet to be determined what the respective pros and cons are. Conversely, that lookup mechanism may also serve as an alternative to resource lookup on an RD. A proxy MAY expose an interface compatible with the RD lookup interface, which SHOULD be advertised by a link to it that indicates the resource types core.rd-lookup-res and TBD4. The proxy sends multicast requests to All CoAP Nodes ( Section 12.8) requesting their .well-known/core files either eagerly (ie. in regular intervals independent of queries) or on demand (in which case it SHOULD limit the results by applying query filtering; if it has received multiple query parameters it should forward the one it deems most likely to limit the results, as .well-known/core only supports a single query parameter). In comparison to classical RD operation, this RD behaves roughly as if it had received a simple registration with a All CoAP Nodes address as the source address, if such behavior were specified. The individual registrations that result from this neither have an explicit registration resource nor an explicit endpoint name; given that the endpoint lookup interface is not present on such proxies, neither can be queried. Clients that would intend to do run a multicast discovery operation behind the proxy can then instead query that resource lookup interface. They SHOULD use observation on lookups, as an on-demand implementation MAY return the first result before others have arrived, or MAY even return an empty link set immediately.

Example ;rt="core.rd-lookup-res TBD4";ct=40 Req: GET coap+ws://gateway.example.com/discover?rt=core.s Observe: 0 Res: 2.05 Content Observe: 0 Content-Format: 40 (empty payload) ]]> At the same time, the proxy sends out multicast requests on its interfaces: ;ct="0 112";rt="core.s" Res (from [2001:db8::2]:5683): 2.05 Content ;ct="0 112";rt="core.s" ]]> upon receipt of which it sends out a notification to the websocket client: ;ct="0 112";rt="core.s";anchor="coap://[2001:db8::1]", ;ct="0 112";rt="core.s";anchro="coap://[2001:db8::2]" ]]>

Opportunistic RD An application that wants to advertise its resources in Resource Directory can find itself in a network that has no RD deployed. It may be able to start an RD on its own to fill in that gap until an explicitly configured one gets installed. This bears the risk of having competing RDs on the same network, where resources registered at one can not be discovered on the other. To mitigate that, such Opportunistic Resource Directories should follow those steps:

• The RD chooses its own Opportunistic Capability value. That integer number is an estimate of number of target attributes it expects to be able to store, where in absence of better estimates one would assume that a registration contains 16 links, and each links contains three target attributes each with an eight byte key and a 16 byte value. The Opportunistic Capability value is advertised as a TBD5-cap= target attribute on the registration resource.
• The RD chooses its own Opportunistic Tie-Break value. That integer number needs no other properties than being likely to be different even for two instances of the same device being started; numeric forms of MAC addresses or random numbers make good candidates. The Opportunistic Capability value is advertised as a TBD5-tie= target attribute on the registration resource.
• The Opportunistic RD, before advertising its resources, performs RD discovery itself, using at least all the discovery paths it may become discoverable on itself.
• If the Opportunistic RD finds no other RD, or if the RD it finds is less capable than itself, it can start advertising itself as a Resource Directory. An RD is called more capable than another if its TBD5-cap value is greater than the other's, or if its TBD5-tie value is greater than the other's if the former results in a tie. Absent or unparsable attributes are considered greater than any present attribute. In case an RD observes a tie even after evaluating the tie breaker, it may change its Opportunistic Tie-Break value if that was picked randomly, or reevaluate its life choices if it uses its own MAC address.
• A running Opportunistic RD needs to perform discovery for other RDs repeatedly. If it discovers a more capable RD, it stops advertising its own resources. It should continue to serve lookup requests, but refuse any new registration or registration updates (which will trigger the registrant endpoints to look for a new RD). An inactive Opportunistic RD will be notified of the highter capability RD's shutdown by the expiry of whatever it may be started to advertise that was now advertised there; see below for possible improvements.
• An RD that discovers an Opportunistic RD of lower capability may speed up the transition process by (not mutually exclusive) two ways
  • It can register its own (registration) resource(s) into the lower capability directory. That RD can take that as having discovered a higher capability RD and stop advertising.
  • It can expose resources and registrations of the lower capability directory using the methods described in .
• An Opportunistic RD that yields to a more capable RD may ease the transition by attempting to register its active registrations at the more capable RD, taking the role of a CT. The lifetimes picked for those must not exceed the remaining lifetime of its registrations, and it must not renew those registrations.

Future iterations of this document may want to cut down on the possibilities listed above. Some ideas are around for making the shutdown of a commissioned or otherwise high-capability RD more graceful, but they still have some problems

• Setting a commissioned or high-capability RD's Capability to zero in preparation of the shutdown may create loops in any distributed lookups.
• Asking the lower capability RD to register its registration resource (even though not otherwise advertised) at the higher capability RD still creates a situation where clients may find two RDs running simultaneously, and we can't expect clients to make any decisions based on TBD5 values.
• Asking the higher capability RD to register its registration resource with the lower capability RD contradicts the current recommendation for the passive Opportunistic RD to not accept registrations / renewals. Also, the deployed RD may not know that Opportunistic RDs are a thing.
• Advertising an almost-but-not-quite rt= value on passive registration resources may be an option, but needs to be thought through thoroughly.

Installations of Opportunistic RDs are at special risk of resource exhaustion because they are not sized with their actual deployment in mind, but rely on defaults set by the application that starts the RD. Opportunistic RDs should only be started if the application's administrator can be informed in a timely fashion when the RD's resources are nearing exhaustion; guidance towards installing a more capable RD on the network should be provided in that case.

Applications

• Group managers using can ship its own low-priority Opportunistic RD to announce its join resources. This provides benefits over announcing them on multicast discovery if the network can efficiently route requests to the All CoAP Resource Directories multicast address (so group members get a response back from an early focused request to all RDs rather than falling back to multicasting All CoAP Nodes for ?rt=osc.j&...), or if discovery of the group's multicast address is used.
• Administrative tools that try to provide a broad overview of a network's CoAP devices could offer to open an Opportunistic RD if they find no active RD on the network (but should ask the user in interactive scenarios). That allows them to see devices that newly join the network quickly (by observing their own or the found RD), rather than relying periodic multicasts.

Registrations that update DNS records An RD that is provisioned with means to update a DNS zone and that has a known mapping from registrants to host names could use registrations to populate DNS records from registration base addresses. When combined with , these records point to the RD's built-in proxy rather than to the base address. This mechanism is not described in further detail yet as it does not interact well yet with how the base registration attribute interacts with the proxy announcements of .

References Normative References In many Internet of Things (IoT) applications, direct discovery of resources is not practical due to sleeping nodes or networks where multicast traffic is inefficient. These problems can be solved by employing an entity called a Resource Directory (RD), which contains information about resources held on other servers, allowing lookups to be performed for those resources. The input to an RD is composed of links, and the output is composed of links constructed from the information stored in the RD. This document specifies the web interfaces that an RD supports for web servers to discover the RD and to register, maintain, look up, and remove information on resources. Furthermore, new target attributes useful in conjunction with an RD are defined. Discovery of endpoints and resources in M2M applications over large networks is enabled by Resource Directories, but no special consideration has been given to how such directories can scale beyond what can be managed by a single device. This document explores different ways in which Resource Directories can be scaled up from single network to enterprise and global scale. It does not attempt to standardize any of those methods, but only to demonstrate the feasibility of such extensions and to provide terminology and exploratory groundwork for later documents. This document describes how the zone identifier of an IPv6 scoped address, defined as <zone_id> in the IPv6 Scoped Address Architecture (RFC 4007), can be represented in a literal IPv6 address and in a Uniform Resource Identifier that includes such a literal address. It updates the URI Generic Syntax specification (RFC 3986) accordingly. The Constrained Application Protocol (CoAP) is a specialized web transfer protocol for use with constrained nodes and constrained (e.g., low-power, lossy) networks. The nodes often have 8-bit microcontrollers with small amounts of ROM and RAM, while constrained networks such as IPv6 over Low-Power Wireless Personal Area Networks (6LoWPANs) often have high packet error rates and a typical throughput of 10s of kbit/s. The protocol is designed for machine- to-machine (M2M) applications such as smart energy and building automation. CoAP provides a request/response interaction model between application endpoints, supports built-in discovery of services and resources, and includes key concepts of the Web such as URIs and Internet media types. CoAP is designed to easily interface with HTTP for integration with the Web while meeting specialized requirements such as multicast support, very low overhead, and simplicity for constrained environments. Informative References The Constrained Application Protocol (CoAP), although inspired by HTTP, was designed to use UDP instead of TCP. The message layer of CoAP over UDP includes support for reliable delivery, simple congestion control, and flow control. Some environments benefit from the availability of CoAP carried over reliable transports such as TCP or Transport Layer Security (TLS). This document outlines the changes required to use CoAP over TCP, TLS, and WebSockets transports. It also formally updates RFC 7641 for use with these transports and RFC 7959 to enable the use of larger messages over a reliable transport. The Port Control Protocol allows an IPv6 or IPv4 host to control how incoming IPv6 or IPv4 packets are translated and forwarded by a Network Address Translator (NAT) or simple firewall, and also allows a host to optimize its outgoing NAT keepalive messages. The Constrained Application Protocol (CoAP, [RFC7252]) is available over different transports (UDP, DTLS, TCP, TLS, WebSockets), but lacks a way to unify these addresses. This document provides terminology and provisions based on Web Linking [RFC8288] to express alternative transports available to a device, and to optimize exchanges using these. This document is a product of the work of the Multiple Interfaces Architecture Design team. It outlines a solution framework for some of the issues experienced by nodes that can be attached to multiple networks simultaneously. The framework defines the concept of a Provisioning Domain (PvD), which is a consistent set of network configuration information. PvD-aware nodes learn PvD-specific information from the networks they are attached to and/or other sources. PvDs are used to enable separation and configuration consistency in the presence of multiple concurrent connections. Provisioning Domains (PvDs) are defined as consistent sets of network configuration information. PvDs allows hosts to manage connections to multiple networks and interfaces simultaneously, such as when a home router provides connectivity through both a broadband and cellular network provider. This document defines a mechanism for explicitly identifying PvDs through a Router Advertisement (RA) option. This RA option announces a PvD identifier, which hosts can compare to differentiate between PvDs. The option can directly carry some information about a PvD and can optionally point to PvD Additional Information that can be retrieved using HTTP over TLS. arm Universität Bremen TZI This document defines a concise "problem detail" as a way to carry machine-readable details of errors in a REST response to avoid the need to define new error response formats for REST APIs for constrained environments. The format is inspired by, but intended to be more concise than, the Problem Details for HTTP APIs defined in RFC 7807. This specification defines Web Linking using a link format for use by constrained web servers to describe hosted resources, their attributes, and other relationships between links. Based on the HTTP Link Header field defined in RFC 5988, the Constrained RESTful Environments (CoRE) Link Format is carried as a payload and is assigned an Internet media type. "RESTful" refers to the Representational State Transfer (REST) architecture. A well-known URI is defined as a default entry point for requesting the links hosted by a server. [STANDARDS-TRACK] RISE AB Consultant Group communication over the Constrained Application Protocol (CoAP) can be secured by means of Group Object Security for Constrained RESTful Environments (Group OSCORE). At deployment time, devices may not know the exact security groups to join, the respective Group Manager, or other information required to perform the joining process. This document describes how a CoAP endpoint can use descriptions and links of resources registered at the CoRE Resource Directory to discover security groups and to acquire information for joining them through the respective Group Manager. A given security group may protect multiple application groups, which are separately announced in the Resource Directory as sets of endpoints sharing a pool of resources. This approach is consistent with, but not limited to, the joining of security groups based on the ACE framework for Authentication and Authorization in constrained environments. The Constrained Application Protocol (CoAP) is a specialized web transfer protocol for constrained devices and constrained networks. It is anticipated that constrained devices will often naturally operate in groups (e.g., in a building automation scenario, all lights in a given room may need to be switched on/off as a group). This specification defines how CoAP should be used in a group communication context. An approach for using CoAP on top of IP multicast is detailed based on existing CoAP functionality as well as new features introduced in this specification. Also, various use cases and corresponding protocol flows are provided to illustrate important concepts. Finally, guidance is provided for deployment in various network topologies. RISE AB IoTconsultancy.nl This document specifies the operations performed by a proxy, when using the Constrained Application Protocol (CoAP) in group communication scenarios. Such a proxy processes a single request sent by a client over unicast, and distributes the request over IP multicast to a group of servers. Then, the proxy collects the individual responses from those servers and relays those responses back to the client, in a way that allows the client to distinguish the responses and their origin servers through embedded addressing information. This document updates RFC7252 with respect to caching of response messages at proxies.

Change log Since -05:

• Add section on Limited Lifetimes.
• Point out limitations to applications that use reverse proxying.
• Minor reference and bugfix updates.

Since -04:

• Minor adjustments:
  • Mention LwM2M and how it is already doing RD proxying.
  • Tie proxying in with infinite lifetimes.
  • Remove note on not being able to switch protocols: RDs that support some future protocol negotiation can do that.
  • Point out that there is no Uri-Host from the RD proxy to the EP, but there could be.
  • Infinite lifetimes: Take up CTs more explicitly from RD discussion.
  • Start exploring interactions with groupcomm-proxy.

Since -03:

• Added interaction with PvD (Provisioning Domains)

Since -02:

• Added abstract
• Added example of CoRAL FETCH to Lookup across link relations section

Since -01:

• Added section on Opportunistic RDs

Since -00:

• Add multicast proxy usage pattern
• ondemand proxying: Probing queries must be sent from a different address
• proxying: Point to RFC7252 to describe how the actual proxying happens
• proxying: Describe this as a last-resort options and suggest attempting PCP first

Acknowledgements [ Reviews from: Jaime Jimenez ] was inspired by Ben Kaduk's comments from reviewing .