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
Validating the Sharing Behavior and Latency Characteristics of the L4S Architecture
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). (DISCO, Computer Networking)ORCID iD: 0000-0001-7529-9324
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). (DISCO, Computer Networking)ORCID iD: 0000-0003-4147-9487
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). (DISCO, Computer Networking)ORCID iD: 0000-0001-7311-9334
Karlstad University, Faculty of Health, Science and Technology (starting 2013), Department of Mathematics and Computer Science (from 2013). (DISCO, Computer Networking)ORCID iD: 0000-0001-9194-010X
2019 (English)Conference paper, Poster (with or without abstract) (Refereed)
Abstract [en]

Internet services such as virtual reality, interactive cloud applications, and online gaming, have a strict quality of service requirements (e.g., low-latency). However, the current Internet is not able to satisfy the low-latency requirements of these applications. This as the standard TCP induces high queuing delays when used by capacity-seeking traffic, which in turn results in unpredictable latency. The Low Latency Low Loss Scalable throughput (L4S) architecture aims to address this problem by combining scalable congestion controls (e.g., DCTCP) with early congestion signaling from the network. For incremental deployment, the L4S architecture defines a Dual Queue Coupled AQM that enables the safe coexistence of scalable and classic (e.g., Reno, Cubic, etc.) flows on the global Internet. The DualPI2 AQM is a Linux kernel implementation of a Dual Queue Coupled AQM. In this paper, we benchmark the DualPI2 AQM to validate experimental result(s) reported in previous works that demonstrate the coexistence of scalable and classic congestion controls, and its low-latency service. Our results validate the coexistence of scalable and classic flows using DualPI2 single queue AQM while the result with dual queue shows neither rate nor window fairness between the flows.

Place, publisher, year, edition, pages
2019.
National Category
Telecommunications
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kau:diva-75444OAI: oai:DiVA.org:kau-75444DiVA, id: diva2:1365508
Conference
ACM Internet Measurement Conference 2019, 21-23 october, Amsterdam, The Netherlands
Projects
HITS, 4707
Funder
Knowledge FoundationAvailable from: 2019-10-25 Created: 2019-10-25 Last updated: 2019-11-21Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

IMC 2019

Authority records BETA

Oljira, Dejene BoruGrinnemo, Karl-JohanBrunström, AnnaTaheri, Javid

Search in DiVA

By author/editor
Oljira, Dejene BoruGrinnemo, Karl-JohanBrunström, AnnaTaheri, Javid
By organisation
Department of Mathematics and Computer Science (from 2013)
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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