COMPRESS: A Self-Sufficient Scheme for Measuring Queueing Delay on the Internet Routers

Khondaker M. Salehin, R. Rojas-Cessa, Ki-Won Kwon
{"title":"COMPRESS: A Self-Sufficient Scheme for Measuring Queueing Delay on the Internet Routers","authors":"Khondaker M. Salehin, R. Rojas-Cessa, Ki-Won Kwon","doi":"10.1109/ICCNC.2019.8685606","DOIUrl":null,"url":null,"abstract":"Knowledge of queueing delay is important for determining the qualitative state of the Internet, which is essential for various delay-sensitive applications. However, the measurement of queueing delay on routers continues to be a complex and open problem because existing schemes require infrastructural support and administrative access to the Internet. In this paper, we pro-pose an active scheme, called COMpound Probe compRESSion (COMPRESS) that is capable of measuring queueing delay on the Internet routers over an end-to-end path. The proposed scheme performs the measurement in a hop-by-hop manner using User Datagram Protocol (UDP) based probing packets. It is simple and self-sufficient in comparison to the existing schemes. We have implemented the proposed scheme in a simulation environment to present a preliminary evaluation under different levels of queueing delays on the intermediate routers along an end-to-end path. Our simulation results show that the scheme consistently measures queueing delay with a high accuracy and is sensitive to a light queueing delay as well.","PeriodicalId":161815,"journal":{"name":"2019 International Conference on Computing, Networking and Communications (ICNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Computing, Networking and Communications (ICNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNC.2019.8685606","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Knowledge of queueing delay is important for determining the qualitative state of the Internet, which is essential for various delay-sensitive applications. However, the measurement of queueing delay on routers continues to be a complex and open problem because existing schemes require infrastructural support and administrative access to the Internet. In this paper, we pro-pose an active scheme, called COMpound Probe compRESSion (COMPRESS) that is capable of measuring queueing delay on the Internet routers over an end-to-end path. The proposed scheme performs the measurement in a hop-by-hop manner using User Datagram Protocol (UDP) based probing packets. It is simple and self-sufficient in comparison to the existing schemes. We have implemented the proposed scheme in a simulation environment to present a preliminary evaluation under different levels of queueing delays on the intermediate routers along an end-to-end path. Our simulation results show that the scheme consistently measures queueing delay with a high accuracy and is sensitive to a light queueing delay as well.
压缩:一种自给自足的因特网路由器排队延迟测量方案
了解排队延迟对于确定Internet的定性状态非常重要,这对于各种延迟敏感的应用程序是必不可少的。然而,测量路由器上的排队延迟仍然是一个复杂而开放的问题,因为现有的方案需要基础设施支持和对Internet的管理访问。在本文中,我们提出了一种主动方案,称为复合探测压缩(COMPRESS),它能够在端到端路径上测量互联网路由器上的排队延迟。该方案使用基于用户数据报协议(UDP)的探测包以逐跳方式进行测量。与现有的方案相比,它是简单和自给自足的。我们在仿真环境中实现了所提出的方案,并在端到端路径上的中间路由器上不同级别的排队延迟下给出了初步评估。仿真结果表明,该方案能够准确地测量排队延迟,并且对轻微的排队延迟敏感。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信