面向内容的多源应用的接收器驱动拥塞控制

Yusaku Hayamizu, M. Yamamoto
{"title":"面向内容的多源应用的接收器驱动拥塞控制","authors":"Yusaku Hayamizu, M. Yamamoto","doi":"10.1109/CQR.2015.7129085","DOIUrl":null,"url":null,"abstract":"In content oriented application, such as P2P, a user does not care about where content is obtained and a content file can be downloaded from anywhere it is obtained. In some P2P systems, e.g. BitTorrent, a content file is divided into small parts, chunks, and each chunk is downloaded from anywhere. In this many-to-one communication style, one TCP session is set up for each pair of a sender and a receiver. If these sessions go through the same bottleneck link, many-to-one communication might obtain unfairly large throughput. In this paper, we propose a new receiver-driven congestion control for this many-to-one communications. Our proposed congestion control detects bottleneck-sharing flows and clusters them. Window coupling technique is applied for these clustered flows, which enables these flows to obtain fair aggregated throughput. Our simulation results show that our proposed receiver-driven congestion control fairly shares a bottleneck link with regular TCP.","PeriodicalId":274592,"journal":{"name":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Receiver-driven congestion control for content oriented application with multiple sources\",\"authors\":\"Yusaku Hayamizu, M. Yamamoto\",\"doi\":\"10.1109/CQR.2015.7129085\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In content oriented application, such as P2P, a user does not care about where content is obtained and a content file can be downloaded from anywhere it is obtained. In some P2P systems, e.g. BitTorrent, a content file is divided into small parts, chunks, and each chunk is downloaded from anywhere. In this many-to-one communication style, one TCP session is set up for each pair of a sender and a receiver. If these sessions go through the same bottleneck link, many-to-one communication might obtain unfairly large throughput. In this paper, we propose a new receiver-driven congestion control for this many-to-one communications. Our proposed congestion control detects bottleneck-sharing flows and clusters them. Window coupling technique is applied for these clustered flows, which enables these flows to obtain fair aggregated throughput. Our simulation results show that our proposed receiver-driven congestion control fairly shares a bottleneck link with regular TCP.\",\"PeriodicalId\":274592,\"journal\":{\"name\":\"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CQR.2015.7129085\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CQR.2015.7129085","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在面向内容的应用程序中,例如P2P,用户不关心从哪里获取内容,内容文件可以从任何地方下载。在一些P2P系统中,例如BitTorrent,一个内容文件被分成小块,每个块都可以从任何地方下载。在这种多对一的通信风格中,为每一对发送方和接收方建立一个TCP会话。如果这些会话经过相同的瓶颈链路,那么多对一通信可能会获得不公平的大吞吐量。在本文中,我们提出了一种新的接收端驱动的多对一通信拥塞控制。我们提出的拥塞控制检测瓶颈共享流并将它们聚类。对这些聚集的流应用窗口耦合技术,使这些流获得公平的聚合吞吐量。仿真结果表明,我们提出的接收端驱动的拥塞控制与常规TCP共享一个瓶颈链路。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Receiver-driven congestion control for content oriented application with multiple sources
In content oriented application, such as P2P, a user does not care about where content is obtained and a content file can be downloaded from anywhere it is obtained. In some P2P systems, e.g. BitTorrent, a content file is divided into small parts, chunks, and each chunk is downloaded from anywhere. In this many-to-one communication style, one TCP session is set up for each pair of a sender and a receiver. If these sessions go through the same bottleneck link, many-to-one communication might obtain unfairly large throughput. In this paper, we propose a new receiver-driven congestion control for this many-to-one communications. Our proposed congestion control detects bottleneck-sharing flows and clusters them. Window coupling technique is applied for these clustered flows, which enables these flows to obtain fair aggregated throughput. Our simulation results show that our proposed receiver-driven congestion control fairly shares a bottleneck link with regular TCP.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信