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 Analysis and Improvement of PR-SCTP in an Event Logging Context
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. (DISCO)ORCID iD: 0000-0003-2765-7873
2012 (English)Licentiate thesis, comprehensive summary (Other academic)
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.

Place, publisher, year, edition, pages
Karlstad: Karlstads universitet, 2012. , 35 p.
Series
Karlstad University Studies, ISSN 1403-8099 ; 2012:44
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-14676ISBN: 978-91-7063-451-2 (print)OAI: oai:DiVA.org:kau-14676DiVA: diva2:550137
Presentation
2012-11-01, 21A342, Karlstads universitet, Karlstad, 10:15 (English)
Opponent
Supervisors
Available from: 2012-10-15 Created: 2012-09-06 Last updated: 2015-11-12Bibliographically approved
List of papers
1. Priority Based Delivery of PR-SCTP Messages in a Syslog Context
Open this publication in new window or tab >>Priority Based Delivery of PR-SCTP Messages in a Syslog Context
2011 (English)In: Access networks, Springer, 2011, 299-310 p.Conference paper, Published paper (Refereed)
Abstract [en]

Unquestionably, syslog provides the most popular and easily manageable computer system logging environment. In a computer network, syslog messages are used for several purposes such as for optimizing system performance, logging user's actions and investigating malicious activities. Due to all these essential utilities, a competent transport service for syslog messages becomes important. Most of the current syslog implementations use either the unreliable UDP protocol or the more costly reliable TCP protocol. Neither of these protocols can provide both timeliness and reliability, while transporting inherently prioritized syslog messages in a congested network. In this paper, we both propose and evaluate the use of PR-SCTP, an existing partial reliability extension of the SCTP transport protocol, as a candidate transport service for the next generation syslog standard. In our emulation based experimental results, PR-SCTP shows better performance than TOP in terms of average delay for message transfer. Furthermore, PR-SCTP exhibits less average packet loss than UDP. In both cases, PR-SCTP exploits priority properties of syslog messages during loss recovery.

Place, publisher, year, edition, pages
Springer, 2011
Series
Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering, ISSN 1867-8211 ; 63
Keyword
Syslog, PR-SCTP, performance evaluations, transport service
National Category
Computer Science
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-10295 (URN)000307264600023 ()978-3-642-20930-7 (ISBN)
Conference
5th Annual International ICST Conference on Access Networks (AccessNets 2010), NOV 03-05, 2010, Budapest, HUNGARY
Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2017-12-06Bibliographically approved
2. Syslog Performance: Data Modeling and Transport
Open this publication in new window or tab >>Syslog Performance: Data Modeling and Transport
2011 (English)In: Proceedings of the 3rd International Workshop on Security and Communication Networks (IWSCN 2011), Norway: IEEE Press, 2011, 31-37 p.Conference paper, Published paper (Refereed)
Abstract [en]

Syslog is one of the basic methods for event logging in computer networks. Log messages that are generated by syslog can be used for a number of purposes, including optimizing system performance, system auditing, and investigating malicious activities in a computer network. Considering all these attractive uses, both timeliness and reliability is needed when syslog messages are transported over a network. The unreliable transport protocol UDP was specified in the original syslog specification; later a reliable transport service based on TCP was also proposed. However, TCP is a costly alternative in terms of delay. In our previous work, we introduced the partially reliable extension of SCTP, PR-SCTP, as a transport service for syslog, trading reliability against timeliness by prioritizing syslog messages. In this work, we first model syslog data using real syslog traces from an operational network. The model is then used as input in the performance evaluation of PR-SCTP. In the experiments, real congestion is introduced in the network by running several competing flows. Although PR-SCTP clearly outperformed TCP and SCTP in our previous work, our present evaluations show that PR-SCTP performance is largely influenced by the syslog data size characteristics

Place, publisher, year, edition, pages
Norway: IEEE Press, 2011
National Category
Computer Science
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-10922 (URN)
Conference
The 3rd International Workshop on Security and Communication Networks (IWSCN 2011), May 18-20, Gjøvik, Norway
Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2017-12-06Bibliographically approved
3. On the Effectiveness of PR-SCTP in Networks with Competing Traffic
Open this publication in new window or tab >>On the Effectiveness of PR-SCTP in Networks with Competing Traffic
2011 (English)In: 2011 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (ISCC), Corfu, Greece: IEEE conference proceedings, 2011Conference paper, Published paper (Refereed)
Abstract [en]

PR-SCTP is an extension to SCTP for partial reliability that enables a content sensitive transport service where the reliability of messages can be individually controlled. In previous work, PR-SCTP has been applied for prioritization of messages and trading of reliability against timeliness for applications such as real time video streaming, IPTV transmission, SIP signaling, and syslog. As compared to TCP, it has been shown to provide significant reductions in message transfer delay and gains in application performance. Much of the previous work has, however, considered artificial loss scenarios without competing traffic. Experiments presented in this paper show that although PR-SCTP clearly outperforms TCP in artificial loss scenarios, the performance gain is not as evident in scenarios where PR-SCTP shares a bottleneck link with competing traffic. Our analysis shows that inefficiencies in the \emph{forward\_tsn} mechanism of PR-SCTP, overhead due to small messages, and a higher loss rate per byte encountered by PR-SCTP are contributing factors to the reduced performance when network resources are shared. Finally, a proposal for a more efficient \emph{forward\_tsn} mechanism is introduced

Place, publisher, year, edition, pages
Corfu, Greece: IEEE conference proceedings, 2011
Series
IEEE Symposium on Computers and Communications ISCC
National Category
Computer Science Telecommunications
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-10925 (URN)000298614900157 ()
Conference
The IEEE symposium on Computers and Communications (ISCC 2011), Corfu, GREECE, Date: JUN 28-JUL 01, 2011
Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2016-08-12Bibliographically approved
4. Performance Analysis and Improvement of PR-SCTP for Small Messages
Open this publication in new window or tab >>Performance Analysis and Improvement of PR-SCTP for Small Messages
2013 (English)In: Computer Networks, ISSN 1389-1286, Vol. 57, no 18, 3967-3986 p.Article in journal (Refereed) 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.

Place, publisher, year, edition, pages
Elsevier: , 2013
Keyword
SCTP, PR-SCTP, NR-SACKs, event logging, performance evaluation
National Category
Computer Science
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-14674 (URN)10.1016/j.comnet.2013.09.018 (DOI)000328011900016 ()
Available from: 2012-09-06 Created: 2012-09-06 Last updated: 2017-12-06Bibliographically approved

Open Access in DiVA

fulltext(789 kB)653 downloads
File information
File name FULLTEXT01.pdfFile size 789 kBChecksum SHA-512
c23bbebb4562203efa8af43644b5d5c9039fddb93bb4cfa8f34dc9462d02a8986a840f37cbedcd4dd896d082580eb8c6e5ea0446b08a7162141623df48c1ac19
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Rajiullah, Mohammad
By organisation
Department of Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 653 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: 320 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