short-paper

A Congestion Control Independent L4S Scheduler

Authors:

Szilveszter Nádas,

Ferenc Fejes, and

Sándor LakiAuthors Info & Claims

ANRW '20: Proceedings of the Applied Networking Research Workshop

July 2020

Pages 45 - 51

https://doi.org/10.1145/3404868.3406669

Published: 27 July 2020 Publication History

Abstract

In the recent years a new Internet service called Low-Latency Low-Loss Scalable-Throughput (L4S) has been proposed to provide scalable sources with ultra-low latency over the Internet, while keeping the delay and resource sharing reasonable for flows with classic loss-based congestion control. At the same time both classic and scalable congestion controls are being evolved resulting in unfair resource share among flows using different congestion controls, even within the same congestion control family. The fairness is further degraded by heterogeneous RTTs over the real-world Internet. In this paper, we show that existing L4S schedulers are not able to handle this level of heterogeneity we forecast for the future Internet. To overcome this limitation, we propose Virtual Dual Queue CSAQM that extends the Core Stateless AQM (CSAQM) concept to support L4S requirements while keeping its precise in-network control of resource sharing. We have implemented the algorithm in our DPDK-based AQM evaluation testbed and demonstrated by measurements that it performs well even in those heterogeneous cases where mainstream L4S schedulers are sub-optimal.

References

[1]

[n.d.]. TCP BBR v2 Alpha/Preview Release, In https://github.com/google/bbr/tree/v2alpha. checked 2020-01.

[2]

Olga Albisser, Koen De Schepper, Bob Briscoe, Olivier Tilmans, and Henrik Steen. 2019. DUALPI2 - Low Latency, Low Loss and Scalable (L4S) AQM. In Proc. Netdev 0x13. https://www.files.netdevconf.org/f/febbe8c6a05b4ceab641/?dl=1

[3]

Mohammad Alizadeh, Albert Greenberg, David A. Maltz, Jitendra Padhye, Parveen Patel, Balaji Prabhakar, Sudipta Sengupta, and Murari Sridharan. 2010. Data Center TCP (DCTCP). In ACM SIGCOMM 2010 (New Delhi, India). ACM, 63--74.

Digital Library

[4]

Mohammad Alizadeh, Abdul Kabbani, Tom Edsall, Balaji Prabhakar, Amin Vahdat, and Masato Yasuda. 2012. Less is more: trading a little bandwidth for ultra-low latency in the data center. In Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation. USENIX Association, 19--19.

Digital Library

[5]

Pat Bosshart, Dan Daly, Glen Gibb, Martin Izzard, Nick McKeown, Jennifer Rexford, Cole Schlesinger, Dan Talayco, Amin Vahdat, George Varghese, et al. 2014. P4: Programming protocol-independent packet processors. ACM SIGCOMM Computer Communication Review 44, 3 (2014), 87--95.

Digital Library

[6]

B Briscoe, K De Schepper, O Albisser, J Misund, O Tilmans, M Kuehlewind, and A Ahmed. 2019. Implementing the TCP Prague Requirements for Low Latency Low Loss Scalable Throughput (L4S). Proc. Linux Netdev 0x13, March (2019).

[7]

Bob Briscoe, Koen De Schepper, Marcelo Bagnulo, and Greg White. 2019. Low Latency, Low Loss, Scalable Throughput (L4S) Internet Service: Architecture. Internet-Draft draft-ietf-tsvwg-l4s-arch-04. Internet Engineering Task Force. https://datatracker.ietf.org/doc/html/draft-ietf-tsvwg-l4s-arch-04 Work in Progress.

[8]

Zhiruo Cao, Ellen Zegura, and Zheng Wang. 2005. Rainbow fair queueing: theory and applications. Computer Networks 47, 3 (2005), 367--392. https://doi.org/10.1016/j.comnet.2004.07.018

Digital Library

[9]

Neal Cardwell, Yuchung Cheng, C. Stephen Gunn, Soheil Hassas Yeganeh, and Van son. 2016. BBR: Congestion-Based Congestion Control. ACM Queue 14, 5, Article 50 (Oct. 2016), 34 pages. https://doi.org/10.1145/3012426.3022184

[10]

Koen De Schepper, Olga Bondarenko, Ing-Jyh Tsang, and Bob Briscoe. 2016. PI2: A Linearized AQM for Both Classic and Scalable TCP (ACM CoNEXT '16). ACM, 105--119.

[11]

Koen De Schepper, Bob Briscoe, and Greg White. 2020. DualQ Coupled AQMs for Low Latency, Low Loss and Scalable Throughput (L4S). Internet-Draft draft-ietf-tsvwg-aqm-dualq-coupled-11. IETF. https://datatracker.ietf.org/doc/html/draft-ietf-tsvwg-aqm-dualq-coupled-11 Work in Progress.

[12]

Ferenc Fejes, Gergő Gombos, Sándor Laki, and Szilveszter Nádas. 2019. Who will Save the Internet from the Congestion Control Revolution?. In Workshop on Buffer Sizing.

Digital Library

[13]

Sally Floyd and Van son. 1993. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking (1993), 397--413.

[14]

J. Gettys. 2011. Bufferbloat: Dark Buffers in the Internet. IEEE Internet Computing 15, 3 (May 2011), 96--96. https://doi.org/10.1109/MIC.2011.56

Digital Library

[15]

Vivien GUEANT. 2017. Iperf-Iperf3 And Iperf2 User Documentation. Iperf. fr. Np (2017).

[16]

Sangtae Ha, Injong Rhee, and Lisong Xu. 2008. CUBIC: A New TCP-friendly High-speed TCP Variant. SIGOPS Oper. Syst. Rev. 42, 5 (July 2008), 64--74. https://doi.org/10.1145/1400097.1400105

Digital Library

[17]

Stephen Hemminger et al. 2005. Network emulation with NetEm. In Linux conf au. 18--23.

[18]

N. Cardwell et. al. 2019-03. An update on BBR. slides-104-iccrg-an-update-on-bbr-00. https://datatracker.ietf.org/doc/slides-104-iccrg-an-update-on-bbr/

[19]

Szilveszter Nádas, Gergő Gombos, Ferenc Fejes, and Sándor and Laki. 2020-06. A Congestion Control Independent L4S Scheduler - Measurement results. In http://ppv.elte.hu/cc-independent-l4s.

[20]

Szilveszter Nádas, Gergő Gombos, Péter Hudoba, and Sándor Laki. 2018. Towards a Congestion Control-Independent Core-Stateless AQM. In ANRW '18 (Montreal, QC, Canada). 84--90. https://doi.org/10.1145/3232755.3232777

Digital Library

[21]

Szilveszter Nádas, Zoltán Richárd Turányi, and Sándor Rácz. 2016. Per Packet Value: A Practical Concept for Network Resource Sharing. In IEEE Globecom 2016.

[22]

Kathleen Nichols and Van son. 2012. Controlling Queue Delay. Commun. ACM 55, 7 (July 2012), 42--50. https://doi.org/10.1145/2209249.2209264

Digital Library

[23]

Dejene Boru Oljira, Karl-Johan Grinnemo, Anna Brunström, and Javid Taheri. 2020. Validating the Sharing Behavior and Latency Characteristics of the L4S Architecture. ACM SIGCOMM Computer Communication Review 50, 2 (2020).

[24]

Rong Pan, Preethi Natarajan, Chiara Piglione, Mythili Suryanarayana Prabhu, Vijay Subramanian, Fred Baker, and Bill VerSteeg. 2013. PIE: A lightweight control scheme to address the bufferbloat problem. In IEEE HPSR. 148--155. https://doi.org/10.1109/HPSR.2013.6602305

[25]

Koen De Schepper, Olga Bondarenko, Ing-Jyh Tsang, and Bob Briscoe. 2015. 'Data Center to the Home': Ultra-Low Latency for All. Technical report. RITE Project. http://riteproject.eu/publications/

[26]

Koen De Schepper and Bob Briscoe. 2020. Identifying Modified Explicit Congestion Notification (ECN) Semantics for Ultra-Low Queuing Delay (L4S). Internet-Draft draft-ietf-tsvwg-ecn-l4s-id-10. Internet Engineering Task Force. https://datatracker.ietf.org/doc/html/draft-ietf-tsvwg-ecn-l4s-id-10 Work in Progress.

[27]

Ion Stoica, Scott Shenker, and Hui Zhang. 2003. Core-stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High-speed Networks. IEEE/ACM Trans. Netw. 11, 1 (Feb. 2003), 33--46. https://doi.org/10.1109/TNET.2002.808414

Digital Library

Cited By

Magnouche HDoyen GProdhon C(2024)A Fair Sharing Approach for Micro-Services Function Chains Placement in Ultra-Low Latency ServicesIEEE Transactions on Network and Service Management10.1109/TNSM.2023.331364721:1(20-34)Online publication date: Feb-2024
https://doi.org/10.1109/TNSM.2023.3313647
Magnouche HDoyen GProdhon C(2023)A Lightweight Heuristic for Micro-Services Placement and Chaining in Low Latency Services2023 19th International Conference on Network and Service Management (CNSM)10.23919/CNSM59352.2023.10327804(1-9)Online publication date: 30-Oct-2023
https://doi.org/10.23919/CNSM59352.2023.10327804
Fejes FNadas SGombos GLaki S(2022)DeepQoS: Core-Stateless Hierarchical QoS in Programmable SwitchesIEEE Transactions on Network and Service Management10.1109/TNSM.2022.315201719:2(1842-1861)Online publication date: Jun-2022
https://doi.org/10.1109/TNSM.2022.3152017
Show More Cited By

Index Terms

A Congestion Control Independent L4S Scheduler
1. Networks
  1. Network algorithms
    1. Data path algorithms
      1. Packet scheduling

Recommendations

Configurable active multicast congestion control

A multicast congestion control and avoidance scheme is indispensable for group-based applications to fairly share and efficiently use network resources with unicast applications and maintain the stability of the Internet. It is difficult for the ...
Read More
TCP-friendly Congestion Control for HighSpeed Network
SAINT '07: Proceedings of the 2007 International Symposium on Applications and the Internet

The currently used TCP congestion control, TCP Reno, has two weaknesses. To solve this TCP Reno drawback, HighSpeed TCP and Scalable TCP were proposed. However, the fairness between these proposed TCP and TCP Reno is not considered, when both ...
Read More
Performance evaluation of Westwood+ TCP congestion control
Internet performance symposium (IPS 2002)

Westwood+ TCP is a sender-side only modification of the classic Tahoe/Reno TCP that has been recently proposed to improve fairness and efficiency of TCP. The key idea of Westwood+ TCP is to perform an end-to-end estimate of the bandwidth available for a ...
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ANRW '20: Proceedings of the Applied Networking Research Workshop

July 2020

77 pages

ISBN:9781450380393

DOI:10.1145/3404868

Copyright © 2020 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

IRTF: Internet Research Task Force
Internet Society: Internet Society
SIGCOMM: ACM Special Interest Group on Data Communication

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 July 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Short-paper
Research
Refereed limited

Conference

ANRW '20

Sponsor:

IRTF
Internet Society
SIGCOMM

ANRW '20: Applied Networking Research Workshop

July 27 - 30, 2020

Virtual Event, Spain

Acceptance Rates

Overall Acceptance Rate 34 of 58 submissions, 59%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
295
Total Downloads

Downloads (Last 12 months)77
Downloads (Last 6 weeks)7

Other Metrics

View Author Metrics

Citations

Cited By

Magnouche HDoyen GProdhon C(2024)A Fair Sharing Approach for Micro-Services Function Chains Placement in Ultra-Low Latency ServicesIEEE Transactions on Network and Service Management10.1109/TNSM.2023.331364721:1(20-34)Online publication date: Feb-2024
https://doi.org/10.1109/TNSM.2023.3313647
Magnouche HDoyen GProdhon C(2023)A Lightweight Heuristic for Micro-Services Placement and Chaining in Low Latency Services2023 19th International Conference on Network and Service Management (CNSM)10.23919/CNSM59352.2023.10327804(1-9)Online publication date: 30-Oct-2023
https://doi.org/10.23919/CNSM59352.2023.10327804
Fejes FNadas SGombos GLaki S(2022)DeepQoS: Core-Stateless Hierarchical QoS in Programmable SwitchesIEEE Transactions on Network and Service Management10.1109/TNSM.2022.315201719:2(1842-1861)Online publication date: Jun-2022
https://doi.org/10.1109/TNSM.2022.3152017
Gombos GKis DTothmeresz LKiraly TNadas SLaki S(2022)Flow Fairness With Core-Stateless Resource Sharing in Arbitrary TopologyIEEE Access10.1109/ACCESS.2022.322206210(120312-120328)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2022.3222062
Mathieu BTuffin S(2021)Evaluating the L4S Architecture in Cellular Networks with a Programmable Switch2021 IEEE Symposium on Computers and Communications (ISCC)10.1109/ISCC53001.2021.9631539(1-6)Online publication date: 5-Sep-2021
https://doi.org/10.1109/ISCC53001.2021.9631539
Fejes FNadas SGombos GLaki S(2021)A Core-Stateless L4S Scheduler for P4-enabled hardware switches with emulated HQoSIEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)10.1109/INFOCOMWKSHPS51825.2021.9484581(1-2)Online publication date: 10-May-2021
https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484581

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents