Traffic-aware Objective Function
draft-ji-roll-traffic-aware-objective-function-03

Document Type Active Internet-Draft (individual)
Last updated 2018-10-22
Replaces draft-ji-traffic-aware-objective-function
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
ROLL                                                          C. Ji, Ed.
Internet-Draft                             Alexander TEI of Thessaloniki
Intended status: Standards Track                         R. Koutsiamanis
Expires: April 22, 2019                                  G. Papadopoulos
                                                          IMT Atlantique
                                                              D. Dujovne
                                              Universidad Diego Portales
                                                            N. Montavont
                                                          IMT Atlantique
                                                        October 19, 2018

                    Traffic-aware Objective Function
           draft-ji-roll-traffic-aware-objective-function-03

Abstract

   This document proposes a remaining throughput metric for parent and
   DODAG selection.  This metric represents the amount of remaining
   traffic handling capacity that the node has.  This document also
   proposes an Objective Function (OF) which uses the proposed metric
   for parent and DODAG selection to balance the amount of traffic
   between nodes and DODAGs.

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 April 22, 2019.

Copyright Notice

   Copyright (c) 2018 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

Ji, et al.               Expires April 22, 2019                 [Page 1]
Internet-Draft              Traffic-aware OF                October 2018

   (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 . . . . . . . . . . . . . . . . . . . . . . . . .   3
   3.  DODAG construction in RPL . . . . . . . . . . . . . . . . . .   3
   4.  Load distribution problem in RPL  . . . . . . . . . . . . . .   3
     4.1.  Parent selection problem  . . . . . . . . . . . . . . . .   4
     4.2.  DODAG selection problem . . . . . . . . . . . . . . . . .   6
   5.  TAOF description  . . . . . . . . . . . . . . . . . . . . . .   8
   6.  DIO Metric Container Type extension . . . . . . . . . . . . .   9
   7.  Enrollment  . . . . . . . . . . . . . . . . . . . . . . . . .  11
   8.  Security Considerations . . . . . . . . . . . . . . . . . . .  12
   9.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  12
   10. Informative references  . . . . . . . . . . . . . . . . . . .  12
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  13

1.  Introduction

   RPL [RFC6550] is an IPv6 Routing protocol for LLNs.  It uses
   Objective Functions (OF) to construct the Destination Oriented
   Directed Acyclic Graph (DODAG) containing the nodes of the network.
   The existing OFs defined are OF Zero (OF0) [RFC6552] and Minimum Rank
   with Hysteresis OF (MRHOF) [RFC6719].  These OFs specify how nodes in
   a DODAG select their preferred parent using different metrics.

   The metrics can be separated into two different types, link metrics
   (e.g.  ETX) and node metrics (e.g. energy).  Experimental results
   [I-D.qasem-roll-rpl-load-balancing] conclude that using the current
   OFs leads to an unbalanced network within which some nodes are
   overloaded.  Here, a node is overloaded in the sense that it forwards
   many more packets than it otherwise would if the network were
   balanced.  This problem has consequences for the lifetime of the
   network because overloaded nodes drain quicker than others, a problem
   which becomes even more significant when the overloaded nodes are
   near the DODAG root [I-D.qasem-roll-rpl-load-balancing].

   Similarly, one DODAG might be overloaded in the same sense compared
   to another DODAG, and this will lead to the same consequences for the
Show full document text