SCTP-PF: Quick Failover Algorithm in SCTP
draft-ietf-tsvwg-sctp-failover-10

The information below is for an old version of the document
Document Type Active Internet-Draft (tsvwg WG)
Authors Yoshifumi Nishida  , Preethi Natarajan  , Armando Caro  , Paul Amer  , Karen Nielsen 
Last updated 2015-03-09
Replaces draft-nishida-tsvwg-sctp-failover
Stream IETF
Intended RFC status Proposed Standard
Formats pdf htmlized (tools) htmlized bibtex
Reviews
Stream WG state Waiting for WG Chair Go-Ahead
Doc Shepherd Follow-up Underway
Document shepherd Gorry Fairhurst
IESG IESG state AD is watching
Consensus Boilerplate Unknown
Telechat date
Responsible AD Martin Stiemerling
Send notices to tsvwg-chairs@ietf.org, draft-ietf-tsvwg-sctp-failover@ietf.org, "Gorry Fairhurst" <gorry@erg.abdn.ac.uk>
Network Working Group                                         Y. Nishida
Internet-Draft                                        GE Global Research
Intended status: Standards Track                            P. Natarajan
Expires: September 10, 2015                                Cisco Systems
                                                                 A. Caro
                                                        BBN Technologies
                                                                 P. Amer
                                                  University of Delaware
                                                              K. Nielsen
                                                                Ericsson
                                                           March 9, 2015

               SCTP-PF: Quick Failover Algorithm in SCTP
                 draft-ietf-tsvwg-sctp-failover-10.txt

Abstract

   One of the major advantages of SCTP is the support of multi-homed
   communication.  A multi-homed SCTP end-point has the ability to
   withstand network failures by migrating the traffic from an inactive
   network to an active one.  However, if the failover operation as
   specified in RFC4960 is followed, there can be a significant delay in
   the migration to the active destination addresses, thus severely
   reducing the effectiveness of the SCTP failover operation.

   This document complements RFC4960 by the introduction of a new path
   state, the Potentially Failed (PF) path state, and an associated new
   failover operation to apply during a network failure.  The algorithm
   defined is called SCTP Potentially Failed Algorithm, SCTP-PF for
   short.  In addition, the document complements RFC4960 by introducing
   alternative switchover operation modes for the data transfer path
   management after the recovery of a failed primary path.  These modes
   can allow improvements in the performance of the operation in some
   network environments.  The implementation of the additional
   switchover operation modes is an optional part of SCTP-PF.

   The procedures defined in the document require only minimal
   modifications to the current specification.  The procedures are
   sender-side only and do not impact the SCTP receiver.

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

Nishida, et al.        Expires September 10, 2015               [Page 1]

Internet-Draft                   SCTP-PF                      March 2015

   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at http://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 September 10, 2015.

Copyright Notice

   Copyright (c) 2015 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
   (http://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  . . . . . . . . . . . . . . . . . . . . . . . .   3
   2.  Conventions and Terminology . . . . . . . . . . . . . . . . .   4
   3.  Issues with the SCTP Path Management  . . . . . . . . . . . .   4
   4.  SCTP with Potentially-Failed Destination State (SCTP-PF)  . .   5
     4.1.  SCTP-PF Concept . . . . . . . . . . . . . . . . . . . . .   5
     4.2.  Specification of the SCTP-PF Algorithm  . . . . . . . . .   6
       4.2.1.  Dormant State Operation . . . . . . . . . . . . . . .  10
     4.3.  Permanent Failover  . . . . . . . . . . . . . . . . . . .  12
       4.3.1.  Background  . . . . . . . . . . . . . . . . . . . . .  12
       4.3.2.  Permanent Failover Algorithm  . . . . . . . . . . . .  12
   5.  Socket API Considerations . . . . . . . . . . . . . . . . . .  13
     5.1.  Support for the Potentially Failed Path State . . . . . .  14
     5.2.  Peer Address Thresholds (SCTP_PEER_ADDR_THLDS) Socket
           Option  . . . . . . . . . . . . . . . . . . . . . . . . .  15
     5.3.  Exposing the Potentially Failed Path State
Show full document text