Common Ancestor Objective Functions and Parent Set DAG Metric Container Extension
draft-ietf-roll-nsa-extension-04
ROLL R. Koutsiamanis, Ed.
Internet-Draft G. Papadopoulos
Intended status: Standards Track N. Montavont
Expires: January 9, 2020 IMT Atlantique
P. Thubert
Cisco
July 8, 2019
Common Ancestor Objective Functions and Parent Set DAG Metric Container
Extension
draft-ietf-roll-nsa-extension-04
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. This document also describes Objective Functions
which take advantage of this information to implement multi-path
routing.
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 January 9, 2020.
Copyright Notice
Copyright (c) 2019 IETF Trust and the persons identified as the
document authors. All rights reserved.
Koutsiamanis, et al. Expires January 9, 2020 [Page 1]
Internet-Draft CA OF and PS DAG MC Extension July 2019
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
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 . . . . . . . . . . . . . . . . . . . . . . . . . 4
3. Common Ancestor Objective Functions . . . . . . . . . . . . . 4
3.1. Common Ancestor Strict . . . . . . . . . . . . . . . . . 6
3.2. Common Ancestor Medium . . . . . . . . . . . . . . . . . 7
3.3. Common Ancestor Relaxed . . . . . . . . . . . . . . . . . 8
3.4. Usage . . . . . . . . . . . . . . . . . . . . . . . . . . 8
4. Node State and Attribute (NSA) object type extension . . . . 8
4.1. Usage . . . . . . . . . . . . . . . . . . . . . . . . . . 10
5. Controlling PRE . . . . . . . . . . . . . . . . . . . . . . . 10
6. Security Considerations . . . . . . . . . . . . . . . . . . . 11
7. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 11
8. References . . . . . . . . . . . . . . . . . . . . . . . . . 11
8.1. Informative references . . . . . . . . . . . . . . . . . 11
8.2. Other Informative References . . . . . . . . . . . . . . 12
Appendix A. Implementation Status . . . . . . . . . . . . . . . 12
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 14
1. Introduction
Network-enabled applications in the industrial context must provide
stringent guarantees in terms of reliability and predictability. To
achieve this they typically leverage 1+1 redundancy, also known as
Packet Replication and Elimination (PRE)
[I-D.papadopoulos-6tisch-pre-reqs]. Allowing these kinds of
applications to function over wireless networks requires the
application of the principles of Deterministic Networking
[I-D.ietf-detnet-architecture]. This results in designs which aim at
optimizing packet delivery rate and bounding latency. 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]
provides Time-Slotted Channel Hopping (TSCH), a mode of operation
which uses a common communication schedule based on timeslots to
Show full document text