Liberating TCP: The Free and the Stunts

Jason Valdez, Mina Guirguis
{"title":"Liberating TCP: The Free and the Stunts","authors":"Jason Valdez, Mina Guirguis","doi":"10.1109/ICN.2008.109","DOIUrl":null,"url":null,"abstract":"The performance of a TCP connection is typically dictated by what the network can provide rather than what the application would like to achieve. In particular, the additive-increase multiplicative-decrease (AIMD) mechanism employed by TCP hinges on its ability to meet specific throughput requirements since it has to respond to congestion signals promptly by decreasing its sending rate. The level and the timing of congestion signals impose strict limitations on the achievable throughput over short time-scales. To that end, this paper presents a new architecture, whereby a set of TCP connections (we refer to them as the Stunts) sacrifice their performance on behalf of another TCP connection (we refer to it as the Free) by picking up a delegated subset of the congestion signals and reacting to them in lieu of the free connection. This gives the Free connection just enough freedom to meet specific throughput requirements as requested by the application, without affecting the level of congestion in the network. We evaluate our architecture via extensive simulation experiments.","PeriodicalId":250085,"journal":{"name":"Seventh International Conference on Networking (icn 2008)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh International Conference on Networking (icn 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICN.2008.109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The performance of a TCP connection is typically dictated by what the network can provide rather than what the application would like to achieve. In particular, the additive-increase multiplicative-decrease (AIMD) mechanism employed by TCP hinges on its ability to meet specific throughput requirements since it has to respond to congestion signals promptly by decreasing its sending rate. The level and the timing of congestion signals impose strict limitations on the achievable throughput over short time-scales. To that end, this paper presents a new architecture, whereby a set of TCP connections (we refer to them as the Stunts) sacrifice their performance on behalf of another TCP connection (we refer to it as the Free) by picking up a delegated subset of the congestion signals and reacting to them in lieu of the free connection. This gives the Free connection just enough freedom to meet specific throughput requirements as requested by the application, without affecting the level of congestion in the network. We evaluate our architecture via extensive simulation experiments.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
解放TCP:自由和特技
TCP连接的性能通常取决于网络可以提供什么,而不是应用程序想要实现什么。特别是,TCP采用的加-增-乘-减(AIMD)机制取决于它满足特定吞吐量需求的能力,因为它必须通过降低发送速率来迅速响应拥塞信号。拥塞信号的水平和时间对短时间内可实现的吞吐量施加了严格的限制。为此,本文提出了一种新的体系结构,其中一组TCP连接(我们称其为噱头)牺牲其性能以代表另一个TCP连接(我们称其为自由),方法是获取拥塞信号的委托子集并对它们作出反应,以代替自由连接。这为Free连接提供了足够的自由来满足应用程序请求的特定吞吐量需求,而不会影响网络中的拥塞水平。我们通过大量的模拟实验来评估我们的架构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Application Layer Multicast for Collaborative Scenarios: The OMCAST Protocol Reduce Time Synchronization Cost for High Latency and Resource-Constrained Sensor Networks Restoration Mechanism for the N2R Topological Routing Algorithm A Hierarchical Game for Uplink CDMA Transmissions with Random Active Users Multicast Voice Transmission over Vehicular Ad Hoc Networks: Issues and Challenges
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1