Scheduling Function One (SF1): hop-by-hop Scheduling with RSVP-TE in 6tisch Networks
draft-satish-6tisch-6top-sf1-04

Document Type Active Internet-Draft (individual)
Last updated 2017-10-27
Stream (None)
Intended RFC status (None)
Formats plain text pdf html bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
6tisch                                                    S. Anamalamudi
Internet-Draft                           Huaiyin Institute of Technology
Intended status: Standards Track                                  B. Liu
Expires: April 30, 2018                                         M. Zhang
                                                     Huawei Technologies
                                                               AR. Sangi
                                         Huaiyin Institute of Technology
                                                              C. Perkins
                                                               Futurewei
                                                             S.V.R.Anand
                                             Indian Institute of Science
                                                        October 27, 2017

  Scheduling Function One (SF1): hop-by-hop Scheduling with RSVP-TE in
                            6tisch Networks
                    draft-satish-6tisch-6top-sf1-04

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 Resource ReserVation Protocol -
   Traffic Engineering (RSVP-TE).  SF1 uses the 6P signaling messages
   with a global TrackID to add or delete the cells in L2-bundles of
   isolated traffic flows.

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."

   This Internet-Draft will expire on April 30, 2018.

Anamalamudi, et al.      Expires April 30, 2018                 [Page 1]
Internet-Draft        draft-satish-6tisch-6top-sf1          October 2017

Copyright Notice

   Copyright (c) 2017 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  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Operation of Scheduling Function One (SF1)  . . . . . . . . .   4
     2.1.  End-to-end Operation  . . . . . . . . . . . . . . . . . .   4
     2.2.  One-hop Operation . . . . . . . . . . . . . . . . . . . .   6
       2.2.1.  3-step transaction  . . . . . . . . . . . . . . . . .   6
       2.2.2.  2-step transaction  . . . . . . . . . . . . . . . . .   7
     2.3.  Reroute and Bandwidth Increase mechanism  . . . . . . . .   8
     2.4.  Error Codes . . . . . . . . . . . . . . . . . . . . . . .   8
   3.  Message Format  . . . . . . . . . . . . . . . . . . . . . . .   8
     3.1.  RSVP-PATH message . . . . . . . . . . . . . . . . . . . .   9
     3.2.  RSVP-RESV message . . . . . . . . . . . . . . . . . . . .  10
   4.  Scheduling Function Identifier  . . . . . . . . . . . . . . .  11
   5.  IANA Considerations . . . . . . . . . . . . . . . . . . . . .  11
   6.  Security Considerations . . . . . . . . . . . . . . . . . . .  11
   7.  References  . . . . . . . . . . . . . . . . . . . . . . . . .  11
     7.1.  References  . . . . . . . . . . . . . . . . . . . . . . .  11
     7.2.  Informative References  . . . . . . . . . . . . . . . . .  12
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  12

1.  Introduction

   Scheduling Function Zero (SF0) [I-D.ietf-6tisch-6top-sf0] enables on-
   the-fly cell scheduling (ADD/DELETE) between one-hop neighbors for
   aggregated (best-effort) traffic flows.  In other words, all the
   instances from nodeA to nodeB in Figure 1 are scheduled in a single
   L3-bundle (IP link).

Anamalamudi, et al.      Expires April 30, 2018                 [Page 2]
Internet-Draft        draft-satish-6tisch-6top-sf1          October 2017
Show full document text