Evaluating and modeling window synchronization in highly multiplexed flows

J. Gast, P. Barford
{"title":"Evaluating and modeling window synchronization in highly multiplexed flows","authors":"J. Gast, P. Barford","doi":"10.1109/WWC.2003.1249057","DOIUrl":null,"url":null,"abstract":"In this paper, we investigate issues of synchronization in highly aggregated flows such as would be found in the Internet backbone. Our hypothesis is that regularly spaced loss events lead to window synchronization in long lived flows. We argue that window synchronization is likely to be more common in the Internet than previously reported. We support our argument with evidence of the existence and evaluation of the characteristics of periodic discrete congestion events using active probe data gathered in the Surveyor infrastructure. When connections experience loss events which are periodic, the aggregate offered load to neighboring links rises and falls in cadence with the loss events. Connections whose cWnd values grow from W/2 to W at approximately the same rate as the loss event period soon synchronize their cWnd additive increases and multiplicative decreases. We find that this window synchronization can scale to large numbers of connections depending on the diversity of roundtrip times of individual flows. A model is presented that predicts important characteristics of the loss events in window synchronized flows including the quantity, intensity, and duration. The model effectively explains the prevalence of discrete loss events in fast links with high multiplexing factors as well as the queue buildup and queue draining phases of congestion.","PeriodicalId":432745,"journal":{"name":"2003 IEEE International Conference on Communications (Cat. No.03CH37441)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 IEEE International Conference on Communications (Cat. No.03CH37441)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WWC.2003.1249057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we investigate issues of synchronization in highly aggregated flows such as would be found in the Internet backbone. Our hypothesis is that regularly spaced loss events lead to window synchronization in long lived flows. We argue that window synchronization is likely to be more common in the Internet than previously reported. We support our argument with evidence of the existence and evaluation of the characteristics of periodic discrete congestion events using active probe data gathered in the Surveyor infrastructure. When connections experience loss events which are periodic, the aggregate offered load to neighboring links rises and falls in cadence with the loss events. Connections whose cWnd values grow from W/2 to W at approximately the same rate as the loss event period soon synchronize their cWnd additive increases and multiplicative decreases. We find that this window synchronization can scale to large numbers of connections depending on the diversity of roundtrip times of individual flows. A model is presented that predicts important characteristics of the loss events in window synchronized flows including the quantity, intensity, and duration. The model effectively explains the prevalence of discrete loss events in fast links with high multiplexing factors as well as the queue buildup and queue draining phases of congestion.
高复用流中窗口同步的评估与建模
在本文中,我们研究了高度聚合流中的同步问题,例如在互联网骨干网中发现的同步问题。我们的假设是,有规则间隔的损失事件导致长时间流中的窗口同步。我们认为窗口同步在Internet中可能比以前报道的更常见。我们使用在Surveyor基础设施中收集的主动探针数据,用存在和评估周期性离散拥塞事件特征的证据来支持我们的论点。当连接经历周期性的丢失事件时,向相邻链路提供的总负载会随着丢失事件的发生而起伏。当cWnd值从W/2增长到W的速率与损失事件周期大致相同时,它们的cWnd加性增加,乘性减少。我们发现,这种窗口同步可以扩展到大量的连接,这取决于单个流的往返时间的多样性。提出了一个预测窗口同步流中损失事件的重要特征的模型,包括损失事件的数量、强度和持续时间。该模型有效地解释了具有高复用因子的快速链路中离散丢失事件的普遍性以及拥塞的队列建立和队列疏解阶段。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信