Measuring Available Bandwidth: pathChirp's Chirp Train Structure Remodeled

S. Suthaharan, S. Kumar
{"title":"Measuring Available Bandwidth: pathChirp's Chirp Train Structure Remodeled","authors":"S. Suthaharan, S. Kumar","doi":"10.1109/ATNAC.2008.4783354","DOIUrl":null,"url":null,"abstract":"Measuring available bandwidth over a network path is required by many applications including end-to-end admission control and server selection. In order to measure the available bandwidth, the end hosts need network information, such as packet delay, at intermediate systems. Several techniques have been proposed to address this problem. We have selected the most recently proposed algorithm called pathChirp and proposed an alternative approach. The main goal of pathChirp is to get the delay information at the intermediate systems by using the concept of self-induced congestion (which uses chirp train packets) in order to estimate the available bandwidth. However there are scenarios where pathChirp cannot provide accurate available bandwidth. We use the pathChirp mechanism as our underlying tool and modify its structure of chirp train. In the modified structure, the rate of the odd inter-chirp packet will be the same as the rate of previous even inter-chirp packet. Additionally, rate of inter-chirp packets will be increased exponentially with even power rather than both even and odd power as done in pathChirp scheme. Purpose of this new structure is to capture more network information using three different time-shifted chirp trains, and subsequently to find a better estimate for the available bandwidth. Our theory and simulation results support this claim.","PeriodicalId":143803,"journal":{"name":"2008 Australasian Telecommunication Networks and Applications Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Australasian Telecommunication Networks and Applications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATNAC.2008.4783354","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Measuring available bandwidth over a network path is required by many applications including end-to-end admission control and server selection. In order to measure the available bandwidth, the end hosts need network information, such as packet delay, at intermediate systems. Several techniques have been proposed to address this problem. We have selected the most recently proposed algorithm called pathChirp and proposed an alternative approach. The main goal of pathChirp is to get the delay information at the intermediate systems by using the concept of self-induced congestion (which uses chirp train packets) in order to estimate the available bandwidth. However there are scenarios where pathChirp cannot provide accurate available bandwidth. We use the pathChirp mechanism as our underlying tool and modify its structure of chirp train. In the modified structure, the rate of the odd inter-chirp packet will be the same as the rate of previous even inter-chirp packet. Additionally, rate of inter-chirp packets will be increased exponentially with even power rather than both even and odd power as done in pathChirp scheme. Purpose of this new structure is to capture more network information using three different time-shifted chirp trains, and subsequently to find a better estimate for the available bandwidth. Our theory and simulation results support this claim.
测量可用带宽:pathChirp的Chirp序列结构重构
许多应用程序都需要测量网络路径上的可用带宽,包括端到端准入控制和服务器选择。为了测量可用带宽,终端主机需要中间系统的网络信息,如数据包延迟。已经提出了几种技术来解决这个问题。我们选择了最新提出的算法pathChirp,并提出了一种替代方法。pathChirp的主要目标是利用自诱导拥塞(使用chirp列车数据包)的概念获得中间系统的延迟信息,从而估计可用带宽。然而,在某些情况下,pathChirp不能提供准确的可用带宽。我们使用pathChirp机制作为我们的底层工具,并修改其啁啾序列的结构。在改进后的结构中,奇数啁啾间包的速率将与之前的偶数啁啾间包的速率相同。此外,与pathChirp方案的奇偶功率相比,偶数功率下的啁啾间包速率将呈指数级增长。这种新结构的目的是使用三种不同的时移啁啾序列捕获更多的网络信息,然后找到更好的可用带宽估计。我们的理论和模拟结果支持这一说法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信