Change search
ReferencesLink to record
Permanent link

Direct link
A Method for Hierarchical Clustering of Internet Traffic and its Use in Detecting Application-Limited Flows
Simula Research laboratory.
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science. (DISCO)
Simula Research laboratory.
Simula Research laboratory.
Show others and affiliations
(English)Manuscript (preprint) (Other academic)
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-37474OAI: oai:DiVA.org:kau-37474DiVA: diva2:845833
Available from: 2015-08-13 Created: 2015-08-13 Last updated: 2015-10-16Bibliographically approved
In thesis
1. Towards a Low Latency Internet: Understanding and Solutions
Open this publication in new window or tab >>Towards a Low Latency Internet: Understanding and Solutions
2015 (English)Doctoral thesis, comprehensive summary (Other academic)
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.

Place, publisher, year, edition, pages
Karlstad: Karlstad University Press, 2015. 39 p.
Series
Karlstad University Studies, ISSN 1403-8099 ; 41
Keyword
latency; traffic classification; slow-start; TCP; SCTP; PR-SCTP; NR-SACKs; event logging; performance evaluation
National Category
Computer Science
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-37487 (URN)978-91-7063-659-2 (ISBN)
Public defence
2015-11-12, Lagerlöfsalen, 1A305, Karlstads universitet, 09:00 (English)
Opponent
Supervisors
Available from: 2015-10-16 Created: 2015-08-14 Last updated: 2015-11-12Bibliographically approved

Open Access in DiVA

No full text

By organisation
Department of Mathematics and Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 147 hits
ReferencesLink to record
Permanent link

Direct link