Fast network congestion detection and avoidance using P4

Conference Paper (2018)
Author(s)

Belma Turkovic (TU Delft - Embedded Systems)

Fernando Kuipers (TU Delft - Embedded Systems)

Niels van Adrichem (TNO)

Koen Langendoen (TU Delft - Embedded Systems)

DOI related publication
https://doi.org/10.1145/3229574.3229581 Final published version
More Info
expand_more
Publication Year
2018
Language
English
Pages (from-to)
45-51
ISBN (print)
978-1-4503-5907-8
Event
Downloads counter
272
Collections
Institutional Repository
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Along with exciting visions for 5G communications and the Tactile Internet, the networking requirement of attaining extremely low end-to-end latency has appeared. While network devices are typically equipped with buffers to counteract packet loss caused by short-lived traffic bursts, the more those buffers get filled, the more delay is added to every packet passing through.

In this paper, we develop congestion avoidance methods that harness the power of fully programmable data-planes. The corresponding programmable switches, through languages such as P4, can be programmed to gather and react to important packet meta-data, such as queue load, while the data packets are being processed. In particular, we enable P4 switches to (1) track processing and queuing delays of latency-critical flows and (2) react immediately in the data-plane to congestion by rerouting the affected flows. Through a proof-of-concept implementation in emulation and on real hardware, we demonstrate that a data-plane approach reduces average and maximum delay, as well as jitter, when compared to non-programmable approaches.

Files

Neat2018.pdf
(pdf | 0.729 Mb)
License info not available