Common Ancestor Objective Function and Parent Set DAG Metric Container Extension
draft-ietf-roll-nsa-extension-08
ROLL R.-A. Koutsiamanis, Ed.
Internet-Draft G.Z. Papadopoulos
Intended status: Standards Track N. Montavont
Expires: 28 September 2020 IMT Atlantique
P. Thubert
Cisco
27 March 2020
Common Ancestor Objective Function and Parent Set DAG Metric Container
Extension
draft-ietf-roll-nsa-extension-08
Abstract
Packet Replication and Elimination is a method in which several
copies of a data packet are sent in the network in order to achieve
high reliability and low jitter. This document details how to apply
Packet Replication and Elimination in RPL, especially how to exchange
information within RPL control packets to let a node better select
the different parents that will be used to forward the multiple
copies of a packet. This document also describes the Objective
Function which takes 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 28 September 2020.
Copyright Notice
Copyright (c) 2020 IETF Trust and the persons identified as the
document authors. All rights reserved.
Koutsiamanis, et al. Expires 28 September 2020 [Page 1]
Internet-Draft CA OF and PS DAG MC Extension March 2020
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 AP Selection Policies . . . . . . . . . . . . 4
3.1. Common Ancestor Strict . . . . . . . . . . . . . . . . . 5
3.2. Common Ancestor Medium . . . . . . . . . . . . . . . . . 6
3.3. Common Ancestor Relaxed . . . . . . . . . . . . . . . . . 6
4. Common Ancestor Objective Function . . . . . . . . . . . . . 6
4.1. Usage . . . . . . . . . . . . . . . . . . . . . . . . . . 8
5. Node State and Attribute (NSA) object type extension . . . . 9
5.1. Usage . . . . . . . . . . . . . . . . . . . . . . . . . . 11
6. Controlling PRE . . . . . . . . . . . . . . . . . . . . . . . 12
7. Security Considerations . . . . . . . . . . . . . . . . . . . 12
8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 12
9. References . . . . . . . . . . . . . . . . . . . . . . . . . 12
9.1. Informative references . . . . . . . . . . . . . . . . . 12
9.2. Other Informative References . . . . . . . . . . . . . . 14
Appendix A. Implementation Status . . . . . . . . . . . . . . . 14
Appendix B. Choosing an AP selection policy . . . . . . . . . . 16
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 17
1. Introduction
Networks in the industrial context must provide stringent guarantees
in terms of reliability and predictability, with this domain being
one of main ones addressed by Deterministic Networking [RFC8557].
Packet Replication and Elimination (PRE)
[I-D.papadopoulos-raw-pareo-reqs] is a technique which allows
redundant paths in the network to be utilized for traffic requiring
higher reliability. Allowing industrial applications to function
over wireless networks requires the application of the principles and
architecture of Deterministic Networking [RFC8655]. This results in
designs which aim at optimizing packet delivery rate and bounding
latency. Additionally, nodes operating on battery need to minimize
Show full document text