TY - GEN
T1 - Site-to-site internet traffic control
AU - Cangialosi, Frank
AU - Narayan, Akshay
AU - Goyal, Prateesh
AU - Mittal, Radhika
AU - Alizadeh, Mohammad
AU - Balakrishnan, Hari
N1 - Publisher Copyright:
© 2021 Owner/Author.
PY - 2021/4/21
Y1 - 2021/4/21
N2 - Queues allow network operators to control traffic: where queues build, they can enforce scheduling and shaping policies. In the Internet today, however, there is a mismatch between where queues build and where control is most effectively enforced; queues build at bottleneck links that are often not under the control of the data sender. To resolve this mismatch, we propose a new kind of middlebox, called Bundler. Bundler uses a novel inner control loop between a sendbox (in the sender's site) and a receivebox (in the receiver's site) to determine the aggregate rate for the bundle, leaving the end-to-end connections and their control loops intact. Enforcing this sending rate ensures that bottleneck queues that would have built up from the bundle's packets now shift from the bottleneck to the sendbox. This enables the sendbox to exercise control over its traffic by scheduling packets according to any policy necessary to achieve the network operator's higher-level objectives. We have implemented Bundler in Linux and evaluated it with real-world and emulation experiments. We find that Bundler allows the sender-chosen policy to be effective: when configured to implement Stochastic Fairness Queueing (SFQ), it improves median flow completion time (FCT) by between 28% and 97% across various scenarios.
AB - Queues allow network operators to control traffic: where queues build, they can enforce scheduling and shaping policies. In the Internet today, however, there is a mismatch between where queues build and where control is most effectively enforced; queues build at bottleneck links that are often not under the control of the data sender. To resolve this mismatch, we propose a new kind of middlebox, called Bundler. Bundler uses a novel inner control loop between a sendbox (in the sender's site) and a receivebox (in the receiver's site) to determine the aggregate rate for the bundle, leaving the end-to-end connections and their control loops intact. Enforcing this sending rate ensures that bottleneck queues that would have built up from the bundle's packets now shift from the bottleneck to the sendbox. This enables the sendbox to exercise control over its traffic by scheduling packets according to any policy necessary to achieve the network operator's higher-level objectives. We have implemented Bundler in Linux and evaluated it with real-world and emulation experiments. We find that Bundler allows the sender-chosen policy to be effective: when configured to implement Stochastic Fairness Queueing (SFQ), it improves median flow completion time (FCT) by between 28% and 97% across various scenarios.
UR - http://www.scopus.com/inward/record.url?scp=85105311043&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85105311043&partnerID=8YFLogxK
U2 - 10.1145/3447786.3456260
DO - 10.1145/3447786.3456260
M3 - Conference contribution
AN - SCOPUS:85105311043
T3 - EuroSys 2021 - Proceedings of the 16th European Conference on Computer Systems
SP - 574
EP - 589
BT - EuroSys 2021 - Proceedings of the 16th European Conference on Computer Systems
PB - Association for Computing Machinery
T2 - 16th European Conference on Computer Systems, EuroSys 2021
Y2 - 26 April 2021 through 28 April 2021
ER -