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. The sendbox then exercises control over its traffic by scheduling packets to achieve 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.
翻译:队列允许网络操作员控制流量 : 在队列构建时, 他们可以强制执行排程和制定政策 。 但是, 在今天的互联网上, 队列构建和最有效执行控制的地方之间存在着不匹配; 队列建在通常不在数据发送者控制的瓶颈链接中。 为了解决这种不匹配, 我们提议了一种新的中继箱, 名为 Bundler 。 包德勒 使用一个全新的内部控制循环, 在发送箱( 发件人的网站) 和接收箱( 接收者的网站) 之间确定包包的总费率, 留下端到端的连接及其控制环的完整。 强制发送率可以确保从捆包的包包包包中堆积起来的瓶颈队列能够从瓶装到发件箱。 发送箱之后, 我们通过将包包包包包包( 在发件者的网站) 和接收箱( 在接收者的网站) 来评估它的总费率, 使发件人到终端的连接连接及其控制环保持完整。 我们发现, 发送器允许发送器的政策能够有效, 从包包包件人到控制圈中队列的队列队列队列队队列设置现在已经从瓶到发送到发送到发送到发送时间范围 97- F 时间设置 。 。