6TiSCH 6top Scheduling Function Zero (SF0)
draft-dujovne-6tisch-6top-sf0-01
| Document | Type | Replaced Internet-Draft (individual) | |
|---|---|---|---|
| Last updated | 2016-03-21 | ||
| Replaced by | draft-ietf-6tisch-6top-sf0 | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
plain text
pdf
html
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Replaced by draft-ietf-6tisch-6top-sf0 | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-dujovne-6tisch-6top-sf0-01.txt
Abstract
This document defines a 6top Scheduling Function called "Scheduling Function Zero" (SF0). SF0 dynamically adapts the number of reserved cells between neighbor nodes, based on the currently allocated bandwidth and the neighbour nodes' requirements. Neighbor nodes negotiate in a distributed neighbor-to-neighbor basis the cell(s) to be added/deleted. SF0 uses the 6P signaling messages to add/delete cells in the schedule. Some basic rules for deciding when to add/ delete cells and for selecting the cells to be added/deleted within the schedule are also provided.
Authors
Diego Dujovne
(diego.dujovne@mail.udp.cl)
Luigi Grieco
(a.grieco@poliba.it)
Maria Palattella
(maria-rita.palattella@uni.lu)
Nicola Accettura
(nicola.accettura@eecs.berkeley.edu)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)