Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Performance Analysis and Improvement of PR-SCTP for Small Messages
Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. (DISCO)ORCID-id: 0000-0003-2765-7873
Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. (PRISEC)
Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. (DISCO)ORCID-id: 0000-0001-7311-9334
Karlstads universitet, Fakulteten för ekonomi, kommunikation och IT, Avdelningen för datavetenskap. (PRISEC)ORCID-id: 0000-0003-0778-4736
2013 (engelsk)Inngår i: Computer Networks, ISSN 1389-1286, Vol. 57, nr 18, s. 3967-3986Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

PR-SCTP, a partially reliable extension of SCTP, provides a flexible QoS trade-off between timeliness and reliability for application traffic. However, the performance of PR-SCTP can be reduced due to certain traffic characteristics and network scenarios. Previously, we proposed a NR-SACK based optimization for PR-SCTP. In this work we extensively evaluate and analyze the performance of PR-SCTP with NR-SACKs using different network scenarios. Moreover, we compare the performance of our NR-SACK based PR-SCTP with existing transport protocols for syslog traffic. In the evaluation, we use real syslog traces from an operational syslog system. The results indicate that NR-SACKs based PR-SCTP significantly improves the overall message transfer delay as compared to SCTP and TCP.

sted, utgiver, år, opplag, sider
Elsevier, 2013. Vol. 57, nr 18, s. 3967-3986
Emneord [en]
SCTP, PR-SCTP, NR-SACKs, event logging, performance evaluation
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
URN: urn:nbn:se:kau:diva-14674DOI: 10.1016/j.comnet.2013.09.018ISI: 000328011900016OAI: oai:DiVA.org:kau-14674DiVA, id: diva2:550039
Tilgjengelig fra: 2012-09-06 Laget: 2012-09-06 Sist oppdatert: 2018-06-04bibliografisk kontrollert
Inngår i avhandling
1. Performance Analysis and Improvement of PR-SCTP in an Event Logging Context
Åpne denne publikasjonen i ny fane eller vindu >>Performance Analysis and Improvement of PR-SCTP in an Event Logging Context
2012 (engelsk)Licentiatavhandling, med artikler (Annet vitenskapelig)
Abstract [en]

Due to certain shortcomings in TCP and UDP, the Stream Control Transmission Protocol (SCTP) was defined for transporting telephony signaling traffic. The partially reliable extension of SCTP, PR-SCTP, has been considered as a candidate for prioritizing content sensitive traffic and trading reliability against timeliness for applications with soft real time requirements. 

 

In this thesis, we investigate the applicability of PR-SCTP for event logging applications. Event logs are inherently prioritized. This makes PR-SCTP a promising candidate for transporting event logs. However, the performance gain of PR-SCTP can be very limited when application message sizes are small and messages have mixed reliability requirements. Several factors influence PR-SCTP’s performance. One key factor is the inefficiency in the forward_tsn mechanism of PR-SCTP. We examine the inefficiency in detail and propose several solutions. Moreover, we implement and evaluate one solution that utilizes the Non-Renegable Selective Acknowledgements (NR-SACKs) mechanism currently being standardized in the IETF, which is available in the FreeBSD operating system. Our results show a significant performance gain for PR-SCTP with NR-SACKs. In some scenarios, the average message transfer delay is reduced by more than 75%. Moreover, we evaluate NR-SACK based PR-SCTP using real traces from an event logging application called syslog. It significantly improves the syslog application performance as compared to SCTP, TCP and UDP.

sted, utgiver, år, opplag, sider
Karlstad: Karlstads universitet, 2012. s. 35
Serie
Karlstad University Studies, ISSN 1403-8099 ; 2012:44
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-14676 (URN)978-91-7063-451-2 (ISBN)
Presentation
2012-11-01, 21A342, Karlstads universitet, Karlstad, 10:15 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2012-10-15 Laget: 2012-09-06 Sist oppdatert: 2018-06-04bibliografisk kontrollert
2. Towards a Low Latency Internet: Understanding and Solutions
Åpne denne publikasjonen i ny fane eller vindu >>Towards a Low Latency Internet: Understanding and Solutions
2015 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

Networking research and development have historically focused on increasing network throughput and path resource utilization, which particularly helped bulk applications such as file transfer and video streaming. Recent over-provisioning in the core of the Internet has facilitated the use of interactive applications like interactive web browsing, audio/video conferencing, multi- player online gaming and financial trading applications. Although the bulk applications rely on transferring data as fast as the network permits, interactive applications consume rather little bandwidth, depending instead on low latency. Recently, there has been an increasing concern in reducing latency in networking research, as the responsiveness of interactive applications directly influences the quality of experience.

To appreciate the significance of latency-sensitive applications for today's Internet, we need to understand their traffic pattern and quantify their prevalence. In this thesis, we quantify the proportion of potentially latency-sensitive traffic and its development over time. Next, we show that the flow start-up mechanism in the Internet is a major source of latency for a growing proportion of traffic, as network links get faster.

The loss recovery mechanism in the transport protocol is another major source of latency. To improve the performance of latency-sensitive applications, we propose and evaluate several modifications in TCP. We also investigate the possibility of prioritization at the transport layer to improve the loss recovery. The idea is to trade reliability for timeliness. We particularly examine the applicability of PR-SCTP with a focus on event logging. In our evaluation, the performance of PR-SCTP is largely influenced by small messages. We analyze the inefficiency in detail and propose several solutions. We particularly implement and evaluate one solution that utilizes the Non-Renegable Selective Acknowledgments (NR-SACKs) mechanism, which has been proposed for standardization in the IETF. According to the results, PR-SCTP with NR-SCAKs significantly improves the application performance in terms of low latency as compared to SCTP and TCP.

Abstract [en]

Interactive applications such as web browsing, audio/video conferencing, multi-player online gaming and financial trading applications do not benefit (much) from more bandwidth. Instead, they depend on low latency. Latency is a key determinant of user experience. An increasing concern for reducing latency is therefore currently being observed among the networking research community and industry.

In this thesis, we quantify the proportion of potentially latency-sensitive traffic and its development over time. Next, we show that the flow start-up mechanism in the Internet is a major source of latency for a growing proportion of traffic, as network links get faster.

The loss recovery mechanism in the transport protocol is another major source of latency. To improve the performance of latency-sensitive applications, we propose and evaluate several modifications in TCP. We also investigate the possibility of prioritization at the transport layer to improve the loss recovery. The idea is to trade reliability for timeliness. We particularly examine the applicability of PR-SCTP with a focus on event logging. In our evaluation, the performance of PR-SCTP is largely influenced by small messages. We analyze the inefficiency in detail and propose several solutions. We particularly implement and evaluate one solution that utilizes the Non-Renegable Selective Acknowledgments (NR-SACKs) mechanism, which has been proposed for standardization in the IETF. According to the results, PR-SCTP with NR-SCAKs significantly improves the application performance in terms of low latency as compared to SCTP and TCP.

sted, utgiver, år, opplag, sider
Karlstad: Karlstad University Press, 2015. s. 39
Serie
Karlstad University Studies, ISSN 1403-8099 ; 41
Emneord
latency; traffic classification; slow-start; TCP; SCTP; PR-SCTP; NR-SACKs; event logging; performance evaluation
HSV kategori
Forskningsprogram
Datavetenskap
Identifikatorer
urn:nbn:se:kau:diva-37487 (URN)978-91-7063-659-2 (ISBN)
Disputas
2015-11-12, Lagerlöfsalen, 1A305, Karlstads universitet, 09:00 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2015-10-16 Laget: 2015-08-14 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fullteksthttp://www.sciencedirect.com/science/article/pii/S1389128613003447

Personposter BETA

Rajiullah, MohammadLundin, ReineBrunstrom, AnnaLindskog, Stefan

Søk i DiVA

Av forfatter/redaktør
Rajiullah, MohammadLundin, ReineBrunstrom, AnnaLindskog, Stefan
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 409 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf