Quick Failover Algorithm in SCTP
draft-nishida-natarajan-sctp-failover-00
| Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
|---|---|---|---|
| Authors | Yoshifumi Nishida , Preethi Natarajan | ||
| Last updated | 2010-02-22 | ||
| RFC stream | (None) | ||
| Intended RFC status | (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
One of the major advantages in SCTP is supporting multi-homing communication. If an 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
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)