Detection of multiple bottleneck bandwidth

N. Thepvilojanapong, Y. Tobe, K. Sezaki
{"title":"Detection of multiple bottleneck bandwidth","authors":"N. Thepvilojanapong, Y. Tobe, K. Sezaki","doi":"10.1109/AINA.2003.1192965","DOIUrl":null,"url":null,"abstract":"This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC's TTM project to perform one-way delay (OWD) and loss measurement from a host in our laboratory to other hosts in Europe and USA. TTM is an active measurement system, which has implemented the IPPM one-way delay (RFC2679) and one-way loss metrics (RFC2680). From measured delay, loss, and traceroute's data, we can know the path properties such as bandwidth, path rerouting, congestion between each host, and so on. Based on measured delay, we propose an algorithm called Estimating Bottleneck Bandwidth using Packet-pair (EBBP), to estimate bottleneck bandwidth. Our algorithm is based on Bolot's (1993) equation, but we use OWD instead of round trip delay. Every participated host uses a GPS receiver to avoid the problem of clock difference. We make a phase plot graph from measured delay, extract useful samples, quantize extracted samples, and find the intercept of the phase plot graph by EBBP. Finally, we can estimate bottleneck bandwidth along the path.","PeriodicalId":382765,"journal":{"name":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"17th International Conference on Advanced Information Networking and Applications, 2003. AINA 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2003.1192965","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC's TTM project to perform one-way delay (OWD) and loss measurement from a host in our laboratory to other hosts in Europe and USA. TTM is an active measurement system, which has implemented the IPPM one-way delay (RFC2679) and one-way loss metrics (RFC2680). From measured delay, loss, and traceroute's data, we can know the path properties such as bandwidth, path rerouting, congestion between each host, and so on. Based on measured delay, we propose an algorithm called Estimating Bottleneck Bandwidth using Packet-pair (EBBP), to estimate bottleneck bandwidth. Our algorithm is based on Bolot's (1993) equation, but we use OWD instead of round trip delay. Every participated host uses a GPS receiver to avoid the problem of clock difference. We make a phase plot graph from measured delay, extract useful samples, quantize extracted samples, and find the intercept of the phase plot graph by EBBP. Finally, we can estimate bottleneck bandwidth along the path.
检测多个瓶颈带宽
本文提出了一种沿互联网路径检测和估计瓶颈带宽的方案。我们参加了RIPE NCC的TTM项目,从我们实验室的一台主机到欧洲和美国的其他主机进行单向延迟(OWD)和损耗测量。TTM是一种主动测量系统,实现了IPPM单向延迟(RFC2679)和单向损耗指标(RFC2680)。从测量的延迟、丢失和traceroute的数据中,我们可以知道路径属性,如带宽、路径重路由、每个主机之间的拥塞等等。在测量时延的基础上,提出了一种基于分组对的瓶颈带宽估计算法(EBBP)来估计瓶颈带宽。我们的算法基于Bolot(1993)的方程,但我们使用OWD而不是往返延迟。每个参与的主机都使用一个GPS接收器,避免了时钟差异的问题。从测量到的时延中得到相位图,提取有用的样本,对提取的样本进行量化,利用EBBP求出相位图的截距。最后,我们可以估计沿路径的瓶颈带宽。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信