A Machine Learning Approach to Estimating Queuing Delay on Routers: The Multiple-Hop Case

Compression and Decompression (CoDe) is an active, state-of-the-art scheme for measuring queuing delay on Internet routers that utilizes an unsupervised learning algorithm for data processing. In this paper, we present a comparative evaluation of CoDe over a multiple-hop path under demanding traffic conditions using ns-3 simulation. This is the first evaluation of this kind because prior study of the scheme only considered a single-hop path, reflecting a limited performance evaluation. Our simulation data shows that CoDe measures queuing delay on intermediate routers along a multiple-hop path with high accuracy. It also outlines some measurement challenges prevalent in other existing schemes.

Authors

Institutions

Publication Details

Published
2024-11-27
DOI
https://doi.org/10.1109/itnac62915.2024.10815524
Citations
1
Primary Topic
Network Traffic and Congestion Control
Type
article
Field-Weighted Citation Impact
0.35
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Machine Learning Approach to Estimating Queuing Delay on Routers: The Multiple-Hop Case

Travis Ricker, Khondaker M. Salehin, Eiji Oki, Yi Wang et al.
1 citations
Network Traffic and Congestion Control
0.35
article

A Machine Learning Approach to Estimating Queuing Delay on Routers: The Multiple-Hop Case

Travis Ricker, Khondaker M. Salehin, Eiji Oki, Yi Wang, Alex Chen
article en
1 citations

Abstract

Compression and Decompression (CoDe) is an active, state-of-the-art scheme for measuring queuing delay on Internet routers that utilizes an unsupervised learning algorithm for data processing. In this paper, we present a comparative evaluation of CoDe over a multiple-hop path under demanding traffic conditions using ns-3 simulation. This is the first evaluation of this kind because prior study of the scheme only considered a single-hop path, reflecting a limited performance evaluation. Our simulation data shows that CoDe measures queuing delay on intermediate routers along a multiple-hop path with high accuracy. It also outlines some measurement challenges prevalent in other existing schemes.

Kyoto University (JP), California State University, Dominguez Hills (US), University of Portland (US)
Openalex Percentile: Top 35%
Network Traffic and Congestion Control
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Machine Learning Approach to Estimating Queuing Delay on Routers: The Multiple-Hop Case — Travis Ricker, Khondaker M. Salehin, et al. · (2024) | TGRS Research Map | TGRS