Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Performance of Network Redundancy Mechanisms in SCTP
Karlstad University, Division for Information Technology.ORCID iD: 0000-0002-6723-881X
Karlstad University, Division for Information Technology.ORCID iD: 0000-0001-7311-9334
2005 (English)Report (Other academic)
Abstract [en]

One of the ambitions when designing the Stream Control Transmission Protocol was to offer a robust transfer of traffic between hosts. For this reason SCTP was designed to support multihoming, which presumes the possibility to set up several paths between the same hosts in the same session. If the primary path between a source machine and a destination machine breaks down, the traffic may still be sent to the destination, by utilizing one of the alternate paths. The failover that occurs when changing path is to be transparent to the application.

This paper describes the results from experiments concerning SCTP failover performance, which means the time between occurrence of a break on the primary path until the traffic is run smoothly on the alternate path. The experiments are performed mainly to verify the Linux Kernel implementation of SCTP (LK-SCTP) and is run on the Emulab platform. The results will serve as a basis for further experiments.

The experiments are performed in a network without concurrent traffic and in conclusion the results from the experiments correspond well to the values found in other studies and they are close to the theoretical best values. As expected the parameter Path.Max.Retrans has a great impact on the failover time. One observation is that the failover time and the max transfer time for a message are dependent upon the status in the network when the break of the primary path occurs.

Place, publisher, year, edition, pages
2005.
Series
Karlstad University Studies, ISSN 1403-8099 ; 2005:48
Keywords [en]
SCTP, failover, performance measurement
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kau:diva-2402ISBN: 91-7063-019-4 (print)OAI: oai:DiVA.org:kau-2402DiVA, id: diva2:24742
Available from: 2010-06-01 Created: 2010-06-01 Last updated: 2018-06-04Bibliographically approved
In thesis
1. On Switchover Performance in Multihomed SCTP
Open this publication in new window or tab >>On Switchover Performance in Multihomed SCTP
2010 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

The emergence of real-time applications, like Voice over IP and video conferencing, in IP networks implies a challenge to the underlying infrastructure. Several real-time applications have requirements on timeliness as well as on reliability and are accompanied by signaling applications to set up, tear down and control the media sessions. Since neither of the traditional transport protocols responsible for end-to-end transfer of messages was found suitable for signaling traffic, the Stream Control Transmission Protocol (SCTP) was standardized. The focus for the protocol was initially on telephony signaling applications, but it was later widened to serve as a general purpose transport protocol. One major new feature to enhance robustness in SCTP is multihoming, which enables for more than one path within the same association.

In this thesis we evaluate some of the mechanisms affecting transmission performance in case of a switchover between paths in a multihomed SCTP session. The major part of the evaluation concerns a failure situation, where the current path is broken. In case of failure, the endpoint does not get an explicit notification, but has to react upon missing acknowledgements. The challenge is to distinguish path failure from temporary congestion to decide  when to switch to an alternate path. A too fast switchover may be spurious, which could reduce transmission performance, while a too late switchover also results in reduced transmission performance. This implies a tradeoff which involves several protocol as well as network parameters and we elaborate among these to give a coherent view of the parameters and their interaction. Further, we present a recommendation on how to tune the parameters to meet  telephony signaling requirements, still without violating fairness to other traffic.

We also consider another angle of switchover performance, the startup on the alternate path. Since the available capacity is usually unknown to the sender, the transmission on a new path is started at a low rate and then increased as acknowledgements of successful transmissions return. In case of switchover in the middle of a media session the startup phase after a switchover could cause problems to the application. In multihomed SCTP the availability of the alternate path makes it feasible for the end-host to estimate the available capacity on the alternate path prior to the switchover. Thus, it would be possible to implement a more efficient startup scheme. In this thesis we combine different switchover scenarios with relevant traffic. For these combinations, we analytically evaluate and quantify the potential performance gain from utilizing an ideal startup mechanism as compared to the traditional startup procedure.

Place, publisher, year, edition, pages
Karlstad: Karlstad University, 2010. p. 127
Series
Karlstad University Studies, ISSN 1403-8099 ; 2010:12
Keywords
Computer Networking, Transport Protocols, Multihoming, Performance Evaluation, Signaling Traffic
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-5501 (URN)978-91-7063-298-3  (ISBN)
Presentation
2010-05-19, Fryxellsalen, 1B 306, Karlstads universitet, Karlstad, 10:00 (Swedish)
Opponent
Supervisors
Available from: 2010-06-03 Created: 2010-03-25 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

fulltext(1712 kB)222 downloads
File information
File name FULLTEXT01.pdfFile size 1712 kBChecksum SHA-512
ed031217c58c0041d52067e40f910d0004ee13c71535fecdfb7bd5a5e363e849e62fe8e5e7ed4eedfaf337d8a18b5b8b4e3ca97b99c7038beeb1baa586d66e31
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Eklund, JohanBrunstrom, Anna
By organisation
Division for Information Technology
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 222 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 524 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf