Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Improving the Timeliness of SCTP Message Transfers
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science.ORCID iD: 0000-0002-8731-2482
2008 (English)Licentiate thesis, monograph (Other academic)
Abstract [en]

Due to the cheap and flexible framework that the underlying IP-technology of the internet provides, IP-networks are becoming popular in more and more contexts. For instance, telecommunication operators have started to replace the fixed legacy telephony networks with IP-networks. To support a smooth transition towards IP-networks, the Stream Control Transmission Protocol (SCTP) was standardized. SCTP is used to carry telephony signaling traffic, and solves a number of problems that would have followed from using the Transmission Control Protocol (TCP) in this context. However, the design of SCTP is still heavily influenced by TCP. In fact, many protocol mechansisms in SCTP are directly inherited from TCP. Unfortunately, many of these mechanisms are not adapted to the kind of traffic that SCTP is intended to transport: time critical message-based traffic, e.g. telephony signaling.





In this thesis we examine, and adapt some of SCTPs mechanisms to more efficiently transport time critical message-based traffic. More specifically, we adapt SCTPs loss recovery and message bundling for timely message transfers. First, we propose and experimentally evaluate two loss recovery mechanisms: a packet-based Early Retransmit algorithm, and a modified retransmission timeout management algorithm. We show that these enhancements can reduce loss recovery times with at least 30 50%, in some scenarios. In addition, we adapt the message bundling of SCTP to better support timely message delivery. The proposed bundling algorithm can in some situations reduce the transfer time of a message with up to 70%.





In addition to these proposals we also indentify and report mistakes in some of the most popular SCTP implementations. Furthermore, we have continuously developed the network emulation software KauNet to support our experimental evaluations

Place, publisher, year, edition, pages
Karlstad: Karlstad University Studies , 2008.
Keyword [en]
SCTP, transport protocols, network emulation, loss recovery, Nagle algorithm
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-20244ISBN: 9789170632020 (print)OAI: oai:DiVA.org:kau-20244DiVA: diva2:593901
Available from: 2013-01-21 Created: 2013-01-21 Last updated: 2014-11-21

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Hurtig, Per
By organisation
Department of Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 75 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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