Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • 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
Adaptive cheapest path first scheduling in a transport-layer multi-path tunnel context
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).ORCID iD: 0000-0002-8870-9887
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).ORCID iD: 0000-0001-7311-9334
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013).ORCID iD: 0000-0002-9446-8143
Show others and affiliations
2021 (English)In: ANRW 2021 - Proceedings of the 2021 Applied Networking Research Workshop, Association for Computing Machinery (ACM), 2021, p. 39-45Conference paper, Published paper (Refereed)
Abstract [en]

Bundling multiple access technologies increases capacity, resiliency and robustness of network connections. Multi-access is currently being standardized in the ATSSS framework in 3GPP, supporting different access bundling strategies. Within ATSSS, a multipath scheduler needs to decide which path to use for each user packet based on path characteristics. The Cheapest Path First (CPF) scheduler aims to utilize the cheapest path (e.g. WiFi) before sending packets over other paths (e.g. cellular). In this paper, we demonstrate that using CPF with an MP-DCCP tunnel may lead to sub-optimal performance. This is due to adverse interactions between the scheduler and end-to-end and tunnel congestion control. Hence, we design the Adaptive Cheapest Path First (ACPF) scheduler that limits queue buildup in the primary bottleneck and moves traffic to the secondary path earlier. We implement ACPF over both TCP and DCCP congestion controlled tunnels. Our evaluation shows that ACPF improves the average throughput over CPF between 24% to 86%.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2021. p. 39-45
Keywords [en]
5G, ATSSS, heterogeneous wireless access, MP-DCCP, multi-path, transport layer, unreliable traffic, Internet protocols, Mobile telecommunication systems, Traffic congestion, Average throughput, Bundling strategies, Multiple access technology, Network connection, Packet-based, Path characteristic, Secondary paths, Sub-optimal performance, Scheduling
National Category
Computer and Information Sciences
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-86051DOI: 10.1145/3472305.3472316Scopus ID: 2-s2.0-85112203384ISBN: 9781450386180 (print)OAI: oai:DiVA.org:kau-86051DiVA, id: diva2:1597558
Conference
2021 IRTF Applied Networking Research Workshop, ANRW 2021, 24 July 2021 through 30 July 2021
Available from: 2021-09-27 Created: 2021-09-27 Last updated: 2022-11-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Pieskä, MarcusRabitsch, AlexanderBrunström, AnnaKassler, Andreas

Search in DiVA

By author/editor
Pieskä, MarcusRabitsch, AlexanderBrunström, AnnaKassler, Andreas
By organisation
Department of Mathematics and Computer Science (from 2013)
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 180 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • apa.csl
  • 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