Publication | Closed Access
6TiSCH 6top Scheduling Function Zero (SF0)
32
Citations
0
References
2017
Year
Unknown Venue
Job SchedulerEngineeringNeighbor NodesDynamic Resource AllocationScheduling ProblemCell RequirementsCloud SchedulingComputer EngineeringNetwork AnalysisSystems EngineeringScheduling (Computing)Computer ScienceParallel ComputingCombinatorial OptimizationFunction ZeroScheduling Function ZeroOperations Research
This document defines a Scheduling Function called Scheduling Function Zero (SF0). 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.