RPL DAG Metric Container Node State and Attribute object type extension
draft-ietf-roll-nsa-extension-01
ROLL R. Koutsiamanis, Ed.
Internet-Draft G. Papadopoulos
Intended status: Standards Track N. Montavont
Expires: September 12, 2019 IMT Atlantique
P. Thubert
Cisco
March 11, 2019
RPL DAG Metric Container Node State and Attribute object type extension
draft-ietf-roll-nsa-extension-01
Abstract
Implementing Packet Replication and Elimination from / to the RPL
root requires the ability to forward copies of packets over different
paths via different RPL parents. Selecting the appropriate parents
to achieve ultra-low latency and jitter requires information about a
node's parents. This document details what information needs to be
transmitted and how it is encoded within a packet to enable this
functionality.
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 https://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 12, 2019.
Copyright Notice
Copyright (c) 2019 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
Koutsiamanis, et al. Expires September 12, 2019 [Page 1]
Internet-Draft RPL MC NSA object type extension March 2019
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
2. Terminology . . . . . . . . . . . . . . . . . . . . . . . . . 3
3. Alternative Parent Selection . . . . . . . . . . . . . . . . 4
3.1. Common Ancestor Strict . . . . . . . . . . . . . . . . . 4
3.2. Common Ancestor Medium . . . . . . . . . . . . . . . . . 5
3.3. Common Ancestor Relaxed . . . . . . . . . . . . . . . . . 5
3.4. Usage . . . . . . . . . . . . . . . . . . . . . . . . . . 6
4. Node State and Attribute (NSA) object type extension . . . . 6
4.1. Usage . . . . . . . . . . . . . . . . . . . . . . . . . . 8
4.1.1. DAG Metric Container fields . . . . . . . . . . . . . 9
4.1.2. Node State and Attribute fields . . . . . . . . . . . 9
4.2. Compression . . . . . . . . . . . . . . . . . . . . . . . 9
5. Controlling PRE . . . . . . . . . . . . . . . . . . . . . . . 9
6. Security Considerations . . . . . . . . . . . . . . . . . . . 10
7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 10
8. References . . . . . . . . . . . . . . . . . . . . . . . . . 10
8.1. Informative references . . . . . . . . . . . . . . . . . 10
8.2. Other Informative References . . . . . . . . . . . . . . 11
Appendix A. Implementation Status . . . . . . . . . . . . . . . 11
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 13
1. Introduction
Industrial network applications have stringent requirements on
reliability and predictability, and typically leverage 1+1
redundancy, aka Packet Replication and Elimination (PRE)
[I-D.papadopoulos-6tisch-pre-reqs] to achieve their goal. In order
for wireless networks to be able to be used in such applications, the
principles of Deterministic Networking [I-D.ietf-detnet-architecture]
lead to designs that aim at maximizing packet delivery rate and
minimizing latency and jitter. Additionally, given that the network
nodes often do not have an unlimited power supply, energy consumption
needs to be minimized as well.
As an example, to meet this goal, IEEE Std. 802.15.4
[IEEE802154-2015] provides Time-Slotted Channel Hopping (TSCH), a
mode of operation which uses a fixed communication schedule to allow
Show full document text