Hi Pascal,
The text reads very nice. It captures the notion of abstraction we have been
discussing about very well.
In the last para below which mentions the negotiation of time slots, can we,
for instance, be able to define an SF to meet certain delay requirements
of flows ? There
could be other possibilities too.
Anand
On Friday 03 June 2016 11:54 PM, Pascal Thubert (pthubert) wrote:
Dear all: > > As discussed at the last Interim, please find proposed text in the
6TiSCH architecture below. > > What do you think? > > Pascal > > 4.2.2.
Scheduling Functions and the 6P protocol > > In the case of soft
cells, the cell management entity that controls > the dynamic
attribution of cells to adapt to the dynamics of variable > rate
flows is called a Scheduling Function (SF). There may be > multiple
SFs with more or less aggressive reaction to the dynamics of > the
network. The 6TiSCH 6top Scheduling Function Zero (SF0) >
[I-D.ietf-6tisch-6top-sf0] provides a simple scheduling function that
> can be used by default by devices that support dynamic scheduling
of > soft cells. > > The SF is logically divided in an abstract
bandwidth adaptation logic > that is abstract to the particular
technology used to obtain and > release bandwidth, and a underlying
service sublayer that maps those > needs in the actual technology,
which means identifying the > appropriate cells in the context of
TSCH. > > +------------------------+
+------------------------+ > | Scheduling Function | |
Scheduling Function | > | Bandwidth adaptation | |
Bandwidth adaptation | > +------------------------+
+------------------------+ > | Scheduling Function | |
Scheduling Function | > | TSCH mapping to cells | | TSCH
mapping to cells | > +------------------------+
+------------------------+ > | 6top cells negotiation | <- 6P -> |
6top cells negotiation | > +------------------------+
+------------------------+ > > > Figure 6: SF/6P
stack in 6top > > The SF relies on 6top services that implement the
6top Protocol (6P) > [I-D.ietf-6tisch-6top-protocol] to negotiate the
precise cells that > will be allocated or freed based on the
schedules of the peer. It > may be for instance that a peer wants to
use a particular time slot > that is free in its schedule, but that
timeslot is already in use by > the other peer for a communication
with a third party on a different > cell. The 6P protocol enables
the peers to find an agreement in a > transactional manner that
ensures the final consistency of the nodes > state. > >
_______________________________________________ > 6tisch mailing list >
[email protected] > https://www.ietf.org/mailman/listinfo/6tisch >
_______________________________________________
6tisch mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/6tisch
