TY - GEN
T1 - P4-Enabled Network-Assisted Congestion Feedback: A Case for NACKs
AU - Feldmann, Anja
AU - Chandrasekaran, Balakrishnan
AU - Fathalli, Seifeddine
AU - Weyulu, Emilia N.
PY - 2019
Y1 - 2019
N2 - There exists an extensive body of work, spanning more than two decades, on congestion control schemes and signaling mechanisms. The majority of prior work does not, however, entertain the notion of network-assisted feedback for congestion control. The scope of the remaining work has also been, unfortunately, rather narrow: Some efforts limit themselves to using weak signals (involving a few bits in the header) and relying on receivers to reflect such signals to the sender; few others maintain per-flow statistics or explicitly set the rates the senders should use. Virtually all suggested network-assisted congestion feedback mechanisms are ineffective, not scalable, or limited to data-center contexts.In this proposal, we exploit data-plane programmability of P4 switches as well as hardware-supported priority classes to present a novel network-assisted congestion feedback (NCF) mechanism. The feedback entails NACKs that are directly sent to the sender, and does not involve the receiver; it is, hence, quick and efficient. We propose sending such NACKs during periods of congestion to senders of elephant flows and outline a scalable approach to identify elephant flows. Unlike prior work, NCF is applicable to both data-centers as well as Internet-wide.
AB - There exists an extensive body of work, spanning more than two decades, on congestion control schemes and signaling mechanisms. The majority of prior work does not, however, entertain the notion of network-assisted feedback for congestion control. The scope of the remaining work has also been, unfortunately, rather narrow: Some efforts limit themselves to using weak signals (involving a few bits in the header) and relying on receivers to reflect such signals to the sender; few others maintain per-flow statistics or explicitly set the rates the senders should use. Virtually all suggested network-assisted congestion feedback mechanisms are ineffective, not scalable, or limited to data-center contexts.In this proposal, we exploit data-plane programmability of P4 switches as well as hardware-supported priority classes to present a novel network-assisted congestion feedback (NCF) mechanism. The feedback entails NACKs that are directly sent to the sender, and does not involve the receiver; it is, hence, quick and efficient. We propose sending such NACKs during periods of congestion to senders of elephant flows and outline a scalable approach to identify elephant flows. Unlike prior work, NCF is applicable to both data-centers as well as Internet-wide.
KW - AQM
KW - NACKs
KW - P4
KW - Congestion control
U2 - 10.1145/3375235.3375238
DO - 10.1145/3375235.3375238
M3 - Conference contribution
SN - 9781450377454
T3 - BS '19
BT - Proceedings of the 2019 Workshop on Buffer Sizing
PB - Association for Computing Machinery
CY - New York, NY, USA
ER -