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
Enhanced Metric Caching for Short TCP Flows
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. (Datavetenskap)ORCID iD: 0000-0002-8731-2482
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. (Datavetenskap)
2012 (English)In: Proceedings of the IEEE International Conference on Communications (ICC 2012), IEEE Press, 2012, 1209-1213 p.Conference paper, (Refereed)
Abstract [en]

Internet-based applications that require low latency are becoming more common. Such applications typically generate traffic consisting of short, or bursty, TCP flows. As TCP, instead, is designed to optimize the throughput of long bulk flows there is an apparent mismatch. To overcome this, a lot of research has recently focused on optimizing TCP for short flows as well. In this paper, we identify a performance problem for short flows caused by the metric caching conducted by the TCP control block interdependence mechanisms. Using this metric caching, a single packet loss can potentially ruin the performance for all future flows to the same destination by making them start in congestion avoidance instead of slow-start. To solve this, we propose an enhanced selective caching mechanism for short flows. To illustrate the usefulness of our approach, we implement it in both Linux and FreeBSD and experimentally evaluate it in a real test-bed. The experiments show that the selective caching approach is able to reduce the average transmission time of short flows by up to 40%.

Place, publisher, year, edition, pages
IEEE Press, 2012. 1209-1213 p.
Keyword [en]
TCP, Caching, TCBI, sharing, short flows, congestion control
National Category
Communication Systems
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-13632DOI: 10.1109/ICC.2012.6364516ISI: 000312855701103ISBN: 978-1-4577-2051-2 (print)ISBN: 978-1-4577-2052-9 (print)OAI: oai:DiVA.org:kau-13632DiVA: diva2:533362
Conference
IEEE International Conference on Communications (ICC 2012), June 2012, Ottawa, Canada
Available from: 2012-06-13 Created: 2012-06-13 Last updated: 2016-10-15Bibliographically approved
In thesis
1. Transport-Layer Performance for Applications and Technologies of the Future Internet
Open this publication in new window or tab >>Transport-Layer Performance for Applications and Technologies of the Future Internet
2012 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

To provide Internet applications with good performance, the transport protocol TCP is designed to optimize the throughput of data transfers. Today, however, more and more applications rely on low latency rather than throughput. Such applications can be referred to as data-limited and are not appropriately supported by TCP. Another emerging problem is associated with the use of novel networking techniques that provide infrastructure-less networking. To improve connectivity and performance in such environments, multi-path routing is often used. This form of routing can cause packets to be reordered, which in turn hurts TCP performance.

To address timeliness issues for data-limited traffic, we propose and experimentally evaluate several transport protocol adaptations. For instance, we adapt the loss recovery mechanisms of both TCP and SCTP to perform faster loss detection for data-limited traffic, while preserving the standard behavior for regular traffic. Evaluations show that the proposed mechanisms are able to reduce loss recovery latency with 30-50%. We also suggest modifications to the TCP state caching mechanisms. The caching mechanisms are used to optimize new TCP connections based on the state of old ones, but do not work properly for data-limited flows. Additionally, we design a SCTP mechanism that reduces overhead by bundling several packets into one packet in a more timely fashion than the bundling normally used in SCTP.

To address the problem of packet reordering we perform several experimental evaluations, using TCP and state of the art reordering mitigation techniques. Although the studied mitigation techniques are quite good in helping TCP to sustain its performance during pure packet reordering events, they do not help when other impairments like packet loss are present.

Place, publisher, year, edition, pages
Karlstad: Karlstads universitet, 2012. 30 p.
Series
Karlstad University Studies, ISSN 1403-8099 ; 2011:65
Keyword
TCP, SCTP, transport protocols, loss recovery, packet reordering, congestion control, performance evaluation
National Category
Computer Systems
Research subject
Computer Science
Identifiers
urn:nbn:se:kau:diva-8920 (URN)978-91-7063-404-8 (ISBN)
Public defence
2012-02-09, 1B364 (Frödingsalen), Karlstads universitet, Karlstad, 13:15 (English)
Opponent
Supervisors
Note

Paper V was in manuscript form at the time of the defense.

Available from: 2012-01-13 Created: 2011-12-08 Last updated: 2016-10-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://www.ieee-icc.org/2012

Search in DiVA

By author/editor
Hurtig, PerBrunstrom, Anna
By organisation
Department of Computer Science
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 153 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