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

Document Type Active Internet-Draft (individual)
Last updated 2017-12-06
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                                           R. Koutsiamanis
Intended status: Standards Track                         G. Papadopoulos
Expires: June 9, 2018                                     IMT Atlantique
                                                              D. Dujovne
                                              Universidad Diego Portales
                                                            N. Montavont
                                                          IMT Atlantique
                                                        December 6, 2017

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

Abstract

   This document proposes a packet transmission rate metric for parent
   selection.  This metric represents the amount of traffic that the
   node is transmitting to the current parent node.  This document also
   proposes an Objective Function (OF) using the packet transmission
   rate metric for parent selection in order to balance the amount of
   traffic between nodes.

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 June 9, 2018.

Copyright Notice

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

Ji, et al.                Expires June 9, 2018                  [Page 1]
Internet-Draft              Traffic-aware OF               December 2017

   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
   5.  TAOF description  . . . . . . . . . . . . . . . . . . . . . .   5
   6.  DIO Metric Container Type extension . . . . . . . . . . . . .   6
   7.  Security Considerations . . . . . . . . . . . . . . . . . . .   7
   8.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .   7
   9.  Informative references  . . . . . . . . . . . . . . . . . . .   8
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .   8

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 of the nodes are
   overloaded.  In this case, a node is overloaded in the sense that it
   forwards much more packets than it otherwise would if the network
   were balanced.  This problem has consequences for the lifetime of the
   network because overloaded nodes tend to 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].

   This problem is still an open issue and this draft proposes a new way
   of parent selection as an attempt towards a solution.  This draft
   proposes a new OF that considers the packet transmission rate as a
   representation of traffic each node faces and use this information to
   balance the amount of traffic between nodes.

   In brief, each node tracks its packet transmission rate and appends
Show full document text