Skip to main content

Quick Failover Algorithm in SCTP
draft-ietf-tsvwg-sctp-failover-00

The information below is for an old version of the document.
Document Type Expired Internet-Draft (tsvwg WG)
Authors Yoshifumi Nishida , Preethi Natarajan , Armando L. Caro
Last updated 2013-05-10 (Latest revision 2012-11-06)
Replaces draft-nishida-tsvwg-sctp-failover
Stream Internet Engineering Task Force (IETF)
Formats
Expired & archived
plain text xml htmlized pdfized bibtex
Reviews
Stream WG state WG Document
Document shepherd (None)
IESG IESG state Expired (IESG: Dead)
Consensus boilerplate Unknown
Telechat date (None)
Responsible AD Martin Stiemerling
Send notices to tsvwg-chairs@tools.ietf.org, draft-ietf-tsvwg-sctp-failover@tools.ietf.org
This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at:
https://www.ietf.org/archive/id/draft-ietf-tsvwg-sctp-failover-00.txt

Abstract

One of the major advantages in SCTP is supporting multi-homing communication. If a multi-homed end-point has redundant network connections, SCTP sessions can have a good chance to survive from network failures by migrating inactive network to active one. However, if we follow the SCTP standard, there can be significant delay for the network migration. During this migration period, SCTP cannot transmit much data to the destination. This issue drastically impairs the usability of SCTP in some situations. This memo describes the issue of SCTP failover mechanism and discuss its solutions which require minimal modification to the current standard.

Authors

Yoshifumi Nishida
Preethi Natarajan
Armando L. Caro

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)