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

Salehin, Khondaker M.; Rojas‐Cessa, Roberto; Kwon, Ki Won

doi:10.1109/iccnc.2019.8685606

Cited by 3 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, based on our experimental observations, it is difficult for the algorithm to converge. Moreover, in [30], the authors invoked an active scheme that could measure the queuing delay on the Internet routers through an end-to-end path. The proposed solution used User Datagram Protocol (UDP) based probing packets to measure in a hop-by-hop manner, which was simple and self-sufficient.…”

Section: Related Workmentioning

confidence: 99%

Matrix completion based adaptive sampling for measuring network delay with online support

2020

KSII TIIS

View full text Add to dashboard Cite

End-to-end network delay plays an vital role in distributed services. This delay is used to measure QoS (Quality-of-Service). It would be beneficial to know all node-pair delay information, but unfortunately it is not feasible in practice because the use of active probing will cause a quadratic growth in overhead. Alternatively, using the measured network delay to estimate the unknown network delay is an economical method. In this paper, we adopt the state-of-the-art matrix completion technology to better estimate the network delay from limited measurements. Although the number of measurements required for an exact matrix completion is theoretically bounded, it is practically less helpful. Therefore, we propose an online adaptive sampling algorithm to measure network delay in which statistical leverage scores are used to select potential matrix elements. The basic principle behind is to sample the elements with larger leverage scores to keep the traits of important rows or columns in the matrix. The amount of samples is adaptively decided by a proposed stopping condition. Simulation results based on real delay matrix show that compared with the traditional sampling algorithm, our proposed sampling algorithm can provide better performance (smaller estimation error and less convergence pressure) at a lower cost (fewer samples and shorter processing time).

show abstract

Section: Related Workmentioning

confidence: 99%

Matrix completion based adaptive sampling for measuring network delay with online support

2020

KSII TIIS

View full text Add to dashboard Cite

show abstract

“…For multiple-hop measurement, we simulated the 4-hop path in Fig. 8, as an extension to our most recent work on queuing delay [32]. This end-to-end path is made up of four 100 Mb/s links and three intermediate routers: node 1, node 2, and node 3, between src and dst.…”

Section: B Multiple-hop Pathmentioning

confidence: 99%

A Simulation Study of the Measurement of Queueing Delay Over End-to-End Paths

Salehin

Kwon

Rojas‐Cessa

2020

IEEE Open J. Comput. Soc.

Self Cite

View full text Add to dashboard Cite

Determining the qualitative States-of-the-Internet requires an accurate knowledge of queueing delay over an end-to-end path. However, the measurement of queueing delay in a large network is still considered a complex and open problem. Existing schemes that measure queueing delay compensate for this complexity using a high infrastructural support and administrative access to the path under test even though their feasibility and accuracy on the Internet are low. In this article, we propose an active scheme, called COMPRESS: COMpound Probe compRESSion, to measure queueing delay on all routers over an end-to-end path. The proposed scheme performs per-hop measurement using UDP-based probing packets. It is both simple and self-sufficient in comparison to the existing schemes. We have implemented the proposed scheme in a simulation environment to present a controlled performance evaluation under different levels (e.g., light, moderate, and heavy) and types (e.g., symmetric and asymmetric) of queueing delays over single-and multiple-hop paths. Our simulation results show that the scheme is sensitive to the induced queueing delays and consistently produces a high measurement accuracy. Overall, the scheme has an average measurement error of around 20% or below over the simulated paths.

show abstract

A Machine Learning Approach to Estimating Queuing Delay on a Router over a Single-Hop Path

Ricker

Salehin

Wang

et al. 2022

ICC 2022 - IEEE International Conference on Communications

View full text Add to dashboard Cite

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

Cited by 3 publications

References 20 publications

Matrix completion based adaptive sampling for measuring network delay with online support

Matrix completion based adaptive sampling for measuring network delay with online support

A Simulation Study of the Measurement of Queueing Delay Over End-to-End Paths

A Machine Learning Approach to Estimating Queuing Delay on a Router over a Single-Hop Path

Contact Info

Product

Resources

About