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
Is Multi-Path Transport Suitable for Latency Sensitive Traffic?
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science.
Simula Research Laboratory, Oslo, Norway.
Simula Research Laboratory, Oslo, Norway.
Simula Research Laboratory, Oslo, Norway.
Show others and affiliations
2016 (English)In: Computer Networks, ISSN 1389-1286, E-ISSN 1872-7069, Vol. 105, p. 1-21Article in journal (Refereed) Published
Abstract [en]

This paper assesses whether multi-path communication can help latency-sensitive applications to satisfy the requirements of their users. We consider Concurrent Multi-path Transfer for SCTP (CMT-SCTP) and Multi-path TCP (MPTCP) and evaluate their proficiency in transporting video, gaming, and web traffic over combinations of WLAN and 3G interfaces. To ensure the validity of our evaluation, several experimental approaches were used including simulation, emulation and live experiments. When paths are symmetric in terms of capacity, delay and loss rate, we find that the experienced latency is significantly reduced, compared to using a single path. Using multiple asymmetric paths does not affect latency - applications do not experience any increase or decrease, but might benefit from other advantages of multi-path communication. In the light of our conclusions, multi-path transport is suitable for latency-sensitive traffic and mature enough to be widely deployed. 

Place, publisher, year, edition, pages
Elsevier, 2016. Vol. 105, p. 1-21
Keyword [en]
Internet; Latency; Multi-path communication; Transport protocols; MPTCP; CMT-SCTP
National Category
Computer and Information Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-42624DOI: 10.1016/j.comnet.2016.05.008ISI: 000380869300001OAI: oai:DiVA.org:kau-42624DiVA: diva2:933301
Available from: 2016-06-03 Created: 2016-06-03 Last updated: 2018-01-10Bibliographically approved

Open Access in DiVA

fulltext(1018 kB)122 downloads
File information
File name FULLTEXT01.pdfFile size 1018 kBChecksum SHA-512
d513d31c7a736ed40be7ba47c5474464cf5e622670d46a92785ebd96d2d752949d07348fd6247d0fad004179fae71d7fc4d11612c3e8d41199c4ce67b78c4f87
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Yedugundla, Venkata KiranHurtig, PerBrunstrom, Anna
By organisation
Department of Mathematics and Computer Science
In the same journal
Computer Networks
Computer and Information Sciences

Search outside of DiVA

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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 347 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