6TiSCH 6top Scheduling Function Zero / Experimental (SFX)
draft-ietf-6tisch-6top-sfx-00

Document Type Active Internet-Draft (6tisch WG)
Last updated 2017-09-25
Replaces draft-ietf-6tisch-6top-sf0
Stream IETF
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state I-D Exists
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)
6TiSCH                                                   D. Dujovne, Ed.
Internet-Draft                                Universidad Diego Portales
Intended status: Experimental                                 LA. Grieco
Expires: March 26, 2018                              Politecnico di Bari
                                                          MR. Palattella
                   Luxembourg Institute of Science and Technology (LIST)
                                                            N. Accettura
                                                               LAAS-CNRS
                                                      September 22, 2017

       6TiSCH 6top Scheduling Function Zero / Experimental (SFX)
                     draft-ietf-6tisch-6top-sfx-00

Abstract

   This document defines a Scheduling Function called "Scheduling
   Function Zero" (SF0) in its Experimental version.  SF0 dynamically
   adapts the number of scheduled cells between neighbor nodes, based on
   the amount of currently allocated cells and the neighbor nodes' cell
   requirements.  Neighbor nodes negotiate in a distributed neighbor-to-
   neighbor basis the number of cell(s) to be added/deleted.  SF0 uses
   the 6P signaling messages to add/delete cells in the schedule.  This
   function selects the candidate cells from the schedule, defines which
   cells will be added/deleted and triggers the allocation/deallocation
   process.

Requirements Language

   The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
   "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and
   "OPTIONAL" in this document are to be interpreted as described in RFC
   2119 [RFC2119].

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."

Dujovne, et al.          Expires March 26, 2018                 [Page 1]
Internet-Draft               6tisch-6top-sfx              September 2017

   This Internet-Draft will expire on March 26, 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
   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.  TEMPORARY EDITORIAL NOTES . . . . . . . . . . . . . . . . . .   3
   2.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   3
   3.  Scheduling Function Identifier  . . . . . . . . . . . . . . .   4
   4.  Allocated and Used Cells  . . . . . . . . . . . . . . . . . .   4
   5.  Overprovisioning  . . . . . . . . . . . . . . . . . . . . . .   4
   6.  Scheduling Algorithm  . . . . . . . . . . . . . . . . . . . .   4
     6.1.  SF0 Triggering Events . . . . . . . . . . . . . . . . . .   4
     6.2.  SF0 Cell Estimation Algorithm . . . . . . . . . . . . . .   5
     6.3.  SF0 Allocation Policy . . . . . . . . . . . . . . . . . .   6
   7.  Rules for CellList  . . . . . . . . . . . . . . . . . . . . .   8
   8.  6P Timeout Value  . . . . . . . . . . . . . . . . . . . . . .   8
   9.  Meaning of Metadata Information . . . . . . . . . . . . . . .   9
   10. Node Behavior at Boot . . . . . . . . . . . . . . . . . . . .   9
   11. Cell Type . . . . . . . . . . . . . . . . . . . . . . . . . .   9
   12. SF0 Statistics  . . . . . . . . . . . . . . . . . . . . . . .   9
   13. Relocating Cells  . . . . . . . . . . . . . . . . . . . . . .   9
   14. Forced Cell Deletion Policy . . . . . . . . . . . . . . . . .  10
   15. 6P Error Handling . . . . . . . . . . . . . . . . . . . . . .  10
   16. Experimental requirements . . . . . . . . . . . . . . . . . .  10
   17. Examples  . . . . . . . . . . . . . . . . . . . . . . . . . .  11
Show full document text