Scheduling Function One (SF1) for hop-by-hop Scheduling in 6tisch Networks
draft-satish-6tisch-6top-sf1-03
Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
---|---|---|---|
Authors | Satish Anamalamudi , Mingui Zhang , Abdur Rashid Sangi , Charles E. Perkins , S.V.R Anand | ||
Last updated | 2017-08-06 (Latest revision 2017-02-02) | ||
RFC stream | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
This document defines a 6top Scheduling Function called "Scheduling Function One" (SF1) to reserve, label and schedule the end-to-end resources hop-by-hop through the Distributed Resource Reservation Protocol(RSVP). SF1 uses the 6P signaling messages with a global TrackID to add or delete the cells in L2-bundles of isolated traffic flows.
Authors
Satish Anamalamudi
Mingui Zhang
Abdur Rashid Sangi
Charles E. Perkins
S.V.R Anand
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)