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
Emulation Support for Advanced Packet Reordering Models
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science.ORCID iD: 0000-0002-8731-2482
Karlstad University, Faculty of Economic Sciences, Communication and IT, Department of Computer Science. Karlstad University, Faculty of Economic Sciences, Communication and IT, Centre for HumanIT.
2010 (English)In: 2010 IEEE International Conference on Communications, Cape Town, South Africa: IEEE Communications Society, 2010Conference paper, (Refereed)
Abstract [en]

From being regarded as a pathological event, packet reordering is now considered to be naturally prevalent within the Internet. When packets are reordered, the performance of transport protocols like TCP can be severely hurt. To overcome performance problems a number of mitigations have been proposed. Common for most proposals is, however, the lack of evaluations using real protocol implementations and good models of packet reordering. In this paper we highlight the need for detailed reordering models, and implement support for such models in the KauNet network emulator. To demonstrate the importance of using detailed models we present an experimental example.

Place, publisher, year, edition, pages
Cape Town, South Africa: IEEE Communications Society, 2010.
National Category
Computer Science
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-9697DOI: 10.1109/ICC.2010.5501900ISBN: 978-1-4244-6404-3 (print)OAI: oai:DiVA.org:kau-9697DiVA: diva2:493199
Conference
IEEE International Conference on Communications (ICC)
Available from: 2012-02-08 Created: 2012-02-08 Last updated: 2014-11-21Bibliographically 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 text

Search in DiVA

By author/editor
Hurtig, PerBrunström, Anna
By organisation
Department of Computer ScienceCentre for HumanIT
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

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