A model predictive control approach to flow pacing for TCP

David Fridovich-Keil, Nathan Hanford, Margaret P. Chapman, C. Tomlin, M. Farrens, D. Ghosal
{"title":"A model predictive control approach to flow pacing for TCP","authors":"David Fridovich-Keil, Nathan Hanford, Margaret P. Chapman, C. Tomlin, M. Farrens, D. Ghosal","doi":"10.1109/ALLERTON.2017.8262845","DOIUrl":null,"url":null,"abstract":"A key challenge in the management of Internet traffic is the design of algorithms that complement well-established protocols, such as the Transmission Control Protocol (TCP), and simultaneously address their limitations. The challenge becomes greater in the context of large so-called “elephant” flows over long paths that often transition from higher to lower bandwidth connections. At these transition points either persistent queues are formed when buffers are over-provisioned or packet loss occurs when buffers are under-provisioned; both cases lead to degraded and/or highly variable end-to-end performance. Ideally, for such scenarios, the source should “learn” and set a pacing rate that matches the lower bandwidth connection. In this paper, we adopt a model-based receding horizon control strategy to design a pacing control method. Each new round-trip time (RTT) measurement is first incorporated into a linear time-varying (LTV) predictive model. Subsequently, we solve a one-step look-ahead optimization problem which finds the pacing rate which optimally trades off RTT, variance in RTT, and throughput according to the most up-to-date model. We implemented our proof-of-concept control strategy on the Linux operating system alongside the existing CoDel queuing discipline (qdisc) and HTCP congestion-control algorithm. Our preliminary results indicate significant reduction in the variances of the RTT and the throughput, resulting in more predictable performance overall.","PeriodicalId":175162,"journal":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ALLERTON.2017.8262845","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

A key challenge in the management of Internet traffic is the design of algorithms that complement well-established protocols, such as the Transmission Control Protocol (TCP), and simultaneously address their limitations. The challenge becomes greater in the context of large so-called “elephant” flows over long paths that often transition from higher to lower bandwidth connections. At these transition points either persistent queues are formed when buffers are over-provisioned or packet loss occurs when buffers are under-provisioned; both cases lead to degraded and/or highly variable end-to-end performance. Ideally, for such scenarios, the source should “learn” and set a pacing rate that matches the lower bandwidth connection. In this paper, we adopt a model-based receding horizon control strategy to design a pacing control method. Each new round-trip time (RTT) measurement is first incorporated into a linear time-varying (LTV) predictive model. Subsequently, we solve a one-step look-ahead optimization problem which finds the pacing rate which optimally trades off RTT, variance in RTT, and throughput according to the most up-to-date model. We implemented our proof-of-concept control strategy on the Linux operating system alongside the existing CoDel queuing discipline (qdisc) and HTCP congestion-control algorithm. Our preliminary results indicate significant reduction in the variances of the RTT and the throughput, resulting in more predictable performance overall.
一种基于模型预测的TCP流量调节控制方法
互联网流量管理中的一个关键挑战是算法的设计,这些算法既要补充已建立的协议,如传输控制协议(TCP),又要同时解决它们的局限性。在所谓的大型“大象”流的背景下,挑战变得更大,这些流经常从高带宽连接转换到低带宽连接。在这些过渡点上,要么在缓冲区供应过剩时形成持久队列,要么在缓冲区供应不足时发生数据包丢失;这两种情况都会导致端到端性能下降和/或高度可变。理想情况下,对于这种情况,源应该“学习”并设置一个匹配较低带宽连接的步调速率。本文采用一种基于模型的后退地平线控制策略来设计一种步进控制方法。每个新的往返时间(RTT)测量首先被纳入线性时变(LTV)预测模型。随后,我们解决了一个一步前瞻性优化问题,该问题根据最新的模型找到最优地权衡RTT, RTT方差和吞吐量的起跳率。我们在Linux操作系统上实现了概念验证控制策略以及现有的CoDel排队规则(qdisc)和http拥塞控制算法。我们的初步结果表明,RTT和吞吐量的差异显著减小,从而提高了总体性能的可预测性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信
小红书