CoAP Simple Congestion Control/Advanced
draft-ietf-core-cocoa-01
|
| Document |
Type |
|
Active Internet-Draft (core WG)
|
|
Last updated |
|
2017-03-13
|
|
Replaces |
|
draft-bormann-core-cocoa
|
|
Stream |
|
IETF
|
|
Intended RFC status |
|
(None)
|
|
Formats |
|
plain text
pdf
html
bibtex
|
| Stream |
WG state
|
|
WG Document
|
|
Document shepherd |
|
No shepherd assigned
|
| IESG |
IESG state |
|
I-D Exists
|
|
Consensus Boilerplate |
|
Unknown
|
|
Telechat date |
|
|
|
Responsible AD |
|
(None)
|
|
Send notices to |
|
(None)
|
CoRE Working Group C. Bormann
Internet-Draft Universitaet Bremen TZI
Intended status: Informational A. Betzler
Expires: September 14, 2017 Fundacio i2CAT
C. Gomez
I. Demirkol
Universitat Politecnica de Catalunya/Fundacio i2CAT
March 13, 2017
CoAP Simple Congestion Control/Advanced
draft-ietf-core-cocoa-01
Abstract
The CoAP protocol needs to be implemented in such a way that it does
not cause persistent congestion on the network it uses. The CoRE
CoAP specification defines basic behavior that exhibits low risk of
congestion with minimal implementation requirements. It also leaves
room for combining the base specification with advanced congestion
control mechanisms with higher performance.
This specification defines some simple advanced CoRE Congestion
Control mechanisms, Simple CoCoA. It is making use of input from
simulations and experiments in real networks.
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on September 14, 2017.
Copyright Notice
Copyright (c) 2017 IETF Trust and the persons identified as the
document authors. All rights reserved.
Bormann, et al. Expires September 14, 2017 [Page 1]
Internet-Draft CoAP Simple CoCoA March 2017
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 2
1.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 3
2. Context . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
3. Area of Applicability . . . . . . . . . . . . . . . . . . . . 4
4. Advanced CoAP Congestion Control: RTO Estimation . . . . . . 4
4.1. Blind RTO Estimate . . . . . . . . . . . . . . . . . . . 5
4.2. Measured RTO Estimate . . . . . . . . . . . . . . . . . . 5
4.2.1. Modifications to the algorithm of RFC 6298 . . . . . 6
4.2.2. Discussion . . . . . . . . . . . . . . . . . . . . . 6
4.3. Lifetime, Aging . . . . . . . . . . . . . . . . . . . . . 7
5. Advanced CoAP Congestion Control: Non-Confirmables . . . . . 7
5.1. Discussion . . . . . . . . . . . . . . . . . . . . . . . 8
6. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 8
7. Security Considerations . . . . . . . . . . . . . . . . . . . 8
8. References . . . . . . . . . . . . . . . . . . . . . . . . . 8
8.1. Normative References . . . . . . . . . . . . . . . . . . 8
8.2. Informative References . . . . . . . . . . . . . . . . . 9
Appendix A. Advanced CoAP Congestion Control: Aggregate
Congestion Control . . . . . . . . . . . . . . . . . 10
A.1. Proposed Algorithm . . . . . . . . . . . . . . . . . . . 10
A.2. Example 1 . . . . . . . . . . . . . . . . . . . . . . . . 10
A.3. Example 2 . . . . . . . . . . . . . . . . . . . . . . . . 11
A.4. Discussion . . . . . . . . . . . . . . . . . . . . . . . 12
Appendix B. Supporting evidence . . . . . . . . . . . . . . . . 12
B.1. Older versions of the draft and improvement . . . . . . . 13
B.2. References . . . . . . . . . . . . . . . . . . . . . . . 13
Acknowledgements . . . . . . . . . . . . . . . . . . . . . . . . 14
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 15
Show full document text