Sliced transfers in CoAP
draft-bormann-core-coap-block-01
Document | Type |
Replaced Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Author | Carsten Bormann | ||
Last updated | 2010-10-24 | ||
Replaced by | draft-ietf-core-block | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Replaced by draft-ietf-core-block | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
CoAP is a RESTful transfer protocol for constrained nodes and networks. CoAP is based on datagram transport, which limits the maximum size of resource representations that can be transferred without too much fragmentation. A previous version of this draft defined the Block option. The Block option provides a minimal way to transfer larger representations in a block-wise fashion. It is currently documented in the WG draft draft-ietf-core-block-00.txt This short I-D attempts to pick up some recent discussion on the CoRE mailing list, and defines a more general, but also slightly more complex approach. It is intended as an example for a complete design based on this discussion, to enable a rational assessment of the relative complexities.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)