被动TCP测量的时空分析

E. Brosh, Galit Lubetzky-Sharon, Y. Shavitt
{"title":"被动TCP测量的时空分析","authors":"E. Brosh, Galit Lubetzky-Sharon, Y. Shavitt","doi":"10.1109/INFCOM.2005.1498324","DOIUrl":null,"url":null,"abstract":"In this paper we look at TCP data which was passively collected from an edge ISP, and analyze it to obtain some new results and deeper understanding of TCP loss process. The focus of our study is to identify the 'root cause' links, i.e., the links that are responsible for the majority of the losses or reorders found on the end-to-end TCP connection. We suggest a new root cause criterion and a cost-effective algorithm to identify the root cause links. The algorithm incorporates a new out-of-sequence packet classification technique which is interesting by itself. We test our algorithm on the collected and simulated data and analytically justify its correctness. The simulation results show that the algorithm has a 95% detection rate with 10% false detection rate. We also analyze TCP temporal loss process, and found that the burst loss size is geometrically distributed. We analyze the TCP time-out loss indication under the Bernoulli loss model, which is the simplest model that can cause a geometric distribution, and show that the behavior of the TCP loss process is not different than when tail drop is assumed.","PeriodicalId":20482,"journal":{"name":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","volume":"17 1","pages":"949-959 vol. 2"},"PeriodicalIF":0.0000,"publicationDate":"2005-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"Spatial-temporal analysis of passive TCP measurements\",\"authors\":\"E. Brosh, Galit Lubetzky-Sharon, Y. Shavitt\",\"doi\":\"10.1109/INFCOM.2005.1498324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we look at TCP data which was passively collected from an edge ISP, and analyze it to obtain some new results and deeper understanding of TCP loss process. The focus of our study is to identify the 'root cause' links, i.e., the links that are responsible for the majority of the losses or reorders found on the end-to-end TCP connection. We suggest a new root cause criterion and a cost-effective algorithm to identify the root cause links. The algorithm incorporates a new out-of-sequence packet classification technique which is interesting by itself. We test our algorithm on the collected and simulated data and analytically justify its correctness. The simulation results show that the algorithm has a 95% detection rate with 10% false detection rate. We also analyze TCP temporal loss process, and found that the burst loss size is geometrically distributed. We analyze the TCP time-out loss indication under the Bernoulli loss model, which is the simplest model that can cause a geometric distribution, and show that the behavior of the TCP loss process is not different than when tail drop is assumed.\",\"PeriodicalId\":20482,\"journal\":{\"name\":\"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.\",\"volume\":\"17 1\",\"pages\":\"949-959 vol. 2\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-03-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.2005.1498324\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.2005.1498324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

本文对从边缘ISP被动采集的TCP数据进行了分析,得到了一些新的结果,对TCP丢失过程有了更深入的认识。我们研究的重点是确定“根本原因”链接,即对端到端TCP连接上发现的大部分损失或重排序负责的链接。我们建议一个新的根本原因标准和一个经济有效的算法来识别根本原因链接。该算法结合了一种新的乱序包分类技术,该技术本身就很有趣。我们在收集和模拟的数据上测试了我们的算法,并分析证明了它的正确性。仿真结果表明,该算法的检测率为95%,误检率为10%。分析了TCP的时间损耗过程,发现突发损耗大小呈几何分布。本文分析了能引起几何分布的最简单的伯努利损耗模型下的TCP超时损耗指示,并表明TCP损耗过程的行为与假设尾部下降时的行为没有什么不同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Spatial-temporal analysis of passive TCP measurements
In this paper we look at TCP data which was passively collected from an edge ISP, and analyze it to obtain some new results and deeper understanding of TCP loss process. The focus of our study is to identify the 'root cause' links, i.e., the links that are responsible for the majority of the losses or reorders found on the end-to-end TCP connection. We suggest a new root cause criterion and a cost-effective algorithm to identify the root cause links. The algorithm incorporates a new out-of-sequence packet classification technique which is interesting by itself. We test our algorithm on the collected and simulated data and analytically justify its correctness. The simulation results show that the algorithm has a 95% detection rate with 10% false detection rate. We also analyze TCP temporal loss process, and found that the burst loss size is geometrically distributed. We analyze the TCP time-out loss indication under the Bernoulli loss model, which is the simplest model that can cause a geometric distribution, and show that the behavior of the TCP loss process is not different than when tail drop is assumed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信