Fast network congestion detection and avoidance using P4

Belma Turkovic, F. Kuipers, Niels L. M. van Adrichem, K. Langendoen
{"title":"Fast network congestion detection and avoidance using P4","authors":"Belma Turkovic, F. Kuipers, Niels L. M. van Adrichem, K. Langendoen","doi":"10.1145/3229574.3229581","DOIUrl":null,"url":null,"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.","PeriodicalId":113231,"journal":{"name":"Proceedings of the 2018 Workshop on Networking for Emerging Applications and Technologies","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"47","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 Workshop on Networking for Emerging Applications and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3229574.3229581","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 47

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.
快速网络拥塞检测和避免使用P4
随着5G通信和触觉互联网令人兴奋的愿景,实现极低端到端延迟的网络需求已经出现。虽然网络设备通常配备缓冲区来抵消短期流量突发造成的数据包丢失,但缓冲区被填满的越多,每个经过的数据包所增加的延迟就越多。在本文中,我们开发了利用完全可编程数据平面的能力的拥塞避免方法。相应的可编程交换机,通过诸如P4之类的语言,可以对其进行编程,以便在处理数据包时收集并响应重要的数据包元数据,例如队列负载。特别是,我们使P4交换机能够(1)跟踪延迟关键流的处理和排队延迟,以及(2)通过重新路由受影响的流,在数据平面上立即对拥塞做出反应。通过在仿真和实际硬件上的概念验证实现,我们证明了与非可编程方法相比,数据平面方法减少了平均和最大延迟以及抖动。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信