6TiSCH Experimental Scheduling Function (SFX)
draft-ietf-6tisch-6top-sfx-01
6TiSCH D. Dujovne, Ed.
Internet-Draft Universidad Diego Portales
Intended status: Experimental LA. Grieco
Expires: September 6, 2018 Politecnico di Bari
MR. Palattella
Luxembourg Institute of Science and Technology (LIST)
N. Accettura
LAAS-CNRS
March 5, 2018
6TiSCH Experimental Scheduling Function (SFX)
draft-ietf-6tisch-6top-sfx-01
Abstract
This document defines a Scheduling Function called "Experimental
Scheduling Function" (SFX). SFX 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. SFX 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 September 6, 2018 [Page 1]
Internet-Draft 6tisch-6top-sfx March 2018
This Internet-Draft will expire on September 6, 2018.
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
(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 . . . . . . . . . . . . . . . . . . . . . . . . 3
2. Scheduling Function Identifier . . . . . . . . . . . . . . . 3
3. Allocated and Used Cells . . . . . . . . . . . . . . . . . . 3
4. Overprovisioning . . . . . . . . . . . . . . . . . . . . . . 3
5. Scheduling Algorithm . . . . . . . . . . . . . . . . . . . . 4
5.1. SFX Triggering Events . . . . . . . . . . . . . . . . . . 4
5.2. SFX Cell Estimation Algorithm . . . . . . . . . . . . . . 4
5.3. SFX Allocation Policy . . . . . . . . . . . . . . . . . . 5
6. Rules for CellList . . . . . . . . . . . . . . . . . . . . . 7
7. 6P Timeout Value . . . . . . . . . . . . . . . . . . . . . . 7
8. Meaning of Metadata Information . . . . . . . . . . . . . . . 8
9. Node Behavior at Boot . . . . . . . . . . . . . . . . . . . . 8
10. Cell Type . . . . . . . . . . . . . . . . . . . . . . . . . . 8
11. SFX Statistics . . . . . . . . . . . . . . . . . . . . . . . 8
12. Relocating Cells . . . . . . . . . . . . . . . . . . . . . . 8
13. Forced Cell Deletion Policy . . . . . . . . . . . . . . . . . 9
14. 6P Error Handling . . . . . . . . . . . . . . . . . . . . . . 9
15. Experimental requirements . . . . . . . . . . . . . . . . . . 9
16. Security Considerations . . . . . . . . . . . . . . . . . . . 10
17. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 10
17.1. SFX Scheduling Function Identifiers . . . . . . . . . . 10
18. Acknowledgments . . . . . . . . . . . . . . . . . . . . . . . 10
19. References . . . . . . . . . . . . . . . . . . . . . . . . . 11
19.1. Normative References . . . . . . . . . . . . . . . . . . 11
Show full document text