WIDE Paper-List in 2009 Quick Failover Algorithm in SCTP wide-paper-sctp-nishida-failover-2009-00.txt WIDE Project: http://www.wide.ad.jp/ If you have any comments on this document, please contact to ad@wide.ad.jp. Title: Quick Failover Algorithm in SCTP Author(s): Yoshifumi Nishida (nishida@sfc.wide.ad.jp) Date: 2009-12-13 % - Internet-Draft @manual{ Nishida:failover-00, author = "Yoshifumi Nishida", title = "Quick Failover Algorithm in SCTP" note = "draft-nishida-sctp-failover-00" month = "December", year = 2009 } # Additional data for readers url: http://tools.ietf.org/search/draft-nishida-sctp-failover-00 x-wide-wgnames: sctp keywords: sctp, multipath, failover references: summary_ja: summary: One of the major advantages in SCTP is supporting multi-homing communication. If an multi-homed end-point has redundant network onnections, 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.